UVa 1489 - Integer Game

1489 - Integer Game

Two players, S and T, are playing a game where they make alternate moves. S plays rst.
In this game, they start with an integer N. In each move, a player removes one digit from the
integer and passes the resulting number to the other player. The game continues in this fashion until
a player nds he/she has no digit to remove when that player is declared as the loser.
With this restriction, its obvious that if the number of digits in N is odd then S wins otherwise T
wins. To make the game more interesting, we apply one additional constraint. A player can remove a
particular digit if the sum of digits of the resulting number is a multiple of 3 or there are no digits left.
Suppose N = 1234. S has 4 possible moves. That is, he can remove 1, 2, 3, or 4. Of these, two of
them are valid moves.
Removal of 4 results in 123 and the sum of digits = 1 + 2 + 3 = 6; 6 is a multiple of 3.
Removal of 1 results in 234 and the sum of digits = 2 + 3 + 4 = 9; 9 is a multiple of 3.
The other two moves are invalid.
If both players play perfectly, who wins?
Input
The rst line of input is an integer T (T < 60) that determines the number of test cases. Each case is
a line that contains a positive integer N. N has at most 1000 digits and does not contain any zeros.
Output
For each case, output the case number starting from 1. If S wins then output `S' otherwise output `T'.
Sample Input
3
4
33
771
Sample Output
Case 1: S
Case 2: T
Case 3: T


水题,找到规律即可。



#include <iostream>
#include <cstdio>
using namespace std;

int main()
{
    int n;
    cin>>n;
    for(int k=1; k<=n; k++)
    {
        char a[1005];
        cin>>a;
        int sum=0,num=0;
        for(int i=0; a[i]; i++)
        {
            a[i]=a[i]-'0';
            if(a[i]%3==0)
                sum++;
            num+=a[i];
        }
        if(num%3==0)
        {
            if(sum%2==0)
                printf("Case %d: T\n",k);
            else
                printf("Case %d: S\n",k);
            continue;
        }
        int flag=1;
        if(num%3==1)
        {
            for(int i=0; a[i]; i++)
            {
                if(a[i]%3==1)
                {
                    flag=0;
                    if(sum%2==0)
                        printf("Case %d: S\n",k);
                    else
                        printf("Case %d: T\n",k);
                    break;
                }
            }
            if(flag==1)
                printf("Case %d: T\n",k);
            continue;
        }
        if(num%3==2)
        {
            for(int i=0; a[i]; i++)
            {
                if(a[i]%3==2)
                {
                    flag=0;
                    if(sum%2==0)
                        printf("Case %d: S\n",k);
                    else
                        printf("Case %d: T\n",k);
                    break;
                }
            }
            if(flag==1)
                printf("Case %d: T\n",k);
            continue;
        }
    }
    return 0;
}

阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/wilver/article/details/46815351
文章标签: uva
个人分类: uva
上一篇CodeForces 3C Tic-tac-toe 井字棋盘游戏
下一篇poj1611 The Suspects 并查集
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