POJ 2484 A Funny Game(找规律)

题目链接

#include<iostream>
#include<cstdio>
using namespace std;

int main()
{
    int n;
    while(scanf("%d",&n)&&n)
    {//alice先把环破坏,变成链,然后bob只要在链中间取1或2个
     //连续的coins,让链变成左右对称的两条,bob就必胜
        if(n==1||n==2)
            printf("Alice
");
        else printf("Bob
");
    }
    return 0;
}
原文地址:https://www.cnblogs.com/atmacmer/p/5244033.html