UVA 11489 - Integer Game(找规律)
2013-10-22 09:10
225 查看
题目链接
#include <cstdio> #include <cstring> #include <string> #include <cmath> #include <ctime> #include <cstdlib> #include <iostream> using namespace std; char str[1001]; int flag[4]; int main() { int t,cas = 1,i,len,sum,ans; scanf("%d",&t); while(t--) { memset(flag,0,sizeof(flag)); scanf("%s",str); len = strlen(str); ans = 0; sum = 0; for(i = 0;i < len;i ++) { flag[(str[i]-'0')%3] ++; sum += (str[i]-'0')%3; } printf("Case %d: ",cas++); if(flag[sum%3]) { flag[sum%3] --; ans ++; } else { printf("T\n"); continue; } if((ans + flag[0])%2 == 1) printf("S\n"); else printf("T\n"); } return 0; }
相关文章推荐
- uva11489 - Integer Game(考思维,找规律)
- UVA 11489 Integer Game(博弈,规律)
- Integer Game(UVA11489)3的倍数
- UVa11489 - Integer Game(博弈)
- Uva 11489 - Integer Game 解题报告(简单推理)
- Integer Game(UVA11489)3的倍数
- UVa 11489 - Integer Game (简单博弈 脑筋急转弯)
- uva 11489 Integer Game
- uva 11489 - Integer Game(水题)
- UVa 11489 Integer Game
- Uva11489 Integer Game
- Uva 11489 - Integer Game
- (UVA - 11489)Integer Game(博弈)
- Integer Game(UVA 11489)
- UVA 11489 - Integer Game(数论+博弈)
- UVA 11489 - Integer Game 博弈
- UVa 11489 (博弈) Integer Game
- UVa11489 - Integer Game
- UVA 11489 - Integer Game 博弈
- UVA - 11489 Integer Game (博弈)