应该算是模拟一类吧,感觉和贪吃蛇差不多,不过这条虫长度是不变的。。。。。
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define STOP system("pause")
int a[52][52];
int xx[20],yy[20],head,rear;
void init()
{
int i,j;
head=19;
rear=0;
memset(a,0,sizeof(a));
for(i=25,j=11;j<=30;j++)//初始化,墙壁为2,蛇身为1,0为可走位置
a[i][j]=1;
for(i=0,j=0;j<=51;j++)
a[i][j]=2;
for(i=51,j=0;j<=51;j++) //注意,蛇走到边缘时不算出界,所以数组初始化要扩大一圈
a[i][j]=2;
for(j=0,i=0;i<=51;i++)
a[i][j]=2;
for(j=51,i=0;i<=51;i++)
a[i][j]=2;
for(i=0;i<20;i++)
{
xx[i]=25; //xx和yy数组存放的是蛇身上每个节的坐标
yy[i]=i+11;
}
}
void out(int p,int i)
{
if(p==0)
printf("The worm successfully made all %d moves.\n",i);
if(p==1)
printf("The worm ran into itself on move %d.\n",i+1);
if(p==2)
printf("The worm ran off the board on move %d.\n",i+1);
}
int main()
{
int step,i,t1x,t2x,t1y,t2y,q;
char run[120];
while(scanf("%d",&step)&&step)
{
init();
q=0;
getchar();
gets(run);
for(i=0;i<step&&q==0;i++)
{
switch(run[i])
{
case 'N':{
t1x=xx[head],t1y=yy[head];
t2x=xx[rear],t2y=yy[rear];
t1x--;
a[t2x][t2y]=0; //要注意 在判断之前先把蛇尾清零
if(a[t1x][t1y]==2)
q=2;
if(a[t1x][t1y]==1)
q=1;
if(a[t1x][t1y]==0)
{
a[t1x][t1y]=1;
xx[rear]=t1x;
yy[rear]=t1y;
head=(head+1)%20; //head和rear代表xx和yy数组的下标,用来跟踪蛇头和蛇尾的位置
rear=(rear+1)%20;
}
break;
}
case 'S':{
t1x=xx[head],t1y=yy[head];
t2x=xx[rear],t2y=yy[rear];
t1x++;
a[t2x][t2y]=0;
if(a[t1x][t1y]==2)
q=2;
if(a[t1x][t1y]==1)
q=1;
if(a[t1x][t1y]==0)
{
a[t1x][t1y]=1;
xx[rear]=t1x;
yy[rear]=t1y;
head=(head+1)%20;
rear=(rear+1)%20;
}
break;
}
case 'E':{
t1x=xx[head],t1y=yy[head];
t2x=xx[rear],t2y=yy[rear];
t1y++;
a[t2x][t2y]=0;
if(a[t1x][t1y]==2)
q=2;
if(a[t1x][t1y]==1)
q=1;
if(a[t1x][t1y]==0)
{
a[t1x][t1y]=1;
xx[rear]=t1x;
yy[rear]=t1y;
head=(head+1)%20;
rear=(rear+1)%20;
}
break;
}
case 'W':{
t1x=xx[head],t1y=yy[head];
t2x=xx[rear],t2y=yy[rear];
t1y--;
a[t2x][t2y]=0;
if(a[t1x][t1y]==2)
q=2;
if(a[t1x][t1y]==1)
q=1;
if(a[t1x][t1y]==0)
{
a[t1x][t1y]=1;
xx[rear]=t1x;
yy[rear]=t1y;
head=(head+1)%20;
rear=(rear+1)%20;
}
break;
}
}
if(q!=0)
break;
}
out(q,i);
}
return 0;
}