A Funny Game

http://poj.org/problem?id=2484

題意：給你n個相同的硬幣圍成一個圈，每次可以去一個硬幣旁的一個或兩個;問你誰最在最後都取完;

題解：博弈的精髓，當n<=2時，alice可以一次取完，但是，大於2時，無論怎麼取，Bob保持自己能在最後取到

// File Name: poj2484.cpp// Author: bo_jwolf// Created Time: 2013年10月02日 星期三 21:14:41#include<vector>#include<list>#include<map>#include<set>#include<deque>#include<stack>#include<bitset>#include<algorithm>#include<functional>#include<numeric>#include<utility>#include<sstream>#include<iostream>#include<iomanip>#include<cstdio>#include<cmath>#include<cstdlib>#include<cstring>#include<ctime>using namespace std;int main(){int n;while( scanf( "%d", &n ) != EOF ){if( !n ) break ;if( n <= 2 ) printf( "Alice\n" );else printf( "Bob\n" );}return 0;}