Alice and Bob are playing a game with marbles; you may have played this game in childhood. The game is playing by alternating turns. In each turn a player can take exactly one or two marbles.
Both Alice and Bob know the number of marbles initially. Now the game can be started by any one. But the winning condition depends on the player who starts it. If Alice starts first, then the player who takes the last marble looses the game. If Bob starts first, then the player who takes the last marble wins the game.
Now you are given the initial number of marbles and the name of the player who starts first. Then you have to find the winner of the game if both of them play optimally.
Input starts with an integer T (≤ 10000), denoting the number of test cases.
Each case contains an integer n (1 ≤ n < 231) and thename of the player who starts first.
For each case, print the case number and the name of the winning player.
3
1 Alice
2 Alice
3 Bob
Case 1: Bob
Case 2: Alice
Case 3: Alice
题意:有两个人在玩游戏,Alice和Bob,两个人轮流拿一个或两个石子,如果Alice先手的话,谁拿最后一个石子谁输,Bob正好相反;思路:明显的Bash博弈,可以去我的博客里看看《Bash游戏》(刷刷阅读量,^_^),或者自己推导也行;
下面附上代码:
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t,n,k=0;
char s[6];
cin>>t;
while(t--)
{
scanf("%d %s",&n,s);
if(s[0]=='A')
{
if((n-1)%3==0) printf("Case %d: Bob\n",++k);
else printf("Case %d: Alice\n",++k);
}
else
{
if(n%3==0) printf("Case %d: Alice\n",++k);
else printf("Case %d: Bob\n",++k);
}
}
return 0;
}