C语言 贪吃蛇 自动行走.doc

#include#include#include#include#include /定位函数 void GotoXY(short y,short x)HANDLE app=GetStdHandle(STD_OUTPUT_HANDLE);COORD t;t.Y=y;t.X=x*2;SetConsoleCursorPosition(app,t);#define CHANG 30#define KUAN 30#define LONG 100 /蛇的最大长度int Y=(CHANG+2)/2;int X=(KUAN+8)/2; /头的初始坐标int Y1=(CHANG+2)/2-1;int X1=(KUAN+8)/2-4; /头在数组中的初始位置int main() int i,j,k=0,n=0; int judge=1; /judge-判断是否可执行del,0可,1不可 int score=0; /score-分数 int randjudge=0; /食物置放条件的判断 int rulejudge=0; char c=0,c1; int youxiCHANGKUAN=0; /外围边框初始化 int del2=Y,X; /定位到删除的位置 char snlongLONG=0; /snack long简写,蛇的长度，记录消除坐标 clock_t time; int timedif; int speed=500; int speedjudge; printf(tttt 贪吃蛇n); / 外围框架 for(i=0;iCHANG;i+) printf(t); for(j=0;j=LONG) k=0; /if 消除区 if(judge=0) if(n=LONG) n=0; switch(snlongn) case 5:youxidel0-1del1-4=0;GotoXY(del0-,del1+1);printf(b );break; case 2:youxidel0-1del1-4=0;GotoXY(del0+,del1+1);printf(b );break; case 1:youxidel0-1del1-4=0;GotoXY(del0,del1-);printf( );break; case 3:youxidel0-1del1-4=0;GotoXY(del0,+del1);printf(b );break; n+; /重置消除入口的条件 judge=1; /显示位置和分数 GotoXY(0,0); printf(位置:n%2d %2dn,Y1,X1); printf(分数:n%dn,score); /超出长度 if(score=LONG-1) break; /方向输入 time=clock(); timedif=1; while(timedif) if(kbhit() c=getch(); if(clock()-time=speed) timedif=0; /变速区 if(c!=4&c!=7) c1=c; switch(c) case 7:speed-=speed100?100:0;c=c1;break; case 4:speed+=speed1000?100:0;c=c1;break; system(cls); if(rulejudge=1) printf(你输了，分数是