zoj3513 Human or Pig----P/N分析 博弈

Input

Output

SampleInput

12
23

SampleOutput

Case#1:
PH
Case#2:
PHH
HPP

[code]#include<fstream>
#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<limits.h>
#include<algorithm>
#include<math.h>
#include<numeric>
#include<functional>
#include<ctype.h>
usingnamespacestd;

constintkMAX=1<<16;
chargrid_[kMAX];
intn,m;

intgrid(intx,inty)
{
	returnx*m+y;
}

charGet(intx,inty)
{
	intret=grid(x,y);
	charc='P';
for(intk=1;x>k*y;++k)
{
intyy=grid(x-k*y,y);
if(grid_[yy]=='P')
{
				c='H';
				break;
}
}
for(intk=1;y>k*x;++k)
{
intyy=grid(x,y-k*x);
if(grid_[yy]=='P')
{
				c='H';
				break;
}
}
	
	returngrid_[ret]=c;
}

intmain()
{

intcases=1;
while(~scanf("%d%d",&n,&m))
{
printf("Case#%d:\n",cases++);
memset(grid_,'?',sizeof(grid_));

		for(inti=1;i<=n;++i)
		{
			for(intj=1;j<=m;++j)
putchar(Get(i,j));
			puts("");
		}
}

return0;
}

[code]#include<iostream>
#include<cstdlib>
#include<stdio.h>
#include<memory.h>
usingnamespacestd;
intn,m;
intmat[100000];
intget(intx,inty)
{
returnx*m+y;
}
voidsolve(intx,inty)
{
intid=get(x,y);
//if(mat[id]!=-1)return;
boolflag=true;
for(inti=1;;i++)
{
intpx=x-i*y;
if(px<=0)break;
intiid=get(px,y);
if(mat[iid]==0)
{
flag=false;
break;
}
}
if(flag)
{
for(inti=1;;i++)
{
intpy=y-i*x;
if(py<=0)break;//悲催，写成<0wrong了
intiid=get(x,py);
if(mat[iid]==0)
{
flag=false;
break;
}
}
}

if(flag)
mat[id]=0;
else
mat[id]=1;
return;
}
intmain()
{
intcount=1;
while(scanf("%d%d",&n,&m)!=EOF)
{
memset(mat,-1,sizeof(mat));
printf("Case#%d:\n",count++);
for(inti=1;i<=n;i++)
for(intj=1;j<=m;j++)
solve(i,j);
intid=1*m+1;
intc=0;
for(inti=id;i<=n*m+m;i++)
{
if(mat[i]==0)cout<<'P';
elsecout<<'H';
c++;
if(c==m)
{
c=0;
cout<<endl;
}
}
}
}