簡單游戲設計c語言

㈠ 用c語言設計人和電腦的猜拳游戲，越簡單越好，謝謝

#include<stdio.h>
#include<stdlib.h>
#include<time.h>
intisWin(int,int);//返回：0:平均。1:玩家勝。2:玩家敗
intmain()
{
charp,name[3][5]={"石頭","剪刀","布"};
intn;
srand(time(NULL));
while(1)
{
printf("請輸入你要出拳對應的數字：0、石頭。1、剪刀。2、布。 ");
scanf("%[0-2]",&p);
getchar();
n=rand()%3;
printf("電腦：%s！ 玩家：%s！ ",name[n],name[(p-'0')]);
switch(isWin(n,p-'0'))
{
case0:printf("玩家敗！ ");break;
case1:printf("玩家勝！ ");break;
case2:printf("平局！ ");break;
default:printf("error ");
}
}
return0;
}

intisWin(intn1,intn2)//n1:電腦出拳。n2:玩家出拳。返回：2:平均。1:玩家勝。2:玩家敗
{
if(n1==n2)
return2;
if(n2-n1==-1||n2-n1==2)
return1;
if(n2-n1==1||n2-n1==-2)
return0;
return-1;
}

㈡ 如何使用C語言編寫簡單小游戲

C語言是計算機專業都要學習的一門基礎學科。一般來說,是比較枯燥的.那麼,我們能不能通過編一些小游戲來提高它的趣味性呢?這樣學習程序設計,就不會是一件艱苦 ,枯燥的事,它變得象電腦游戲一樣充滿好奇,富有樂趣。

例如2048這款游戲：

方法/步驟：

#include<stdio.h>

#include<stdlib.h>

#include<time.h>

#include<conio.h>

#include<windows.h>

#define SIZE 4

static int score=0;

void putn(int n[][SIZE]);

void getn(int n[][SIZE]);

int isempty(int n[][SIZE]);

int isfull(int n[][SIZE]);

void math(int n[][SIZE],char c);

void tow(int n[][SIZE]);

void toa(int n[][SIZE]);

void tos(int n[][SIZE]);

void tod(int n[][SIZE]);

• //主函數

  int main()

  {

  int i,j;

  int n[SIZE][SIZE];

  char c=' ';

  for(i=0;i<SIZE;i++)

  {

  for(j=0;j<SIZE;j++)

  {

  n[i][j]=0;

  }

  }

  printf( "*********************** "

  " 2048(%dX%d) "

  " control:W/A/S/D "

  "press any key to begin "

  "*********************** ",SIZE,SIZE);

  getch();

  system("cls");

  //n[0][1]=2048;

  //n[0][3]=2048;

  while(1)

  {

  if(isempty(n))

  getn(n);

  putn(n);

  if(!isempty(n)&&isfull(n))

  break;

  sleep(200);

  c=getch();

  while(c!='w'&&c!='a'&&c!='s'&&c!='d')

  c=getch();

  math(n,c);

  system("cls");

  }

  printf(" Game Over! ",score);

  return 0;

  }

• //函數

  void putn(int n[][SIZE])

  {

  int i,j;

  for(i=0;i<SIZE;i++)

  {

  for(j=0;j<SIZE;j++)

  printf("| ");

  printf("| ");

  for(j=0;j<SIZE;j++)

  {

  if(n[i][j]==0)

  printf("| ");

  else

  printf("|%4d ",n[i][j]);

  }

  printf("| ");

  for(j=0;j<SIZE;j++)

  printf("|_____");

  printf("| ");

  }

  printf("score: %d",score);

  }

  void getn(int n[][SIZE])

  {

  int a,b;

  a=rand()%SIZE;

  b=rand()%SIZE;

  while(n[a][b]!=0)

  {

  a=rand()%SIZE;

  b=rand()%SIZE;

  }

  n[a][b]=2;

  }

  int isempty(int n[][SIZE])

  {

  int i,j,count=0;

  for(i=0;i<SIZE;i++)

  for(j=0;j<SIZE;j++)

  if(n[i][j]==0)

  count++;

  return count;

  }

  int isfull(int n[][SIZE])

  {

  int i,j,count=0;

  for(i=0;i<SIZE;i++)

  {

  for(j=1;j<SIZE-1;j++)

  {

  if(n[i][j]==n[i][j+1]||n[i][j]==n[i][j-1])

  count++;

  }

  }

  for(j=0;j<SIZE;j++)

  {

  for(i=1;i<SIZE-1;i++)

  {

  if(n[i][j]==n[i+1][j]||n[i][j]==n[i-1][j])

  count++;

  }

  }

  return count>0?0:1;

  }

  void math(int n[][SIZE],char c)

  {

  switch(c)

  {

  case 'w':tow(n);break;

  case 'a':toa(n);break;

  case 's':tos(n);break;

  case 'd':tod(n);break;

  default :;

  }

  }

  void tow(int n[][SIZE])

  {

  int i,j,a;

  int m[SIZE];

  for(a=0;a<SIZE;a++)

  m[a]=0;

  for(j=0;j<SIZE;j++)

  {

  for(a=0;a<SIZE;a++)

  {

  for(i=0;i<SIZE-1;i++)

  {

  if(n[i][j]==0)

  {

  n[i][j]=n[i+1][j];

  n[i+1][j]=0;

  }

  }

  }

  }

  for(j=0;j<SIZE;j++)

  {

  for(a=0,i=0;i<SIZE;i++)

  {

  if(n[i][j]!=n[i+1][j]&&n[i][j]!=0||n[i][j]==2048)

  {

  m[a++]=n[i][j];

  n[i][j]=0;

  }

  else if(n[i][j]==n[i+1][j])

  {

  m[a++]=n[i][j]+n[i+1][j];

  score+=m[a-1];

  n[i][j]=0,n[i+1][j]=0;

  }

  }

  for(i=0;i<SIZE;i++)

  {

  n[i][j]=m[i];

  m[i]=0;

  }

  }

  }

  void toa(int n[][SIZE])

  {

  int i,j,a;

  int m[SIZE];

  for(a=0;a<SIZE;a++)

  m[a]=0;

  for(i=0;i<SIZE;i++)

  {

  for(a=0;a<SIZE;a++)

  {

  for(j=0;j<SIZE-1;j++)

  {

  if(n[i][j]==0)

  {

  n[i][j]=n[i][j+1];

  n[i][j+1]=0;

  }

  }

  }

  }

  for(i=0;i<SIZE;i++)

  {

  for(a=0,j=0;j<SIZE;j++)

  {

  if(n[i][j]!=n[i][j+1]&&n[i][j]!=0||n[i][j]==2048)

  {

  m[a++]=n[i][j];

  n[i][j]=0;

  }

  else if(n[i][j]==n[i][j+1])

  {

  m[a++]=n[i][j]+n[i][j+1];

  score+=m[a-1];

  n[i][j]=0,n[i][j+1]=0;

  }

  }

  for(j=0;j<SIZE;j++)

  {

  n[i][j]=m[j];

  m[j]=0;

  }

  }

  }

  void tos(int n[][SIZE])

  {

  int i,j,a;

  int m[SIZE];

  for(a=0;a<SIZE;a++)

  m[a]=0;

  for(j=SIZE-1;j>=0;j--)

  {

  for(a=SIZE-1;a>=0;a--)

  {

  for(i=SIZE-1;i>0;i--)

  {

  if(n[i][j]==0)

  {

  n[i][j]=n[i-1][j];

  n[i-1][j]=0;

  }

  }

  }

  }

  for(j=SIZE-1;j>=0;j--)

  {

  for(a=SIZE-1,i=SIZE-1;i>=0;i--)

  {

  if(n[i][j]!=n[i-1][j]&&n[i][j]!=0||n[i][j]==2048)

  {

  m[a--]=n[i][j];

  n[i][j]=0;

  }

  else if(n[i][j]==n[i-1][j])

  {

  m[a--]=n[i][j]+n[i-1][j];

  score+=m[a+1];

  n[i][j]=0,n[i-1][j]=0;

  }

  }

  for(i=SIZE-1;i>=0;i--)

  {

  n[i][j]=m[i];

  m[i]=0;

  }

  }

  }

  void tod(int n[][SIZE])

  {

  int i,j,a;

  int m[SIZE];

  for(a=0;a<SIZE;a++)

  m[a]=0;

  for(i=SIZE-1;i>=0;i--)

  {

  for(a=SIZE-1;a>=0;a--)

  {

  for(j=SIZE-1;j>0;j--)

  {

  if(n[i][j]==0)

  {

  n[i][j]=n[i][j-1];

  n[i][j-1]=0;

  }

  }

  }

  }

  for(i=SIZE-1;i>=0;i--)

  {

  for(a=SIZE-1,j=SIZE-1;j>=0;j--)

  {

  if(n[i][j]!=n[i][j-1]&&n[i][j]!=0||n[i][j]==2048)

  {

  m[a--]=n[i][j];

  n[i][j]=0;

  }

  else if(n[i][j]==n[i][j-1])

  {

  m[a--]=n[i][j]+n[i][j-1];

  score+=m[a+1];

  n[i][j]=0,n[i][j-1]=0;

  }

  }

  for(j=SIZE-1;j>=0;j--)

  {

  n[i][j]=m[j];

  m[j]=0;

  }

  }

  }

