#include <stdio.h>??
#include <conio.h>??
#include <stdlib.h>??
#include <time.h>??
?
const int maxn = 100;?
const int n = 20;?
?
struct node?
{?
??? int x, y;?
};?
?
int map[maxn][maxn]; // 0表示空格，1表示蛇身，2表示食物，3表示撞死的位置, 4表示蛇頭.??
node food;?
node squence[maxn]; // 蛇的身子的坐標(biāo).??
int len; // 蛇的長(zhǎng)度.??
bool eat; // 判斷當(dāng)前事物是否被吃了．??
bool gameover; // 游戲是否失敗．??
int direction; // 判斷當(dāng)前蛇頭是朝哪個(gè)方向.??
?
void Output(void);?
void Move(int direction);?
void Move_up(void);?
void Move_down(void);?
void Move_left(void);?
void Move_right(void);?
?
int main()?
{?
??? int i, j;?
??? double start;?
??? int gamespeed; // 游戲速度自己調(diào)整.??
??? int timeover;?
??? int game_times = 1; // 游戲的次數(shù).??
??? char c = 'x';?
??? printf("請(qǐng)輸入游戲的級(jí)別(1到500，1最難，500最簡(jiǎn)單):\n");?
??? scanf("%d", &gamespeed);?
??? gamespeed = gamespeed;?
??? // 對(duì)圖的初始化.??
??? for (i = 0; i <= n + 1; i++)?
??? {?
??????? for (j = 0; j <= n + 1; j++)?
??????? {?
??????????? map[i][j] = 0;?
??????? }?
??? }?
??? // 對(duì)蛇的初始化.??
??? for (i = 1; i <= n; i++)?
??? {?
??????? squence[i].x = 0;?
??????? squence[i].y = 0;?
??? }?
??? len = 1; // 蛇的長(zhǎng)度為1.??
??? squence[len].x = 1;?
??? squence[len].y = 1; // 初始位置在點(diǎn)(1, 1).??
??? map[1][1] = 4;?
??? direction = 4; // 默認(rèn)開始時(shí)蛇向右走.??
??? srand(time(0));?
??? while (game_times <= 20)?
??? {?
??????? eat = 0; // 食物還沒被吃.??
??????? while (true)?
??????? { // 隨機(jī)生出食物的坐標(biāo)，注意不能與蛇身重合，否則就重新隨機(jī)產(chǎn)生.??
??????????? food.x = rand() % 20 + 1;?
??????????? food.y = rand() % 20 + 1;?
??????????? if (map[food.x][food.y] == 0)?
??????????? {?
??????????????? break;?
??????????? }?
??????? }?
??????? map[food.x][food.y] = 2; // 食物位置.??
??????? system("cls");?
??????? Output();?
??????? // 以下這段半秒鐘不按鍵還取原方向繼續(xù)前行.??
??????? while (!eat)?
??????? {?
??????????? start = clock();?
??????????? timeover=1;?
??????????? while(!kbhit())?
??????????? { // 說明沒有按鍵.??
??????????????? if (clock() - start <= gamespeed)?
??????????????? { // 如果時(shí)間超過游戲時(shí)間.??
??????????????????? timeover = 1;?
??????????????? }?
??????????????? else?
??????????????? {?
??????????????????? timeover = 0;?
??????????????????? break;?
??????????????? }?
??????????? }?
??????????? if (timeover)?
??????????? { // 說明有按鍵.??
??????????????? // 按一次鍵，可以連取兩個(gè)??
??????????????? c = getch();?
??????????????? c = getch();?
??????????????? // 以下幾行告訴怎樣判斷用戶按的哪個(gè)方向鍵??
??????????????? if(c==72) direction = 1; // printf("向上");??
??????????????? if(c==80) direction = 2; // printf("向下");??
??????????????? if(c==75) direction = 3; // printf("向左");??
??????????????? if(c==77) direction = 4; // printf("向右");??
??????????? }?
??????????? Move(direction);?
??????????? system("cls");?
??????????? if (gameover)?
??????????? {?
??????????????? Output();?
??????????????? printf("Game Over!!!\n");?
??????????????? return 0;?
??????????? }?
??????????? Output();?
??????? }?
??????? game_times++; // 又成功吃到一次食物.??
??? }?
??? printf("You win!!!\n");?
??? return 0;?
}?
?
void Move(int direction)?
{?
??? switch (direction)?
??? {?
??? case 1 : Move_up(); break;?
??? case 2 : Move_down(); break;?
??? case 3 : Move_left(); break;?
??? default : Move_right();?
??? }?
}?
?
void Output(void)?
{?
??? int i, j;?
??? for (j = 0; j <= n + 1; j++)?
??? {?
??????? printf("#");?
??? }?
??? printf("\n");?
??? for (i = 1; i <= n; i++)?
??? {?
??????? for (j = 0; j <= n + 1; j++)?
??????? {?
??????????? if (j == 0 || j == n + 1)?
??????????? {?
??????????????? if (map[i][j] == 3)?
??????????????? {?
??????????????????? printf("!");?
??????????????? }?
??????????????? else?
??????????????? {?
??????????????????? printf("#");?
??????????????? }?
??????????? }?
??????????? else?
??????????? {?
??????????????? if (map[i][j] == 1)?
??????????????? {?
??????????????????? printf("*");?
??????????????? }?
??????????????? else if (map[i][j] == 2)?
??????????????? {?
??????????????????? printf("@");?
??????????????? }?
??????????????? else if (map[i][j] == 3)?
??????????????? {?
??????????????????? printf("!");?
??????????????? }?
??????????????? else if (map[i][j] == 4)?
??????????????? {?
??????????????????? switch (direction)?
??????????????????? {?
??????????????????? case 1 : printf("%c", 30); break;?
??????????????????? case 2 : printf("%c", 31); break;?
??????????????????? case 3 : printf("%c", 17); break;?
??????????????????? default : printf("%c", 16);?
??????????????????? }?
??????????????? }?
??????????????? else?
??????????????? {?
??????????????????? printf(" ");?
??????????????? }?
??????????? }?
??????? }?
??????? printf("\n");?
??? }?
??? for (j = 0; j <= n + 1; j++)?
??? {?
??????? printf("#");?
??? }?
??? printf("\n");?
}?
?
void Move_up(void)?
{?
??? int i;?
??? int x, y;?
??? if (len > 1 && squence[len].y == squence[len - 1].y && squence[len].x == squence[len - 1].x + 1)?
??? { // 不能移動(dòng)，則按原來(lái)的移動(dòng).??
??????? direction = 2; // 按原來(lái)的向下移動(dòng).??
??????? Move(direction);?
??????? return ;?
??? }?
??? // 開始移動(dòng)．??
??? x = squence[len].x - 1;?
??? y = squence[len].y;?
??? if (x == 0 || map[x][y] == 1)?
??? { // 撞到邊界或者自己撞到自己.??
??????? map[x][y] = 3;?
??????? gameover = 1;?
??? }?
??? if (map[x][y] == 2)?
??? { // 說明已經(jīng)吃到事物．??
??????? map[squence[len].x][squence[len].y] = 1;?
??????? len++;?
??????? squence[len].x = x;?
??????? squence[len].y = y;?
??????? map[x][y] = 4;?
??????? eat = 1;?
??? }?
??? else?
??? {?
??????? map[squence[1].x][squence[1].y] = 0;?
??????? for (i = 1; i <= len - 1; i++)?
??????? {?
??????????? squence[i].x = squence[i + 1].x;?
??????????? squence[i].y = squence[i + 1].y;?
??????????? map[squence[i + 1].x][squence[i + 1].y] = 1;?
??????? }?
??????? squence[len].x = squence[len].x - 1;?
??????? if (gameover)?
??????? {?
??????????? map[squence[len].x][squence[len].y] = 3;?
??????? }?
??????? else?
??????? {?
??????????? map[squence[len].x][squence[len].y] = 4;?
??????? }?
??? }?
}?
?
void Move_down(void)?
{?
??? int i;?
??? int x, y;?
??? if (len > 1 && squence[len].y == squence[len - 1].y && squence[len].x == squence[len - 1].x - 1)?
??? { // 不能移動(dòng)，則按原來(lái)的移動(dòng).??
??????? direction = 1; // 按原來(lái)的向上移動(dòng).??
??????? Move(direction);?
??????? return ;?
??? }?
??? // 開始移動(dòng)．??
??? x = squence[len].x + 1;?
??? y = squence[len].y;?
??? if (x == n + 1 || map[x][y] == 1)?
??? { // 撞到邊界或者自己撞到自己.??
??????? map[x][y] = 3;?
??????? gameover = 1;?
??? }?
??? if (map[x][y] == 2)?
??? { // 說明已經(jīng)吃到事物．??
??????? map[squence[len].x][squence[len].y] = 1;?
??????? len++;?
??????? squence[len].x = x;?
??????? squence[len].y = y;?
??????? map[x][y] = 4;?
??????? eat = 1;?
??? }?
??? else?
??? {?
??????? map[squence[1].x][squence[1].y] = 0;?
??????? for (i = 1; i <= len - 1; i++)?
??????? {?
??????????? squence[i].x = squence[i + 1].x;?
??????????? squence[i].y = squence[i + 1].y;?
??????????? map[squence[i + 1].x][squence[i + 1].y] = 1;?
??????? }?
??????? squence[len].x = squence[len].x + 1;?
??????? if (gameover)?
??????? {?
??????????? map[squence[len].x][squence[len].y] = 3;?
??????? }?
??????? else?
??????? {?
??????????? map[squence[len].x][squence[len].y] = 4;?
??????? }?
??? }?
}?
?
void Move_left(void)?
{?
??? int i;?
??? int x, y;?
??? if (len > 1 && squence[len].x == squence[len - 1].x && squence[len].y == squence[len - 1].y + 1)?
??? { // 不能移動(dòng)，則按原來(lái)的移動(dòng).??
??????? direction = 4; // 按原來(lái)的向右移動(dòng).??
??????? Move(direction);?
??????? return ;?
??? }?
??? // 開始移動(dòng)．??
??? x = squence[len].x;?
??? y = squence[len].y - 1;?
??? if (y == 0 || map[x][y] == 1)?
??? { // 撞到邊界或者自己撞到自己.??
??????? map[x][y] = 3;?
??????? gameover = 1;?
??? }?
??? if (map[x][y] == 2)?
??? { // 說明已經(jīng)吃到事物．??
??????? map[squence[len].x][squence[len].y] = 1;?
??????? len++;?
??????? squence[len].x = x;?
??????? squence[len].y = y;?
??????? map[x][y] = 4;?
??????? eat = 1;?
??? }?
??? else?
??? {?
??????? map[squence[1].x][squence[1].y] = 0;?
??????? for (i = 1; i <= len - 1; i++)?
??????? {?
??????????? squence[i].x = squence[i + 1].x;?
??????????? squence[i].y = squence[i + 1].y;?
??????????? map[squence[i + 1].x][squence[i + 1].y] = 1;?
??????? }?
??????? squence[len].y = squence[len].y - 1;?
??????? if (gameover)?
??????? {?
??????????? map[squence[len].x][squence[len].y] = 3;?
??????? }?
??????? else?
??????? {?
??????????? map[squence[len].x][squence[len].y] = 4;?
??????? }?
??? }?
}?
?
void Move_right(void)?
{?
??? int i;?
??? int x, y;?
??? if (len > 1 && squence[len].x == squence[len - 1].x && squence[len].y == squence[len - 1].y - 1)?
??? { // 不能移動(dòng)，則按原來(lái)的移動(dòng).??
??????? direction = 3; // 按原來(lái)的向左移動(dòng).??
??????? Move(direction);?
??????? return ;?
??? }?
??? // 開始移動(dòng)．??
??? x = squence[len].x;?
??? y = squence[len].y + 1;?
??? if (y == n + 1 || map[x][y] == 1)?
??? { // 撞到邊界或者自己撞到自己.??
??????? map[x][y] = 3;?
??????? gameover = 1;?
??? }?
??? if (map[x][y] == 2)?
??? { // 說明已經(jīng)吃到事物．??
??????? map[squence[len].x][squence[len].y] = 1;?
??????? len++;?
??????? squence[len].x = x;?
??????? squence[len].y = y;?
??????? map[x][y] = 4;?
??????? eat = 1;?
??? }?
??? else?
??? {?
??????? map[squence[1].x][squence[1].y] = 0;?
??????? for (i = 1; i <= len - 1; i++)?
??????? {?
??????????? squence[i].x = squence[i + 1].x;?
??????????? squence[i].y = squence[i + 1].y;?
??????????? map[squence[i + 1].x][squence[i + 1].y] = 1;?
??????? }?
??????? squence[len].y = squence[len].y + 1;?
??????? if (gameover)?
??????? {?
??????????? map[squence[len].x][squence[len].y] = 3;?
??????? }?
??????? else?
??????? {?
??????????? map[squence[len].x][squence[len].y] = 4;?
??????? }?
??? }?
}?

轉(zhuǎn)載于:https://www.cnblogs.com/thefirstfeeling/p/4410987.html

與50位技術(shù)專家面對(duì)面20年技術(shù)見證，附贈(zèng)技術(shù)全景圖

總結(jié)

以上是生活随笔為你收集整理的贪吃蛇游戏（附源码）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。