HDU 3032 Nim or not Nim (sg函数)

时间：2022-05-26 11:06:59

加强版的NIM游戏，多了一个操作，可以将一堆石子分成两堆非空的。

数据范围太大，打出sg表后找规律。

# include <cstdio>

# include <cstring>

# include <cstdlib>

# include <iostream>

# include <vector>

# include <queue>

# include <stack>

# include <map>

# include <set>

# include <cmath>

# include <algorithm>

using namespace std;

# define lowbit(x) ((x)&(-x))

# define pi acos(-1.0)

# define eps 1e-

# define MOD

# define INF

# define mem(a,b) memset(a,b,sizeof(a))

# define FOR(i,a,n) for(int i=a; i<=n; ++i)

# define FO(i,a,n) for(int i=a; i<n; ++i)

# define bug puts("H");

# define lch p<<,l,mid

# define rch p<<|,mid+,r

# define mp make_pair

# define pb push_back

# define fi first

# define se second

typedef pair<int,int> PII;

typedef vector<int> VI;

# pragma comment(linker, "/STACK:1024000000,1024000000")

typedef long long LL;

typedef unsigned long long ULL;

int _MAX(int a, int b){return a>b?a:b;}

int _MIN(int a, int b){return a>b?b:a;}

int Scan() {

    int res=, flag=;

    char ch;

    if((ch=getchar())=='-') flag=;

    else if(ch>=''&&ch<='') res=ch-'';

    while((ch=getchar())>=''&&ch<='')  res=res*+(ch-'');

    return flag?-res:res;

}

void Out(int a) {

    if(a<) {putchar('-'); a=-a;}

    if(a>=) Out(a/);

    putchar(a%+'');

}

const int N=;

int find(int x)

{

    if (x%==) return x-;

    if (x%==) return x+;

    return x;

}

int main ()

{

    int T, n, temp;

    scanf("%d",&T);

    while (T--) {

        scanf("%d",&n);

        int ans=;

        while (n--) scanf("%d",&temp), ans^=find(temp);

        puts(ans?"Alice":"Bob");

    }

    return ;

}

相关文章