nim

Grade: 10/Discount: 0.8

Time Limit:1000MS Memory Limit:65536K

Description

Nim is a 2-player game featuring several piles of stones. Players alternate turns, and on his/her turn, a player’s move consists of removing one or more stones from any single pile. Play ends when all the stones have been removed, at which point the last player to have moved is declared the winner. Given a position in Nim, your task is to determine how many winning moves there are in that position.
A position in Nim is called “losing” if the first player to move from that position would lose if both sides played perfectly. A “winning move,” then, is a move that leaves the game in a losing position. There is a famous theorem that classifies all losing positions. Suppose a Nim position contains n piles having k1, k2, …, kn stones respectively; in such a position, there are k1 + k2 + … + kn possible moves. We write each ki in binary (base 2). Then, the Nim position is losing if and only if, among all the ki’s, there are an even number of 1’s in each digit position. In other words, the Nim position is losing if and only if the xor of the ki’s is 0.
Consider the position with three piles given by k1 = 7, k2 = 11, and k3 = 13. In binary, these values are as follows:
11110111101
There are an odd number of 1’s among the rightmost digits, so this position is not losing. However, suppose k3 were changed to be 12. Then, there would be exactly two 1’s in each digit position, and thus, the Nim position would become losing. Since a winning move is any move that leaves the game in a losing position, it follows that removing one stone from the third pile is a winning move when k1 = 7, k2 = 11, and k3 = 13. In fact, there are exactly three winning moves from this position: namely removing one stone from any of the three piles.

Input

The input test file will contain multiple test cases, each of which begins with a line indicating the number of piles, 1 ≤ n ≤ 1000. On the next line, there are n positive integers, 1 ≤ ki ≤ 1, 000, 000, 000, indicating the number of stones in each pile. The end-of-file is marked by a test case with n = 0 and should not be processed.

Output

For each test case, write a single line with an integer indicating the number of winning moves from the given Nim position.

Sample Input

37 11 13 2 1000000000 1000000000 0

Sample Output

3 0

Source Stanford Local 2005

 

#include <iostream>
#include <vector>

using namespace std;

int main (){
  int n;
  while (cin >> n){
    if (n == 0) break;
    int x = 0;
    vector<int> v(n);
    for (int i = 0; i < n; i++){
      cin >> v[i];
      x = x ^ v[i];
    }
    
    int ct = 0;
    for (int i = 0; i < n; i++){
      if ((v[i] ^ x) < v[i])
	ct++;
    }
    cout << ct << endl;
  }
}

 

nim(단순)

Grade: 10/Discount: 0.8
Time limitation: 1 seconds Memory limitation: 64M
The game of nim is played as follows. Some number of sticks are placed in a pile.
Two players alternate in removing either one or two from the pile. The player who remove the last stick is the loser. The opponent remove sticks at the first, then it's your turn. Write a program to determine how many sticks should be removed when there's n sticks left in the pile.
Input
The first line is a integer n, which present how many data below. There's n integers m1, m2, ...mn on the following n lines, each line contains one of them, these number present how many sticks are there in the pile.
Output
For each mi, output how many sticks should be remove in this turn. If you will always lose no matter how many sticks are removed, output 0.
Input Sample 3 4 5 6
Output Sample 0 1 2
Source
BIT AsiaInfo CUP Programming Contest 2007

#include <stdio.h>
main()
{
	int number,te;
	int a;
	scanf("%d",&number);
	for(te=1;te<=number;te++)
	{
		scanf("%d",&a);
		printf("%d
",(a-4)%3);
    }
}