UVa11892 Box Game

来源：互联网发布：淘宝助理新建宝贝编辑：程序博客网时间：2024/06/05 10:37

1.题目描述：点击打开链接

2.解题思路：本题可以先写一个记忆化搜素观察一下，发现当n=2^k-1时候，是Bob胜利，否则都是Alice胜利。然后就可以敲代码了。。

3.代码：

#include<iostream>#include<algorithm>#include<cassert>#include<string>#include<sstream>#include<set>#include<bitset>#include<vector>#include<stack>#include<map>#include<queue>#include<deque>#include<cstdlib>#include<cstdio>#include<cstring>#include<cmath>#include<ctime>#include<cctype>#include<complex>#include<functional>#pragma comment(linker, "/STACK:1024000000,1024000000")using namespace std;#define rep(i,n) for(int i=0;i<(n);i++)#define me(s) memset(s,0,sizeof(s))#define pb push_back#define lid (id<<1)#define rid (id<<1|1)typedef long long ll;typedef unsigned long long ull;typedef pair<int,int> P;int main(){    int n;    while(~scanf("%d",&n)&&n)    {        int k=ceil(log((double)n+1)/log(2));        //cout<<k<<endl;        ll tmp=1ll<<k;        if(tmp==(ll)n+1)puts("Bob");        else puts("Alice");    }}

0 0