70行简单贪吃蛇

实现方法和大伙不太相同。没有用nm矩阵。下面发源码，自己看吧。

#include <iostream>
#include <cstdlib>
#include <conio.h>
#include <cstdio>
#include <ctime>
using namespace std;
const int a=30,b=15;
struct p {
int x,y;
}snake[a*b+5],food;
int n=3,way=6;
bool exi=false;
void print() {
gotoxy(1,1);
for (int i=1; i<=b; i++){
for (int i=1; i<=a; i++)
cout << '.';
cout << endl;
}
gotoxy(food.y,food.x);
putchar('$');
for (int i=1; i<=n; i++){
gotoxy(snake[i].y,snake[i].x);
putchar('#');
}
gotoxy(1,a+1);
fflush(stdout);
system("sleep 1");
}
void move(){
if (snake[1].x==food.x&&snake[1].y==food.y){
food.x=rand()%b;
food.y=rand()%a;
snake[++n]=snake[n-1];
}
for (int i=n; i>1; i--)
snake[i]=snake[i-1];
switch (way) {
case 2: snake[1].x--; break;
case 6: snake[1].y++; break;
case 8: snake[1].x++; break;
case 4: snake[1].y--; break;
}
}

int main(){
food.x=rand()%b;
food.y=rand()%a;
snake[1].x=snake[1].y=snake[2].x=snake[3].x=3;
snake[2].y=4,snake[3].y=5;
srand(time(NULL));
print();
while (!exi) {
if (snake[1].x>b||snake[1].y>a||snake[1].x<1||snake[1].y<1)
break;
gotoxy(1,a+1);
if (kbhit()){
way=getch()-48;
fflush(stdin);
}
move();
system("clear");
print();
}
system("clear");
cout << "You Die";
return 0;
}

2846上下左右。
嫌慢的调sleep。
ps 这只虫虫有特异功能，可以自己吃自己

能否骗个精

欢迎大家找问题。欢迎大神修改。欢迎小白使用。

虫虫吃了自己的肉，发现很难吃。于是他不再吃自己的肉了。代码楼下

#include <iostream>
#include <cstdlib>
#include <conio.h>
#include <cstdio>
#include <ctime>
using namespace std;
const int a=30,b=15;
struct p {
int x,y;
}snake[a*b+5],food;
int n=3,way=6;
bool exi=false;
void print() {
gotoxy(1,1);
for (int i=1; i<=b; i++){
for (int i=1; i<=a; i++)
cout << '.';
cout << endl;
}
gotoxy(food.y,food.x);
putchar('$');
for (int i=1; i<=n; i++){
gotoxy(snake[i].y,snake[i].x);
putchar('#');
}
gotoxy(1,a+1);
fflush(stdout);
system("sleep 0.5");
}
void move(){
if (snake[1].x==food.x&&snake[1].y==food.y){
food.x=rand()%(b-1);
food.y=rand()%(a-1);
if (food.x<=1) ++food.x;
if (food.x<=1) ++food.x;
//snake[++n]=snake[n-1];
snake[++n].x=snake[n].y=-2;
}
for (int i=n; i>1; i--)
snake[i]=snake[i-1];

switch (way) {
case 2: snake[1].x--; break;
case 6: snake[1].y++; break;
case 8: snake[1].x++; break;
case 4: snake[1].y--; break;
default: break;
}
for (int i=2; i<=n; i++)
if (snake[1].x==snake[i].x&&snake[1].y==snake[i].y)
exi=true;
}
int main(){
food.x=rand()%b;
food.y=rand()%a;
snake[3].x=snake[3].y=snake[2].x=snake[1].x=2;
snake[2].y=3,snake[1].y=4;
srand(time(NULL));
print();
while (!exi) {
if (snake[1].x>b||snake[1].y>a||snake[1].x<1||snake[1].y<1)
break;
gotoxy(1,a+1);
if (kbhit()){
way=getch()-48;
fflush(stdin);
}
move();
system("clear");
print();
}
system("clear");
cout << "You Die";
return 0;
}