HDU 3032 Nim or not Nim?(sg函数)

题目链接

暴力出来,竟然眼花了以为sg(i) = i啊....看表要认真啊!!!

#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
#define LL __int64
int dp[10001];
int sg(int x)
{
int flag[10001],temp,i;
if(dp[x] >= 0)
return dp[x];
memset(flag,0,sizeof(flag));
for(i = 1;i <= x;i ++)
{
temp = sg(x-i);
flag[temp] = 1;
}
for(i = 1;i < x;i ++)
{
temp = sg(i)^sg(x-i);
flag[temp] = 1;
}
for(i = 0;;i ++)
if(!flag[i])
return dp[x] = i;
}
int main()
{
int n,m,i,ans,t;
scanf("%d",&t);
while(t--)
{
scanf("%d",&n);
ans = 0;
for(i = 0;i < n;i ++)
{
scanf("%d",&m);
if(m%4 == 0)
m --;
else if((m+1)%4 == 0)
m ++;
ans ^= m;
}
if(ans)
printf("Alice\n");
else
printf("Bob\n");
}
return 0;
}

HDU 3032 Nim or not Nim?(sg函数),布布扣,bubuko.com

时间: 2024-12-29 06:52:02

HDU 3032 Nim or not Nim?(sg函数)的相关文章

HDU 5795 A Simple Nim 打表求SG函数的规律

A Simple Nim Problem Description Two players take turns picking candies from n heaps,the player who picks the last one will win the game.On each turn they can pick any number of candies which come from the same heap(picking no candy is not allowed).T

HDU 1524 - A Chess Game(sg函数 + dfs)

A Chess Game Problem Description Let's design a new chess game. There are N positions to hold M chesses in this game. Multiple chesses can be located in the same position. The positions are constituted as a topological graph, i.e. there are directed

hdu 3032 Nim or not Nim? sg函数

Nim or not Nim? Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1056    Accepted Submission(s): 523 Problem Description Nim is a two-player mathematic game of strategy in which players take turn

HDU 3032 Nim or not Nim? (sg函数求解)

Nim or not Nim? Problem Description Nim is a two-player mathematic game of strategy in which players take turns removing objects from distinct heaps. On each turn, a player must remove at least one object, and may remove any number of objects provide

HDU 3032 Nim or not Nim? (博弈之求SG函数)

题意:经典Nim博弈游戏变换,给你n堆石子pi,每堆有pi个石子, Alice和Bob轮流取石子,每次可以从任意一堆中拿走任意个石子,也可以将某一堆石子分成两个小堆 (每堆石子个数必须不能为0),先拿完者获胜 思路:求SG函数后找规律: SG函数定义及求法:点击打开链接 #include<cstdio> #include<stdlib.h> #include<string.h> #include<string> #include<map> #in

HDU 3032 Nim or not Nim?(sg函数博弈)

题目地址:HDU 3032 这题是很好用来练习sg函数打表的一题. 下面是sg函数值打表代码: #include <iostream> #include <cstdio> #include <string> #include <cstring> #include <stdlib.h> #include <math.h> #include <ctype.h> #include <queue> #include &

HDU 3032 Nim or not Nim?(博弈 SG打表找规律)

传送门 Nim or not Nim? Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1457    Accepted Submission(s): 720 Problem Description Nim is a two-player mathematic game of strategy in which players take

hdu 5795 A Simple Nim 博弈sg函数

A Simple Nim Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Problem Description Two players take turns picking candies from n heaps,the player who picks the last one will win the game.On each turn they can pick an

HDU 3032-Nim or not Nim?(sg函数打表)

Nim or not Nim? Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1099    Accepted Submission(s): 547 Problem Description Nim is a two-player mathematic game of strategy in which players take tur