//bfs
#include <iostream>
#include <cstring>
#include <queue>
using namespace std;
bool bfs(int x, int y);
struct data
{
int x;
int y;
};
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
int m;
int n;
int s_x; //S的坐标
int s_y;
int g_x; //G的坐标
int g_y;
int a, b, c, d, e; //a~e的个数
int aa, bb, cc, dd, ee; //已经找到的a~e的个数
char g[25][25];
int vis[25][25];
int main()
{
while(cin >> m >> n, m + n)
{
a = b = c = d = e = 0;
aa = bb = cc = dd = ee = 0;
memset(g, 'X', sizeof(g));
for(int i = 1; i <= m; i++)
for(int j = 1; j <= n; j++)
{
cin >> g[i][j];
switch(g[i][j])
{
case 'a': a++; break;
case 'b': b++; break;
南阳理工OJ_题目82 迷宫寻宝(一)
最新推荐文章于 2020-08-11 17:03:21 发布