2.4测试赛AC代码临时保存

//H
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<stack>

using namespace std;

char s1[1010],s2[1010],ans[1010];

void AandB()
{
    stack<int>s;
    int n = strlen(s1), m = strlen(s2);
    int cnt1 = n-1, cnt2 = m-1;
    int a,b,last=0;
    while(cnt1>=0 || cnt2>=0)
    {
        if(cnt1 != -1)
        {
            a = s1[cnt1--] - '0';
        }
        else
        {
            a = 0;
        }
        if(cnt2 != -1)
        {
            b = s2[cnt2--] - '0';
        }
        else
        {
            b = 0;
        }
        int z = a + b + last;
        s.push(z%10);
        last = z / 10;
    }
    int cnt = 0;
    while(!s.empty())
    {
        ans[cnt++] = s.top() + '0';
        s.pop();
    }
    ans[cnt] = 0;
    return ;
}

int main()
{
    int t;
    scanf("%d",&t);
    for(int i=1; i<=t; i++)
    {
        getchar();
        scanf("%s %s",s1,s2);
        AandB();
        if(i!=1) printf("\n");
        printf("Case %d:\n%s + %s = %s\n",i,s1,s2,ans);
    }
    return 0;
} 

//A
#include<bits/stdc++.h>

using namespace std;

int f[1000010];

int main()
{
    f[0] = 1; f[1] = 2;
    for(int i=2; i<1000010; i++)
    {
        int x = f[i-1] + f[i-2];
        f[i] = x % 3;
    }
    int n;
    while(~scanf("%d",&n))
    {
        if(!f[n]) printf("yes\n");
        else printf("no\n");
    }
    return 0;
}

//D
#include<bits/stdc++.h>

using namespace std;

int main()
{
    long long a,b,z,ans,y,x;
    int t;
    scanf("%d",&t);
    for(int i=1; i<=t; i++)
    {
        scanf("%lld %lld",&a,&b);
        z = b - a + 1;
        ans = z / 3 * 2;
        y = a % 3;
        x = z % 3;
        if(y == 1 && x == 2)
        {
            ans++;
        }
        else if(y == 0 && x >= 1)
        {
            ans++;
        }
        else if(y == 2)
        {
            ans += x;
        }
        printf("Case %d: %lld\n",i,ans);
    }
    return 0;
}

//D（二）
#include<bits/stdc++.h>

using namespace std;

int main()
{
    long long a,b,ans,y,x;
    int t;
    scanf("%d",&t);
    for(int i=1; i<=t; i++)
    {
        scanf("%lld %lld",&a,&b);
        a--;
        x = a / 3 * 2 + (a%3==2);
        y = b / 3 * 2 + (b%3==2);
        ans = y - x;
        printf("Case %d: %lld\n",i,ans);
    }
    return 0;
}

//I
#include<bits/stdc++.h>

using namespace std;

int num[100010];

int main()
{
    int n,t,maxsum,thissum,maxl,thisl,r,i;
    scanf("%d",&t);
    for(int j=1; j<=t; j++)
    {
        scanf("%d",&n);
        thissum = 0;
        r = maxl = thisl = 1;
        for(i=1; i<=n; i++)
        {
            scanf("%d",&num[i]);
            if(i == 1) maxsum = num[i];
            thissum += num[i];
            if(thissum > maxsum)
            {
                maxsum = thissum;
                maxl = thisl;
                r = i;
            }
            if(thissum < 0)
            {
                thissum = 0;
                thisl = i + 1;
            }
        }
        if(j != 1) printf("\n");
        printf("Case %d:\n%d %d %d\n",j,maxsum,maxl,r);
    }
    return 0;
}

//B
#include<cstdio>
#include<cstdlib>
#include<queue>
#include<cstring>
#include<algorithm>

using namespace std;

struct node
{
    int x,y,z;
};
int u,v,w;
char dun[31][31][31];
int book[31][31][31];
queue<node>q;

void Insert(int a,int b,int c,int l)
{
    if(dun[a][b][c] == '#' || book[a][b][c] != 0) return ;
    node t = {a,b,c};
    q.push(t);
    book[a][b][c] = l + 1;
}

bool InDun(int x,int y,int z,int l,int r,int c)
{
    if(x<l && x>=0 && y<r && y>=0 && z<c && z>=0) return 1;
    else return 0;
}

bool bfs(int l,int r,int c)
{
    while(!q.empty())
    {
        node t = q.front();
        q.pop();
        if(dun[t.x][t.y][t.z] == 'E')
        {
            u = t.x; v = t.y; w = t.z;
            return 1;
        }
        if(InDun(t.x+1,t.y,t.z,l,r,c)) Insert(t.x+1,t.y,t.z,book[t.x][t.y][t.z]);
        if(InDun(t.x-1,t.y,t.z,l,r,c)) Insert(t.x-1,t.y,t.z,book[t.x][t.y][t.z]);
        if(InDun(t.x,t.y+1,t.z,l,r,c)) Insert(t.x,t.y+1,t.z,book[t.x][t.y][t.z]);
        if(InDun(t.x,t.y-1,t.z,l,r,c)) Insert(t.x,t.y-1,t.z,book[t.x][t.y][t.z]);
        if(InDun(t.x,t.y,t.z+1,l,r,c)) Insert(t.x,t.y,t.z+1,book[t.x][t.y][t.z]);
        if(InDun(t.x,t.y,t.z-1,l,r,c)) Insert(t.x,t.y,t.z-1,book[t.x][t.y][t.z]);
    }
    return 0;
}

int main()
{
    int l,r,c;
    node qi;
    while(~scanf("%d %d %d",&l,&r,&c))
    {
        if(l==0 && r==0 && c==0) break;
        getchar();
        memset(book,0,sizeof(book));
        while(!q.empty()) q.pop();
        for(int i=0; i<l; i++)
        {
            for(int j=0; j<r; j++)
            {
                for(int k=0; k<c; k++)
                {
                    scanf("%c",&dun[i][j][k]);
                    if(dun[i][j][k] == 'S')
                    {
                        qi.x = i; qi.y = j; qi.z = k;
                        book[i][j][k] = 1;
                    }
                }
                getchar();
            }
            getchar();
        }
        q.push(qi);
        if(bfs(l,r,c)) printf("Escaped in %d minute(s).\n",book[u][v][w]-1);
        else printf("Trapped!\n");
    }
    return 0;
}