#include<stdio.h>
#include<string.h>
#include<math.h>
#include<string>
#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<list>
#include<map>
#include<set>
using namespace std;
char a[1010];
int v[1010];
bool vis[1010];
int len,sum;
int deal(){
memset(vis,0,sizeof(vis));
int cnt=0;
bool fg=0;
int len=strlen(a);
while(1){
for(int i=0 ; i < len ; i++){
if(vis[i] == 0 && (sum-v[i]) % 3 == 0){
vis[i] = 1;
sum -= v[i];
fg = 1;
cnt ++;
}
}
if(fg == 0) break;
fg=0;
}
int num = 0;
for(int i = 0 ; i < len ; i++)
if(vis[i]==0) num++;
if(num==1) return cnt+1;
else return cnt;
}
bool work(){
sum = 0 ;
for(int i = 0 ; a[i] ; i++){
v[i] = a[i] - '0';
sum += v[i] ;
}
int cnt = deal();
if(cnt & 1 ) return 1;
else return 0;
}
int main()
{
// freopen("in.in","r",stdin);
int T;
scanf("%d", &T);
for(int ca = 1; ca <= T ; ca++){
scanf("%s",a);
printf("Case %d: ",ca);
if( work() )
printf("S\n");
else
printf("T\n");
}
return 0;
}
UVA 11489 搜索
最新推荐文章于 2019-08-19 20:53:02 发布