hdu 5373 the shortest problem

根据同余定理，可得性质：奇偶位的和之差能被11整除，则该数能被11整除。

用c++超时，用G++就过了，

(╯°Д°)╯︵┴┴

#include<iostream>
#include<cstdio>
#include<cmath>
#include<map>
#include<set>
#include<algorithm>
#include<queue>
#include<stack>
#include<cstdlib>
#include<cstring>
#include<vector>
#pragma comment(linker, "/STACK:1024000000,1024000000")
using namespace std;
typedef long long LL;
typedef unsigned long long uLL;
typedef __int64 LI;
typedef unsigned __int64 uLI;
typedef unsigned int uI;
typedef double db;
#define maxn 100005
#define inf 0x3f3f3f3f
stack<char>s;
void get(int n){
    while(n){
        s.push(n%10);
        n/=10;
    }
}
int main()
{
    int n,ca=1,t;
    while(~scanf("%d%d",&n,&t))
    {
        if(n==-1&&t==-1) break;
        int s1=0,s2=0,f=1;
        get(n);
        while(!s.empty()){
            if(f) s1+=s.top();
            else s2+=s.top();
            s.pop();
            f=1-f;
        }
        while(t--){
            get(s1+s2);
            while(!s.empty()){
                if(f) s1+=s.top();
                else s2+=s.top();
                s.pop();
                f=1-f;
            }
        }
        printf("Case #%d: ",ca++);
        if(abs(s1-s2)%11==0) puts("Yes");
        else puts("No");
    }
    return 0;
}