[UVA12293] Box Game && 博弈

强行打表找规律 其他没什么了= = 

#include<cstdio>
#include<algorithm>
#include<cstring>
#include<iostream>
#define SF scanf
#define PF printf
using namespace std;
typedef long long LL;
const int MAXN = 50;
int SG[MAXN+10], ok[MAXN+10];
void SG_table()
{
	SG[1] = 0; SG[2] = 1;
	for(int i = 3; i <= MAXN; i++) {
		memset(ok, 0, sizeof(ok));
		for(int j = (i + 1) / 2; j < i; j++) ok[SG[j]] = true;
		for(int j = 0; j <= MAXN; j++)
			if(!ok[j])
			{
				SG[i] = j; break; 
			}
	}
	for(int i = 1; i <= MAXN; i++) PF("%2d :%d\n", i, SG[i]);
}
int main()
{
	int n;
	while(~SF("%d", &n) && n)
	{
		n++;
		if(n - (n & (-n)) == 0) PF("Bob\n");
		else PF("Alice\n");
	}
}