㈢ C語言設計一個簡單的猜數游戲：先由計算機「想」一個數請用戶猜，如果用戶猜對了，則計算機給出提示信息

//希望我的回答對你的學習有幫助
#include<stdio.h>
#include<stdlib.h>
#include<time.h>

intmain()
{
	intx,magic,a=0,c=1;
	charb;
	do
	{
		srand(unsigned(time(NULL)));	//為函數rand()設置隨機數種子
		magic=rand()%100+1;	//magic為1~100間的一個數
		printf("您每次游戲中，只有十次機會
");
		while(a<=10)
		{
			scanf("%d",&x);
			if(x>magic)
				printf("Wrong,比magic大
");
			elseif(x<magic)
				printf("Wrong,比magic小
");
			//elseif(x=magic)				//這里的邏輯運算應該使用「==」
			elseif(x==magic)				//你應該是寫錯了
			{
				printf("Right
");
				a=a+1;
				printf("你猜了%d次了
",a);
				a=0;							//猜對之後，應該對猜測的次數初始化
				break;							
			}
			a++;
			printf("你猜了%d次了
",a);
			if(a==10)
			{
				a=0;
				printf("Doyouwanttocontinue?(回答Y/N或者y/n)
");
				//scanf_s("%c",&b);	//這么使用，會將你在輸入字元之前的
							//空行（enter鍵）賦值給b，而不是你輸入的Y/N/y/n
				scanf("%c",&b);	//而這種寫法，%c前面的空格會使scanf忽略前面的enter鍵
							//等待第一個非enter鍵元素讀入
				if(b=='y'||b=='Y')
					c=1;
				elseif(b=='n'||b=='N')
					c=0;
				break;							//當猜測次數為10時，應當跳出
												//這里不會自動跳出，因為a被初始化為0
			}
		}
	}while(c==1);

	return0;
}

scanf 裡面沒有空格的情況，程序會自動執行 10 次

㈣ 如何用c語言製作簡單的游戲類似掃雷貪吃蛇

㈤ 用C語言設計小游戲的程序急！！！

用c++實現的"貪吃蛇"游戲源碼
// greedsnake.cpp
#include <bios.h>
#include <conio.h>
#include <dos.h>
#include <graphics.h>
#include <stdlib.h>
#include <time.h>
#include "conf.h"

typedef struct node
{
int x,y;
struct node *next;
}Node;

typedef struct
{
Node *head,*tail;
int length;
}Snake;
typedef struct
{
int left,top,right,bottom;
}Frame;

typedef enum //四個方向
{
up,down,left,right
}Direction;

typedef enum
{
false,true
}bool;//*/

void InitGraphMode(); //初始化圖形驅動
void CloseGraphMode();
void Foot(int,int);
void Head(int,int);
void CreateFrame(); //完成整個游戲框架的繪制
void CreateSnake(); //創建一條兩個節點的蛇,蛇的每一節是隊列中的一個節點
bool PlayGame(); //游戲的主體函數,
int Hit(int,int); //判斷是否越界,或者撞到自身,兩個參數分別是新的頭接點的x,y坐標
bool GameOver(); //繪制游戲結束時彈出的對話框
void Enqueue(Node); //入隊函數
Node Dequeue(); //出隊函數
void ClearKeyBuf(); //清除鍵盤緩沖,此函數可以消除不停的按無效鍵的影響

Snake snake;
Frame frame;
void main()
{
InitGraphMode();
do
{
CreateFrame();
}while(PlayGame());
CloseGraphMode();
}
void InitGraphMode()
{
int gdriver=DETECT,gmode;
initgraph(&gdriver,&gmode,"../bgi/");
cleardevice();
}
void CloseGraphMode()
{
cleardevice();
closegraph();
}
void CreateFrame()
{
setbkcolor(CYAN);
//下面的四行代碼用於計算主框架的左上角和右下角的坐標
frame.left=(getmaxx()+1-BlockWidth*RowOfFrame)/2;
frame.top=(getmaxy()+1-BlockHeight*ColumnOfFrame)/2;
frame.right=frame.left+BlockWidth*RowOfFrame;
frame.bottom=frame.top+BlockHeight*ColumnOfFrame;
Head(frame.left+100,frame.top-20);
setfillstyle(SOLID_FILL,LIGHTGRAY);
bar(frame.left,frame.top,frame.right,frame.bottom);
setlinestyle(SOLID_LINE,1,1);
setcolor(DARKGRAY);
line(frame.left,frame.top,frame.right,frame.top);
line(frame.left,frame.top,frame.left,frame.bottom);
setlinestyle(SOLID_LINE,1,1);
setcolor(WHITE);
line(frame.left,frame.bottom,frame.right,frame.bottom);
line(frame.right,frame.top,frame.right,frame.bottom);
setlinestyle(DOTTED_LINE,1,1);
setcolor(BLUE);
for(int row=1;row<RowOfFrame;row++)
line(frame.left+row*BlockWidth,frame.top,frame.left+row*BlockWidth,frame.bottom);
for(int column=1;column<ColumnOfFrame;column++)
line(frame.left,frame.top+column*BlockHeight,frame.right,frame.top+column*BlockHeight);
Foot(frame.left,frame.bottom+20);
}
void CreateSnake()
{
Node *node1=new Node;
Node *node2=new Node;
node1->x=frame.left+BlockWidth;
node1->y=frame.top;
node1->next=NULL;
snake.tail=node1;
node2->x=frame.left;
node2->y=frame.top;
node2->next=snake.tail;
snake.head=node2;
snake.length=2;
setfillstyle(SOLID_FILL,BLUE);
bar(snake.head->x+1,snake.head->y+1,snake.head->x+BlockWidth-1,snake.head->y+BlockHeight-1);
bar(snake.tail->x+1,snake.tail->y+1,snake.tail->x+BlockWidth-1,snake.tail->y+BlockHeight-1);
}

bool PlayGame()
{
int speed=300,key;
Direction CurrentDirection=right;
Node randomNode;
Node newNode,outNode;
bool neednode=true;
bool overlap=false;
int randx,randy;
CreateSnake();

while(true)
{
if(neednode==true)
{
randomize();
do
{
randx=frame.left+rand()%RowOfFrame*BlockWidth;
randy=frame.top+rand()%ColumnOfFrame*BlockHeight;
for(Node *p=snake.head;p!=NULL;p=p->next)//hit itself
if(randx==p->x&&randy==p->y)
{overlap=true;break;}
}
while(overlap==true);
randomNode.x=randx;
randomNode.y=randy;
randomNode.next=NULL;
setfillstyle(SOLID_FILL,RED);
bar(randomNode.x+1,randomNode.y+1,randomNode.x+BlockWidth-1,randomNode.y+BlockHeight-1);
neednode=false;
}

if((key=bioskey(1))!=0)
{
switch(key)
{
case ESC: return false;
case UP:
if(CurrentDirection!=down)
CurrentDirection=up;
ClearKeyBuf();
break;
case DOWN:
if(CurrentDirection!=up)
CurrentDirection=down;
ClearKeyBuf();
break;
case LEFT:
if(CurrentDirection!=right)
CurrentDirection=left;
ClearKeyBuf();
break;
case RIGHT:
if(CurrentDirection!=left)

CurrentDirection=right;
ClearKeyBuf();
break;
case PAGEUP:speed=speed-100;
if(speed<100)
speed=100;
ClearKeyBuf();
break;
case PAGEDOWN:speed=speed+100;
if(speed>500)
speed=500;
ClearKeyBuf();
break;
default :break;
}
}
int headx=snake.tail->x;
int heady=snake.tail->y;
switch(CurrentDirection)
{
case up: heady-=BlockHeight;break;
case down: heady+=BlockHeight;break;
case left: headx-=BlockWidth;break;
case right: headx+=BlockWidth;break;
}
if(Hit(headx,heady)) //whether the snake hit the wall or itself
return GameOver();
else
{ //eat
if(headx==randomNode.x&&heady==randomNode.y)
{
Enqueue(randomNode);
setfillstyle(SOLID_FILL,BLUE);
bar(randomNode.x+1,randomNode.y+1,randomNode.x-1+BlockWidth,randomNode.y-1+BlockHeight);
neednode=true;
}
else //no eat
{
newNode.x=headx;
newNode.y=heady;
newNode.next=NULL;
Enqueue(newNode);
outNode=Dequeue();
setfillstyle(SOLID_FILL,LIGHTGRAY);
bar(outNode.x+1,outNode.y+1,outNode.x+BlockWidth-1,outNode.y+BlockHeight-1);
setfillstyle(SOLID_FILL,BLUE);
bar(newNode.x+1,newNode.y+1,newNode.x-1+BlockWidth,newNode.y-1+BlockHeight);
}
}
delay(speed);
}
}
void ClearKeyBuf()
{
do
bioskey(0);
while(bioskey(1));
}

void Foot(int x,int y)
{
setcolor(BLUE);
outtextxy(x,y,"writer:[T]RealXL E-MAIL:[email protected]");
}
void Head(int x,int y)
{
setcolor(RED);
outtextxy(x,y,"GREEDY SNAKE");
}
void Enqueue(Node inNode)
{
Node *p=new Node;
p->x=inNode.x;
p->y=inNode.y;
p->next=inNode.next;
snake.tail->next=p;
snake.tail=p;
snake.length++;
}
Node Dequeue()
{
Node *p=snake.head;
Node outNode=*p;
snake.head=p->next;
snake.length--;
delete p;
return outNode;
}

int Hit(int x,int y)
{
if(x<frame.left||x>=frame.right||y<frame.top||y>=frame.bottom)//hit the wall
return 1;

Node *p=snake.head->next;
for(int i=snake.length-1;i>3;i--,p=p->next)//hit itself
if(x==p->x&&y==p->y)
return 1;
return 0;
}

bool GameOver()
{
int x=getmaxx()/2-50;
int y=getmaxy()/2-20;
setfillstyle(SOLID_FILL,DARKGRAY);
bar(x+3,y+3,x+103,y+43);
setfillstyle(SOLID_FILL,MAGENTA);
bar(x,y,x+100,y+40);
setlinestyle(0,3,1);
setcolor(RED);
rectangle(x,y,x+100,y+40);
outtextxy(x+20,y+10,"GAGE OVER!");
char c;
while(true) //按q或Q表示退出程序,按r或R表示重新開始游戲
{
c=getch();
if(c=='q'||c=='Q')
return false;
else if(c=='r'||c=='R')
return true;
}
}

C++五子棋源程序：

#include
#include
#include
#define backcolor CYAN
#define defaultcolor BLACK
#define linecolor MAGENTA
#define player1_color RED
#define player2_color WHITE
#define error_color RED
#define winner_color RED

const int left=40;
const int top=390;
const int d=30;
const int line_num=9;
const int turn=0;
const int r=d/3;
const int j=10;
int x,y,k=1,step=(line_num+1)*(line_num+1);
union REGS regs1,regs2;
class player1;
class player2;
class qipan{
public:
qipan();
~qipan(){};
void init_qipan();
friend void fall(player1 &num1,player2 &num2,qipan &num);
friend void input(player1 &num1,player2 &num2,qipan &num);

private:
int point[line_num+1][line_num+1];

};
class player1{
public:
player1();
~player1(){};
friend void fall(player1 &num1,player2 &num2,qipan &num);
friend void input(player1 &num1,player2 &num2);
friend int judge_winner(player1 &num1,player2 &num2);
private:
int point1[line_num+1][line_num+1];
};
class player2{
public:
player2();
~player2(){};
friend void fall(player1 &num1,player2 &num2,qipan &num);
friend void input(player1 &num1,player2 &num2,qipan &num);
friend int judge_winner(player1 &num1,player2 &num2);
private:
int point2[line_num+1][line_num+1];
};
void input(player1 &num1,player2 &num2);
void fall(player1 &num1,player2 &num2,qipan &num);
int judge_winner(qipan &num,player1 &num1,player2 &num2);
void inputerror();
void display_winner(int);

void main()
{
int driver=DETECT,mode;
initgraph(&driver,&mode,"e:\tc30\bgi");

qipan num;
player1 num1;
player2 num2;
while(step--)
{
input(num1,num2,num);
fall(num1,num2,num);
if(judge_winner(num1,num2))
{
display_winner(k);
}
}

// getchar();
}
qipan::qipan(void)
{ int j,i;
char ch[2]="0";
setbkcolor(backcolor);
setcolor(linecolor);
for(i=0;i<=line_num;i++)
{
line(left,top-i*d,left+line_num*d,top-i*d);
}
for(i=0;i<=line_num;i++)
{
line(left+i*d,top,left+i*d,top-line_num*d);
}
for(i=0;i<=line_num;i++)
{ if(*ch=='9'+1) *ch='a';
settextstyle(DEFAULT_FONT,HORIZ_DIR,1);
outtextxy(left+i*d-2,top+r+3,ch);
(*ch)=(*ch)+1;
}
*ch='0';
for(i=0;i<=line_num;i++)
{if(*ch=='9'+1) *ch='a';
settextstyle(DEFAULT_FONT,HORIZ_DIR,1);
outtextxy(left-r-10,top-d*i-3,ch);
(*ch)=(*ch)+1;
}

setcolor(defaultcolor);

for(i=0;i<=line_num;i++)
{
for(j=0;j<=line_num;j++)
point[i][j]=0;
}
}

void fall(player1 &num1,player2 &num2,qipan &num)
{
int flag=k%2;
if(flag)
{ setcolor(player2_color);
num2.point2[x][y]=1;
num.point[x][y]=2;
circle(left+d*x,top-d*y,r);
setfillstyle(1,player2_color);
floodfill(left+d*x,top-d*y,player2_color);
}
else
{ num1.point1[x][y]=1;
num.point[x][y]=1;
setcolor(player1_color);
circle(left+d*x,top-d*y,r);
setfillstyle(1,player1_color);
floodfill(left+d*x,top-d*y,player1_color);
}

setcolor(defaultcolor);
}

void input(player1 &num1,player2 &num2,qipan &num)
{ char xx,yy;

k++;
while(1)
{
regs1.h.ah=0;
xx=int86(22,®s1,®s1)-'0';
if(xx==('q'-'0')||xx==('Q'-'0'))
{ step=0;
return;
}
regs1.h.ah=0;
yy=int86(22,®s1,®s1)-'0';

if(yy==('q'-'0')||yy==('Q'-'0'))
{
step=0;
return ;
}
if(xx<0||xx>line_num)
{ inputerror();
continue;
}
if(yy<0||yy>line_num)
{inputerror();
continue;
}

if(num.point[xx][yy]==0)
{
break;
}
else
{
inputerror();
continue;
}
}

x=(int)xx;
y=(int)yy;

setcolor(backcolor);
settextstyle(DEFAULT_FONT,HORIZ_DIR,1);
outtextxy(left+d*line_num/3,top+d*2,"Input error");
setcolor(defaultcolor);
}

player1::player1()
{
int i,j;
for(i=0;i<=line_num;i++)
{
for(j=0;j<=line_num;j++)
point1[i][j]=0;
}
}

player2::player2()
{ int i,j;
for(i=0;i<=line_num;i++)
{
for(j=0;j<=line_num;j++)
point2[i][j]=0;
}
}
void inputerror(void)
{ setcolor(error_color);
settextstyle(DEFAULT_FONT,HORIZ_DIR,1);
outtextxy(left+d*line_num/3,top+d*2,"Input error");
setcolor(defaultcolor);
}

int judge_winner(player1 &num1,player2 &num2)
{
int count=0,m=0,n=0,a=0,b=0,xx0,yy0;
int flag=k%2;
xx0=x; yy0=y;
if(!flag)
{ //left <-------> right
while(xx0>=1&&m<4) {xx0--;m++;}
while(n<9&&xx0<=line_num)
{
if(num1.point1[xx0][y]==1)
{
count++;
if(count==5) return 1;
}
else
{
count=0;
}
n++;
xx0++;
}
//up <------> down
count=0; xx0=x; m=0; n=0;
while(yy0>=1&&m<4){yy0--;m++;}
while(n<9&&yy0<=line_num)
{
if(num1.point1[x][yy0]==1)
{
count++;
if(count==5)
return 1;
}
else
{
count=0;
}
n++;
yy0++;
}
//left up ----- right down
xx0=x;
yy0=y;
m=0;
n=0;
count=0;
while(xx0>=1&&m<4){ xx0--; a++; m++;} m=0;
while(yy0<=line_num&&m<4){ yy0++; b++; m++;}
if(a<=b)
{
xx0=x-a; yy0=y+a;
}
else
{
xx0=x-b; yy0=y+b;
}
while(xx0<=line_num&&yy0>=0&&n<9)
{
if(num1.point1[xx0][yy0]==1)
{
count++;
if(count==5)
return 1;
}
else
{
count=0;
}
xx0++;
yy0--;
n++;
}
//right up <-----> left down
count=0;
a=0;
b=0;
n=0;
m=0;
xx0=x;
yy0=y;
while(xx0while(yy0if(a<=b)
{
xx0=x+a;
yy0=y+a;
}
else
{
xx0=x+b;
yy0=y+b;
}
while(xx0>=0&&yy0>=0&&n<9)
{
if(num1.point1[xx0][yy0]==1)
{
count++;
if(count==5)
return 1;
}
else
count=0;
xx0--;
yy0--;
n++;
}
//no winer
return 0;
}
else
{
//left <-------> right
while(xx0>=1&&m<4) {xx0--;m++;}
while(n<9&&xx0<=line_num)
{
if(num1.point1[xx0][y]==1)
{
count++;
if(count==5) return 1;
}
else
{
count=0;
}
n++;
xx0++;
}
//up <------> down
count=0; xx0=x; m=0; n=0;
while(yy0>=1&&m<4){yy0--;m++;}
while(n<9&&yy0<=line_num)
{
if(num2.point2[x][yy0]==1)
{
count++;
if(count==5)
return 1;
}
else
{
count=0;
}
n++;
yy0++;
}
//left up ----- right down
xx0=x;
yy0=y;
m=0;
n=0;
count=0;
while(xx0>=1&&m<4){ xx0--; a++; m++;} m=0;
while(yy0<=line_num&&m<4){ yy0++; b++; m++;}
if(a<=b)
{
xx0=x-a; yy0=y+a;
}
else
{
xx0=x-b; yy0=y+b;
}
while(xx0<=line_num&&yy0>=0&&n<9)
{
if(num2.point2[xx0][yy0]==1)
{
count++;
if(count==5)
return 1;
}
else
{
count=0;
}
xx0++;
yy0--;
n++;
}
//right up <-----> left down
count=0;
a=0;
b=0;
n=0;
m=0;
xx0=x;
yy0=y;
while(xx0while(yy0if(a<=b)
{
xx0=x+a;
yy0=y+a;
}
else
{
xx0=x+b;
yy0=y+b;
}
while(xx0>=0&&yy0>=0&&n<9)
{
if(num2.point2[xx0][yy0]==1)
{
count++;
if(count==5)
return 1;
}
else
count=0;
xx0--;
yy0--;
n++;
}
//no winer
return 0;

}
}

void display_winner(int k)
{
int flag=k%2;
if(!flag)
{ setcolor(winner_color);
settextstyle(DEFAULT_FONT,HORIZ_DIR,2);
outtextxy(left+d*2,top+40,"Red is winner");
setcolor(defaultcolor);
step=0;
getchar();
}
else
{ setcolor(winner_color);
settextstyle(DEFAULT_FONT,HORIZ_DIR,2);
outtextxy(left+2*d,top+40,"White is winner");
setcolor(defaultcolor);
step=0;

}
}

㈥ 教你如何使用C語言編寫簡單小游戲

編寫程序，實現如下表所示的5-魔方陣。
17

24

1

8

15

23

5

7

14

16

4

6

13

20

22

10

12

19

21

3

11

18

25

2

9

5-魔方陣
問題分析
所謂「n-魔方陣」，指的是使用1〜n2共n2個自然數排列成一個n×n的方陣，其中n為奇數；該方陣的每行、每列及對角線元素之和都相等，並為一個只與n有關的常數，該常數為n×(n2+1)/2。
例如5-魔方陣，其第一行、第一列及主對角線上各元素之和如下：
第一行元素之和：17+24+1+8+15=65
第一列元素之和：17+23+4+10+11=65
主對角線上元素之和：17+5+13+21+9=65
而
n×(n2+1)/2=5×(52+1)/2=65
可以驗證，5-魔方陣中其餘各行、各列及副對角線上的元素之和也都為65。
假定陣列的行列下標都從0開始，則魔方陣的生成方法為：在第0行中間置1，對從2開始的其餘n2-1個數依次按下列規則存放：
(1)
假定當前數的下標為(i，j)，則下一個數的放置位置為當前位置的右上方，即下標為(i-1，j+1)的位置。
(2)
如果當前數在第0行，即i-1小於0，則將下一個數放在最後一行的下一列上，即下標為(n-1，j+1)的位置。
(3)
如果當前數在最後一列上，即j+1大於n-1，則將下一個數放在上一行的第一列上，即下標為(i-1，0)的位置。
(4)
如果當前數是n的倍數，則將下一個數直接放在當前位置的正下方，即下標為(i+1，j）的位置。
演算法設計
在設計演算法時釆用了下面一些方法：
定義array()函數，array()函數的根據輸入的n值，生成並顯示一個魔方陣，當發現n不是奇數時，就加1使之成為奇數。
使用動態內存分配與釋放函數malloc()與free()，在程序執行過程中動態分配與釋放內存，這樣做的好處是使代碼具有通用性，同時提高內存的使用率。
在分配內存時還要注意，由於一個整型數要佔用兩個內存，因此，如果魔方陣中要存放的數有max個，則分配內存時要分配2*max個單元，從而有malloc(max+max)。在malloc()函數中使用max+max而不是2*max是考慮了程序運行的性能。
顯然應該使用二維數組來表示魔方陣，但雖然數組是二維形式的，而由於內存是一維線性的，因此在存取數組元素時，要將雙下標轉換為單個索引編號。在程序中直接定義了指針變數來指向數組空間，即使用malloc()函數分配的內存。

㈦ 誰能用C語言幫我設計一個小小的游戲- -。。（C++）

#include<stdio.h>
#define N 10
void welcome();
void initqipan();
void showqi(int i);
void save(int p);
void panan(int p);
void heqi();
void over();
int zouqihang();
int zouqilie();
/******************結構體 *****************/ struct zuobiao
{
int x[N * N];
int y[N * N];
} wei[N * N]; /******************主函數 *****************/
int main()
{
int p = 0;
welcome();
initqipan();
for (p = 1; p <= N * N; p++)
{
wei[p].x[p] = zouqihang();
wei[p].y[p] = zouqilie();
save(p);
showqi(p);
panan(p);
}
if (p == N * N)
heqi();
over();
} /******************建立棋盤 *****************/

void initqipan()
{
int i, j;
for (i = 0; i < N; i++)
{
printf("%d", i);
printf(" ");
}

printf("\n");
for (i = 1; i < N; i++)
{
for (j = 0; j < N; j++)
{
if (j == 0)
printf("%d", i);
else
printf("·");
}
printf("\n");
}
} /******************顯示棋子 *****************/

void showqi(int p)
{
int i, j, k, m;
int a[N * N], b[N * N];
FILE *fp;
fp = fopen("wuzi_list", "rb");
for (i = 1; i <= N * N; i++)
{
fread(&wei[i], sizeof(struct zuobiao), 1, fp);
a[i] = wei[i].x[i];
b[i] = wei[i].y[i];
} for (m = 1; m < p; m++)
{
while(wei[p].x[p] == a[m] && wei[p].y[p] == b[m])
{
printf("error!\n");
wei[p].x[p] = zouqihang();
wei[p].y[p] = zouqilie();
m = 1;
}
}
for (i = 0; i < N; i++)
{
printf("%d", i);
printf(" ");
}
printf("\n");
for (i = 1; i < N; i++)
{
for (j = 1; j < N; j++)
{
if (j == 1)
printf("%d", i);
for (k = 1; k <= p; k++)
{
if (i == wei[k].x[k] && j == wei[k].y[k])
{
if (k % 2 == 1)
{
printf("○");
break;
}
else if (k % 2 == 0)
{
printf("●");
break;
}
}
}
if (k > p)
printf("·");
else
continue;
}
printf("\n");
}
} /******************走棋行 *****************/

int zouqihang()
{
int x;
printf("請輸入要走棋子所在行 數!\n");
printf("x=");
scanf("%d", &x);
while (x > N - 1 || x < 1)
{
printf("error!\n");
printf("請輸入要走棋子所在行 數!\n");
printf("x=");
scanf("%d", &x);
}
return x;
} /******************走棋列 *****************/

int zouqilie()
{
int y;
printf("請輸入要走棋子所在列 數!\n");
printf("y=");
scanf("%d", &y);
while (y > N - 1 || y < 1)
{
printf("error!\n");
printf("請輸入要走棋子所在列 數!\n");
printf("y=");
scanf("%d", &y);
}
return y;
} /******************文件保存 *****************/

void save(int i)
{
FILE *fp;
fp = fopen("wuzi_list", "wb");
fwrite(&wei[i], sizeof(struct zuobiao), 1, fp);
} /****************判斷輸贏 *******************/ void panan(int p)
{
int i, j, k[8] = { 1, 1, 1, 1, 1, 1, 1, 1, };
int a[N * N], b[N * N];
FILE *fp;
fp = fopen("wuzi_list", "rb");
for (i = 1; i <= p; i++)
{
fread(&wei[i], sizeof(struct zuobiao), 1, fp);
a[i] = wei[i].x[i];
b[i] = wei[i].y[i];
} /*****************判斷行 ******************/ for (i = 1; i <= p; i++)
{
if (i % 2 == 1)
{
for (j = 1; j <= p; j = j + 2)
{
if ((a[i] == a[j]) && (b[i] == b[j] - 1))
{
k[0]++;
continue;
}
else if ((a[i] == a[j]) && (b[i] == b[j] - 2))
{
k[0]++;
continue;
}
else if ((a[i] == a[j]) && (b[i] == b[j] - 3))
{
k[0]++;
continue;
}
else if ((a[i] == a[j]) && (b[i] == b[j] - 4))
{
k[0]++;
continue;
}
else if (k[0] == 5)
{
printf("Player 1 wins!!!\n");
}
else
continue;
}
if (k[0] == 5)
break;
k[0] = 1;
}
else if (k[0] == 5)
break;
else if (i % 2 == 0)
{
for (j = 2; j <= p; j = j + 2)
{
if ((a[i] == a[j]) && (b[i] == b[j] - 1))
{
k[1]++;
continue;
}
else if ((a[i] == a[j]) && (b[i] == b[j] - 2))
{
k[1]++;
continue;
}
else if ((a[i] == a[j]) && (b[i] == b[j] - 3))
{
k[1]++;
continue;
}
else if ((a[i] == a[j]) && (b[i] == b[j] - 4))
{
k[1]++;
continue;
}
else if (k[1] == 5)
{
printf("Player 2 wins!!!\n");
}
else
continue;
}
if (k[1] == 5)
break;
k[1] = 1;
}
} /**********************判斷列 ************************/
for (i = 1; i <= p; i++)
{
if (k[0] == 5 || k[1] == 5)
break;
else if (i % 2 == 1)
{
for (j = 1; j <= p; j = j + 2)
{
if ((a[i] == a[j] - 1) && (b[i] == b[j]))
{
k[2]++;
continue;
}
else if ((a[i] == a[j] - 2) && (b[i] == b[j]))
{
k[2]++;
continue;
}
else if ((a[i] == a[j] - 3) && (b[i] == b[j]))
{
k[2]++;
continue;
}
else if ((a[i] == a[j] - 4) && (b[i] == b[j]))
{
k[2]++;
continue;
}
else if (k[2] == 5)
{
printf("Player 1 wins!!!\n");
}
else
continue;
}
if (k[2] == 5)
break;
k[2] = 1;
}
else if (k[2] == 5)
break;
else if (i % 2 == 0)
{
for (j = 2; j <= p; j = j + 2)
{
if ((a[i] == a[j] - 1) && (b[i] == b[j]))
{
k[3]++;
continue;
}
else if ((a[i] == a[j] - 2) && (b[i] == b[j]))
{
k[3]++;
continue;
}
else if ((a[i] == a[j] - 3) && (b[i] == b[j]))
{
k[3]++;
continue;
}
else if ((a[i] == a[j] - 4) && (b[i] == b[j]))
{
k[3]++;
continue;
}
else if (k[3] == 5)
{
printf("Player 2 wins!!!\n");
}
else
continue;
}
if (k[3] == 5)
break;
k[3] = 1;
}
} /****************判斷對角（左 上-右下）******************/
for (i = 1; i <= p; i++)
{
if (k[0] == 5 || k[1] == 5 || k[2] == 5 || k[3] == 5)
break;
else if (i % 2 == 1)
{
for (j = 1; j <= p; j = j + 2)
{
if ((a[i] == a[j] - 1) && (b[i] == b[j] - 1))
{
k[4]++;
continue;
}
else if ((a[i] == a[j] - 2) && (b[i] == b[j] - 2))
{
k[4]++;
continue;
}
else if ((a[i] == a[j] - 3) && (b[i] == b[j] - 3))
{
k[4]++;
continue;
}
else if ((a[i] == a[j] - 4) && (b[i] == b[j] - 4))
{
k[4]++;
continue;
}
else if (k[4] == 5)
{
printf("Player 1 wins!!!\n");
}
else
continue;
}
if (k[4] == 5)
break;
k[4] = 1;
}
else if (k[2] == 5)
break;
else if (i % 2 == 0)
{
for (j = 2; j <= p; j = j + 2)
{
if ((a[i] == a[j] - 1) && (b[i] == b[j] - 1))
{
k[5]++;
continue;
}
else if ((a[i] == a[j] - 2) && (b[i] == b[j] - 2))
{
k[5]++;
continue;
}
else if ((a[i] == a[j] - 3) && (b[i] == b[j] - 3))
{
k[5]++;
continue;
}
else if ((a[i] == a[j] - 4) && (b[i] == b[j] - 4))
{
k[5]++;
continue;
}
else if (k[5] == 5)
{
printf("Player 2 wins!!!\n");
}
else
continue;
}
if (k[5] == 5)
break;
k[5] = 1;
}
} /**********判斷對角（左下-右 上）************/
for (i = 1; i <= p; i++)
{
if (k[0] == 5 || k[1] == 5 || k[2] == 5 || k[3] == 5 || k[4] == 5
|| k[5] == 5)
break;
else if (i % 2 == 1)
{
for (j = 1; j <= p; j = j + 2)
{
if ((a[i] == a[j] + 1) && (b[i] == b[j] - 1))
{
k[6]++;
continue;
}
else if ((a[i] == a[j] + 2) && (b[i] == b[j] - 2))
{
k[6]++;
continue;
}
else if ((a[i] == a[j] + 3) && (b[i] == b[j] - 3))
{
k[6]++;
continue;
}
else if ((a[i] == a[j] + 4) && (b[i] == b[j] - 4))
{
k[6]++;
continue;
}
else if (k[6] == 5)
{
printf("Player 1 wins!!!\n");
}
else
continue;
}
if (k[6] == 5)
break;
k[6] = 1;
}
else if (k[6] == 5)
break;
else if (i % 2 == 0)
{
for (j = 2; j <= p; j = j + 2)
{
if ((a[i] == a[j] + 1) && (b[i] == b[j] - 1))
{
k[7]++;
continue;
}
else if ((a[i] == a[j] + 2) && (b[i] == b[j] - 2))
{
k[7]++;
continue;
}
else if ((a[i] == a[j] + 3) && (b[i] == b[j] - 3))
{
k[7]++;
continue;
}
else if ((a[i] == a[j] + 4) && (b[i] == b[j] - 4))
{
k[7]++;
continue;
}
else if (k[7] == 5)
{
printf("Player 2 wins!!!\n");
}
else
continue;
}
if (k[7] == 5)
break;
k[7] = 1;
}
}
} /****************和棋 *******************/

void heqi()
{
printf("************************** **********\n");
printf(" Tie!!!\n");
printf("************************** **********\n");
} /****************游戲結束 *******************/ void over()
{
printf("************************** **********\n");
printf(" game over!!!\n");
printf("************************** **********\n");
} /****************游戲開始 *******************/ void welcome()
{
printf("************************** **********\n");
printf(" Welcome!!!\n");
printf("************************** **********\n");
}
以上為五子棋代碼

㈧ 僅用c語言能編出哪些小游戲

可以編寫狼追兔子游戲，擲骰子游戲，24點游戲，井字棋游戲，農夫過河游戲，掃雷小游戲，人機猜數游戲，三色球游戲， 推箱子游戲，坦克大戰游戲，貪吃蛇游戲等。

㈨ 用C語言編寫的小游戲代碼是什麼

/*也不知道你是什麼級別的，我是一個新手，剛接觸編程語言，以下是我自己變得一個小程序，在所有c語言的編譯器（vc++6.0、turbo…………）上都能運行，你還可以進一步改進。這是一個類似貪吃蛇的小游戲。祝你好運*/
/*貪吃蛇*/
#include<stdio.h>
#include<time.h>
#include<conio.h>
#include<stdlib.h>
int head=3 ,tail=0;
int main()
{
int i,j,k=0;
int zuobiao[2][80];
long start;
int direction=77;
int gamespeed;
int timeover;
int change(char qipan[20][80],int zuobiao[2][80],char direction);
zuobiao[0][tail]=1;zuobiao[1][tail]=1;zuobiao[0][1]=1;zuobiao[1][1]=2;zuobiao[0][2]=1;zuobiao[1][2]=3;zuobiao[0][head]=1;zuobiao[1][head]=4;
/*處理棋盤*/
char qipan[20][80];//定義棋盤
for(i=0;i<20;i++)
for(j=0;j<80;j++)
qipan[i][j]=' ';//初始化棋盤
for(i=0;i<80;i++)
qipan[0][i]='_';
for(i=0;i<20;i++)
qipan[i][0]='|';
for(i=0;i<20;i++)
qipan[i][79]='|';
for(i=0;i<80;i++)
qipan[19][i]='_';
qipan[1][1]=qipan[1][2]=qipan[1][3]='*';//初始化蛇的位置
qipan[1][4]='#';
printf("This is a game of a SNAKE.\nGOOD LUCK TO YOU !\n");
printf("Input your game speed,please.(e.g.300)\n");
scanf("%d",&gamespeed);

while(direction!='q')
{
system("cls");
for(i=0;i<20;i++)//列印出棋盤
for(j=0;j<80;j++)
printf("%c",qipan[i][j]);
timeover=1;
start=clock();
while(!kbhit()&&(timeover=clock()-start<=gamespeed));
if(timeover)
{
getch();
direction=getch();
}
else
direction=direction;
if(!(direction==72||direction==80||direction==75||direction==77))
{
return 0;
system("cls");
printf("GAME OVER!\n");
}
if(!change(qipan,zuobiao,direction))
{
direction='q';
system("cls");
printf("GAME OVER!\n");
}
}
return 0;
}
int change(char qipan[20][80],int zuobiao[2][80],char direction)
{
int x,y;
if(direction==72)
x=zuobiao[0][head]-1;y=zuobiao[1][head];
if(direction==80)
x=zuobiao[0][head]+1;y=zuobiao[1][head];
if(direction==75)
x=zuobiao[0][head];y=zuobiao[0][head]-1;
if(direction==77)
x=zuobiao[0][head];y=zuobiao[1][head]+1;
if(x==0||x==18||y==78||y==0)
return 0;
if(qipan[x][y]!=' ')
return 0;
qipan[zuobiao[0][tail]][zuobiao[1][tail]]=' ';
tail=(tail+1)%80;
qipan[zuobiao[0][head]][zuobiao[1][head]]='*';
head=(head+1)%80;
zuobiao[0][head]=x;
zuobiao[1][head]=y;
qipan[zuobiao[0][head]][zuobiao[1][head]]='#';
return 1;
}

㈩ 一種C語言小游戲程序設計(程序已經附上)

"掃雷"小游戲C代碼

#include<stdio.h>
#include<math.h>
#include<time.h>
#include<stdlib.h>
main( )
{char a[102][102],b[102][102],c[102][102],w;
int i,j; /*循環變數*/
int x,y,z[999]; /*雷的位置*/
int t,s; /*標記*/
int m,n,lei; /*計數*/
int u,v; /*輸入*/
int hang,lie,ge,mo; /*自定義變數*/
srand((int)time(NULL)); /*啟動隨機數發生器*/
leb1: /*選擇模式*/
printf(" 請選擇模式： 1.標准 2.自定義 ");
scanf("%d",&mo);
if(mo==2) /*若選擇自定義模式，要輸入三個參數*/
{do
{t=0; printf("請輸入 行數 列數 雷的個數 ");
scanf("%d%d%d",&hang,&lie,&ge);
if(hang<2){printf("行數太少 "); t=1;}
if(hang>100){printf("行數太多 ");t=1;}
if(lie<2){printf("列數太少 ");t=1;}
if(lie>100){printf("列數太多 ");t=1;}
if(ge<1){printf("至少要有一個雷 ");t=1;}
if(ge>=(hang*lie)){printf("雷太多了 ");t=1;}
}while(t==1);
}
else{hang=10,lie=10,ge=10;} /*否則就是選擇了標准模式(默認參數)*/
for(i=1;i<=ge;i=i+1) /*確定雷的位置*/
{do
{t=0; z[i]=rand( )%(hang*lie);
for(j=1;j<i;j=j+1){if(z[i]==z[j]) t=1;}
}while(t==1);
}
for(i=0;i<=hang+1;i=i+1) /*初始化a,b,c*/
{for(j=0;j<=lie+1;j=j+1) {a[i][j]='1'; b[i][j]='1'; c[i][j]='0';} }
for(i=1;i<=hang;i=i+1)
{for(j=1;j<=lie;j=j+1) {a[i][j]='+';} }
for(i=1;i<=ge;i=i+1) /*把雷放入c*/
{x=z[i]/lie+1; y=z[i]%lie+1; c[x][y]='#';}
for(i=1;i<=hang;i=i+1) /*計算b中數字*/
{for(j=1;j<=lie;j=j+1)
{m=48;
if(c[i-1][j-1]=='#')m=m+1; if(c[i][j-1]=='#')m=m+1;
if(c[i-1][j]=='#')m=m+1; if(c[i+1][j+1]=='#')m=m+1;
if(c[i][j+1]=='#')m=m+1; if(c[i+1][j]=='#')m=m+1;
if(c[i+1][j-1]=='#')m=m+1; if(c[i-1][j+1]=='#')m=m+1;
b[i][j]=m;
}
}
for(i=1;i<=ge;i=i+1) /*把雷放入b中*/
{x=z[i]/lie+1; y=z[i]%lie+1; b[x][y]='#';}

lei=ge; /*以下是游戲設計*/
do
{leb2: /*輸出*/
system("cls");printf(" ");

printf(" ");
for(i=1;i<=lie;i=i+1)
{w=(i-1)/10+48; printf("%c",w);
w=(i-1)%10+48; printf("%c ",w);
}
printf(" |");
for(i=1;i<=lie;i=i+1){printf("---|");}
printf(" ");
for(i=1;i<=hang;i=i+1)
{w=(i-1)/10+48; printf("%c",w);
w=(i-1)%10+48; printf("%c |",w);
for(j=1;j<=lie;j=j+1)
{if(a[i][j]=='0')printf(" |");
else printf(" %c |",a[i][j]);
}
if(i==2)printf(" 剩餘雷個數");
if(i==3)printf(" %d",lei);
printf(" |");
for(j=1;j<=lie;j=j+1){printf("---|");}
printf(" ");
}

scanf("%d%c%d",&u,&w,&v); /*輸入*/
u=u+1,v=v+1;
if(w!='#'&&a[u][v]=='@')
goto leb2;
if(w=='#')
{if(a[u][v]=='+'){a[u][v]='@'; lei=lei-1;}
else if(a[u][v]=='@'){a[u][v]='?'; lei=lei+1;}
else if(a[u][v]=='?'){a[u][v]='+';}
goto leb2;
}
a[u][v]=b[u][v];

leb3: /*打開0區*/
t=0;
if(a[u][v]=='0')
{for(i=1;i<=hang;i=i+1)
{for(j=1;j<=lie;j=j+1)
{s=0;
if(a[i-1][j-1]=='0')s=1; if(a[i-1][j+1]=='0')s=1;
if(a[i-1][j]=='0')s=1; if(a[i+1][j-1]=='0')s=1;
if(a[i+1][j+1]=='0')s=1; if(a[i+1][j]=='0')s=1;
if(a[i][j-1]=='0')s=1; if(a[i][j+1]=='0')s=1;
if(s==1)a[i][j]=b[i][j];
}
}
for(i=1;i<=hang;i=i+1)
{for(j=lie;j>=1;j=j-1)
{s=0;
if(a[i-1][j-1]=='0')s=1; if(a[i-1][j+1]=='0')s=1;
if(a[i-1][j]=='0')s=1; if(a[i+1][j-1]=='0')s=1;
if(a[i+1][j+1]=='0')s=1; if(a[i+1][j]=='0')s=1;
if(a[i][j-1]=='0')s=1; if(a[i][j+1]=='0')s=1;
if(s==1)a[i][j]=b[i][j];
}
}
for(i=hang;i>=1;i=i-1)
{for(j=1;j<=lie;j=j+1)
{s=0;
if(a[i-1][j-1]=='0')s=1; if(a[i-1][j+1]=='0')s=1;
if(a[i-1][j]=='0')s=1; if(a[i+1][j-1]=='0')s=1;
if(a[i+1][j+1]=='0')s=1; if(a[i+1][j]=='0')s=1;
if(a[i][j-1]=='0')s=1; if(a[i][j+1]=='0')s=1;
if(s==1)a[i][j]=b[i][j];
}
}
for(i=hang;i>=1;i=i-1)
{for(j=lie;j>=1;j=j-1)
{s=0;
if(a[i-1][j-1]=='0')s=1; if(a[i-1][j+1]=='0')s=1;
if(a[i-1][j]=='0')s=1; if(a[i+1][j-1]=='0')s=1;
if(a[i+1][j+1]=='0')s=1;if(a[i+1][j]=='0')s=1;
if(a[i][j-1]=='0')s=1; if(a[i][j+1]=='0')s=1;
if(s==1)a[i][j]=b[i][j];
}
}

for(i=1;i<=hang;i=i+1) /*檢測0區*/
{for(j=1;j<=lie;j=j+1)
{if(a[i][j]=='0')
{if(a[i-1][j-1]=='+'||a[i-1][j-1]=='@'||a[i-1][j-1]=='?')t=1;
if(a[i-1][j+1]=='+'||a[i-1][j+1]=='@'||a[i-1][j+1]=='?')t=1;
if(a[i+1][j-1]=='+'||a[i+1][j-1]=='@'||a[i+1][j-1]=='?')t=1;
if(a[i+1][j+1]=='+'||a[i+1][j+1]=='@'||a[i+1][j+1]=='?')t=1;
if(a[i+1][j]=='+'||a[i+1][j]=='@'||a[i+1][j]=='?')t=1;
if(a[i][j+1]=='+'||a[i][j+1]=='@'||a[i][j+1]=='?')t=1;
if(a[i][j-1]=='+'||a[i][j-1]=='@'||a[i][j-1]=='?')t=1;
if(a[i-1][j]=='+'||a[i-1][j]=='@'||a[i-1][j]=='?')t=1;
}
}
}
if(t==1)goto leb3;
}

n=0; /*檢查結束*/
for(i=1;i<=hang;i=i+1)
{for(j=1;j<=lie;j=j+1)
{if(a[i][j]!='+'&&a[i][j]!='@'&&a[i][j]!='?')n=n+1;}
}
}
while(a[u][v]!='#'&&n!=(hang*lie-ge));

for(i=1;i<=ge;i=i+1) /*游戲結束*/
{x=z[i]/lie+1; y=z[i]%lie+1; a[x][y]='#'; }
printf(" ");
for(i=1;i<=lie;i=i+1)
{w=(i-1)/10+48; printf("%c",w);
w=(i-1)%10+48; printf("%c ",w);
}
printf(" |");
for(i=1;i<=lie;i=i+1){printf("---|");}
printf(" ");
for(i=1;i<=hang;i=i+1)
{w=(i-1)/10+48; printf("%c",w);
w=(i-1)%10+48; printf("%c |",w);
for(j=1;j<=lie;j=j+1)
{if(a[i][j]=='0')printf(" |");
else printf(" %c |",a[i][j]);
}
if(i==2)printf(" 剩餘雷個數");
if(i==3)printf(" %d",lei); printf(" |");
for(j=1;j<=lie;j=j+1) {printf("---|");}
printf(" ");
}
if(n==(hang*lie-ge)) printf("你成功了! ");
else printf(" 游戲結束! ");
printf(" 重玩請輸入1 ");
t=0;
scanf("%d",&t);
if(t==1)goto leb1;
}

/*註：在DEV c++上運行通過。行號和列號都從0開始，比如要確定第0行第9列不是「雷」，就在0和9中間加入一個字母，可以輸入【0a9】三個字元再按回車鍵。3行7列不是雷，則輸入【3a7】回車；第8行第5列是雷，就輸入【8#5】回車，9行0列是雷則輸入【9#0】並回車*/