程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> poj 2612 Mine Sweeper

poj 2612 Mine Sweeper

編輯:C++入門知識

poj 2612 Mine Sweeper


Mine Sweeper Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 6429 Accepted: 2500

Description

The game Minesweeper is played on an n by n grid. In this grid are hidden m mines, each at a distinct grid location. The player repeatedly touches grid positions. If a position with a mine is touched, the mine explodes and the player loses. If a positon not containing a mine is touched, an integer between 0 and 8 appears denoting the number of adjacent or diagonally adjacent grid positions that contain a mine. A sequence of moves in a partially played game is illustrated below.
\
Here, n is 8, m is 10, blank squares represent the integer 0, raised squares represent unplayed positions, and the figures resembling asterisks represent mines. The leftmZ†·Ÿ"http://www.Bkjia.com/kf/ware/vc/" target="_blank" class="keylink">vc3QgaW1hZ2UgcmVwcmVzZW50cyB0aGUgcGFydGlhbGx5IHBsYXllZCBnYW1lLiBGcm9tIHRoZSBmaXJzdCBpbWFnZSB0byB0aGUgc2Vjb25kLCB0aGUKIHBsYXllciBoYXMgcGxheWVkIHR3byBtb3ZlcywgZWFjaCB0aW1lIGNob29zaW5nIGEgc2FmZSBncmlkIHBvc2l0aW9uLiBGcm9tIHRoZSBzZWNvbmQgaW1hZ2UgdG8gdGhlIHRoaXJkLCB0aGUgcGxheWVyIGlzIG5vdCBzbyBsdWNreTsgaGUgY2hvb3NlcyBhIHBvc2l0aW9uIHdpdGggYSBtaW5lIGFuZCB0aGVyZWZvcmUgbG9zZXMuIFRoZSBwbGF5ZXIgd2lucyBpZiBoZSBjb250aW51ZXMgdG8gbWFrZSBzYWZlIG1vdmVzIHVudGlsIG9ubHkgbSB1bnBsYXllZAogcG9zaXRpb25zIHJlbWFpbjsgdGhlc2UgbXVzdCBuZWNlc3NhcmlseSBjb250YWluIHRoZSBtaW5lcy4gPGJyPgo8YnI+CllvdXIgam9iIGlzIHRvIHJlYWQgdGhlIGluZm9ybWF0aW9uIGZvciBhIHBhcnRpYWxseSBwbGF5ZWQgZ2FtZSBhbmQgdG8gcHJpbnQgdGhlIGNvcnJlc3BvbmRpbmcgYm9hcmQuIDxicj4KCjxwIGNsYXNzPQ=="pst">Input

The first line of input contains a single postitive integer n <= 10. The next n lines represent the positions of the mines. Each line represents the contents of a row using n characters: a period indicates an unmined positon while an asterisk indicates a mined position. The next n lines are each n characters long: touched positions are denoted by an x, and untouched positions by a period. The sample input corresponds to the middle figure above.

Output

Your output should represent the board, with each position filled in appropriately. Positions that have been touched and do not contain a mine should contain an integer between 0 and 8. If a mine has been touched, all positions with a mine should contain an asterisk. All other positions should contain a period.

Sample Input

8
...**..*
......*.
....*...
........
........
.....*..
...**.*.
.....*..
xxx.....
xxxx....
xxxx....
xxxxx...
xxxxx...
xxxxx...
xxx.....
xxxxx...

Sample Output

001.....
0013....
0001....
00011...
00001...
00123...
001.....
00123...

×¢Ò⣺Èç¹û²Èµ½µØÀ×£¬Òª°ÑËùÓеØÀ×±íʾ³öÀ´£»

#include 
using namespace std;
#define MAX 12
int n;
char map[MAX][MAX],ans[MAX][MAX];
int count(int i,int j,int n){
	int ans=0;
	if (map[i-1][j-1]=='*' && i-1>=0 && j-1>=0)
		ans++;
	if (map[i-1][j]=='*' && i-1>=0)
		ans++;
	if (map[i-1][j+1]=='*' && i-1>=0 && j+1=0)
		ans++;	
	if (map[i][j]=='*')
		ans++;
	if (map[i][j+1]=='*' && j+1=0)
		ans++;
	if (map[i+1][j]=='*' && i+1>n){
		for (int i=0;i>map[i][j];
		int flag=0;
		for (int i=0;i>ans[i][j];
				if (map[i][j]=='*' && ans[i][j]=='x')
					flag=1;
				if (ans[i][j]=='x'){
					int k=count(i,j,n);
					ans[i][j]=k+'0';
				}
			}
		}
		for (int i=0;i


  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved