POJ 1704 Georgia and Bob

<span style="font-family: Arial, Helvetica, sans-serif;"><span style="font-size:18px;"><strong>题意：有个坐标轴,有n个棋子,只能往左移动,不能跨过或覆盖棋子,最后没的移动的输。</strong></span></span>

<span style="font-family: Arial, Helvetica, sans-serif;"><span style="font-size:18px;"><strong>题解：将每对棋子看成Nim中的一堆石子，石子堆中的个数等于两棋子间的距离</strong></span></span>

#include<cstdio>
#include<cstring>
#include<cmath>
#include<ctime>
#include<algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <map>
#include <set>
#define INF 0x3f3f3f3f
#define maxn 500100
#define mem(a) memset(a,0,sizeof(a))
using namespace std;
typedef long long ll;

int main()
{
    int n;
    while(scanf("%d",&n) && n)
    {
        if(n < 3)
            printf("Alice\n");
        else
            printf("Bob\n");
    }
	return 0;
}