UVA 11489 Integer Game——博弈

UVA 11489 Integer Game——博弈

#include #include #include #include using namespace std;const int maxn = 1005;char s[maxn];int T, n;int main() { //freopen("out.txt", "w", stdout); scanf("%d", &T); for (int kase = 1; kase <= T; kase++) { cin >> s; n = strlen(s); if (n == 1) { printf("Case %d: S\n", kase); continue; } int sum = 0, cnt = 0; for (int i = 0; i < n; i++) { sum += s[i]-'0'; if ((s[i]-'0') % 3 == 0) cnt++; } if (sum % 3 == 0) { if (cnt % 2 == 0) printf("Case %d: T\n", kase); else printf("Case %d: S\n", kase); continue; } else { bool ok = false; for (int i = 0; i < n; i++) { if ((sum-s[i]+'0') % 3 == 0) { ok = true; break; } } if (!ok) { printf("Case %d: T\n", kase); continue; } else { if (cnt % 2 == 0) printf("Case %d: S\n", kase); else printf("Case %d: T\n", kase); continue; } } } return 0;}

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。