leecode 解题总结：292. Nim Game

#include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
using namespace std;
/*
问题:
You are playing the following Nim Game with your friend: There is a heap of stones on the table, each time one of you take turns to remove 1 to 3 stones. The one who removes the last stone will be the winner. You will take the first turn to remove the stones.

Both of you are very clever and have optimal strategies for the game. Write a function to determine whether you can win the game given the number of stones in the heap.

For example, if there are 4 stones in the heap, then you will never win the game: no matter 1, 2, or 3 stones you remove, the last stone will always be removed by your friend.

分析：这里就是拿石游戏。每次可以拿掉1或2或3块石头，谁最后拿光石头，
谁是胜利的。
所以一定要控制我拿完之后还有4块石头给对方
还剩4块给对方，对方必定失败。
4块可以从5,6,7转化而来
如果剩8块给对方，则无论对方怎么取都会进入5,6,7中，在
我的操作下回变成4，然后对方失败。
因此如果我操作后，石头的个数如果能变成4的倍数(包括4)，则对方失败
也就是说：如果(n - 1) % 4 == 0 或者 (n - 2) % 4 == 0 或者 (n - 3) % 4 == 0
换句话说：如果当前数为4的倍数，则我必定失败

输入:
4
12
1
输出:
false
false
true

关键：
1 因此如果我操作后，石头的个数如果能变成4的倍数(包括4)，则对方失败
也就是说：如果(n - 1) % 4 == 0 或者 (n - 2) % 4 == 0 或者 (n - 3) % 4 == 0

*/

class Solution {
public:
    bool canWinNim(int n) {
		if( 0 == (n % 4))
		{
			return false;
		}
		else
		{
			return true;
		}
    }
};

void print(vector<int>& result)
{
	if(result.empty())
	{
		cout << "no result" << endl;
		return;
	}
	int size = result.size();
	for(int i = 0 ; i < size ; i++)
	{
		cout << result.at(i) << " " ;
	}
	cout << endl;
}

void process()
{
	 vector<int> nums;
	 int value;
	 int num;
	 Solution solution;
	 vector<int> result;
	 while(cin >> num )
	 {
		 nums.clear();
		 for(int i = 0 ; i < num ; i++)
		 {
			 cin >> value;
			 nums.push_back(value);
		 }
	 }
}

int main(int argc , char* argv[])
{
	process();
	getchar();
	return 0;
}