hdu3389 Game

Game

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 255 Accepted Submission(s): 174

Problem Description

Bob and Alice are playing a new game. There are n boxes which have been numbered from 1 to n. Each box is either empty or contains several cards. Bob and Alice move the cards in turn. In each turn the corresponding player should choose a non-empty box A and choose another box B that B

Input

The first line contains an integer T (T<=100) indicating the number of test cases. The first line of each test case contains an integer n (1<=n<=10000). The second line has n integers which will not be bigger than 100. The i-th integer indicates the number of cards in the i-th box.

Output

For each test case, print the case number and the winner's name in a single line. Follow the format of the sample output.

Sample Input

2 2 1 2 7 1 3 3 2 2 1 2

Sample Output

Case 1: Alice Case 2: Bob

#include 
#include 
#include 
using namespace std;
int main()
{
    int tcase,n,i,pri,tt=1,ans;
    scanf("%d",&tcase);
    while(tcase--){
        scanf("%d",&n);
        for(ans=0,i=1;i<=n;i++){
            scanf("%d",&pri);
            if(i%3==2||(i%6==0))
            ans^=pri;
        }
        if(ans)printf("Case %d: Alice\n",tt++);
        else printf("Case %d: Bob\n",tt++);
    }
    return 0;
}