hdu3980 Paint Chain------sg 环--链 一排石子分成若干堆

Paint ChainTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 696    Accepted Submission(s): 252


Problem DescriptionInputOutputSample InputSample OutputAuthorSource#include<iostream>#include<cstdlib>#include<stdio.h>#include<memory.h>using namespace std;int sg[1010];int m;int find(int x){ if(sg[x]>=0) return sg[x]; if(x-m<0) return sg[x]=0; bool g[1010]={0}; for(int j=x-m;j>=0;j--) g[find(j)^find(x-m-j)]=1; for(int i=0;;i++) if(g[i]==0) return sg[x]=i;}int main(){ int t,n; int count=1; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); memset(sg,-1,sizeof(sg)); printf("Case #%d: ",count++); int ans=0; if(n>=m) ans=find(n-m)?0:1; if(ans) puts("aekdycoin"); else puts("abcdxyzk"); /* int ans=0; if(n>=m) ans=find(n-m); if(!ans) puts("aekdycoin"); else puts("abcdxyzk"); 写成这样竟然不对，这让我很费解~ */ }}/*Sample Input23 14 2Sample OutputCase #1: aekdycoinCase #2: abcdxyzk*/