整数游戏 (Integer Game,UVa 11489)

#include <iostream>
#include <string.h>
#include <string>
#include <fstream>
#include <algorithm>
#include <stdio.h>
#include <vector>
#include <queue>
#include <set>
#include <cmath>
using namespace std;
const double eps = 1e-8;
const int INF=0x7fffffff;
unsigned long long uINF = ~0LL;
#define MAXN 10000007
typedef long long LL;
LL vis[MAXN];
LL prime[MAXN];

void sieve(LL n)
{
    LL m=(LL)sqrt(n+0.5);
    memset(vis,0,sizeof(vis));
    for(LL i=2;i<=m;i++)if(!vis[i])
    for(LL j=i*i;j<=n;j+=i)vis[j]=1;
}

LL gen_prime(LL n)
{
    sieve(n);
    LL c=0;
    for(LL i=2;i<=n;i++)if(!vis[i])
        prime[c++]=i;
    return c;
}

LL gcd(LL a,LL b)
{
    return b==0?a:gcd(b,a%b);
}

int main()
{
    int T,t=1;scanf("%d",&T);
    string s;
    while(T--)
    {
        cin>>s;
        int sum=0,count=0;
        for(int i=0;i<s.length();i++)
        {sum+=s[i]-'0';if((s[i]-'0')%3==0)count++;}
        bool flag=false;
        for(int i=0;i<s.length();i++)
        {
            if((sum-(s[i]-'0'))%3==0){flag=true;if(sum%3==0)count--;break;}
        }
        printf("Case %d: ",t++);
        if(flag&&count%2==0)printf("S
");
        else printf("T
");
    }

    return 0;
}