1.1016
2.
Write a program to count the number of black tiles which he can reach by repeating the moves described above.
There are H more lines in the data set, each of which includes W characters. Each character represents the color of a tile as follows.
'.' - a black tile
'#' - a red tile
'@' - a man on a black tile(appears exactly once in a data set)
6 9 ....#. .....# ...... ...... ...... ...... ...... #@...# .#..#. 11 9 .#......... .#.#######. .#.#.....#. .#.#.###.#. .#.#..@#.#. .#.#####.#. .#.......#. .#########. ........... 11 6 ..#..#..#.. ..#..#..#.. ..#..#..### ..#..#..#@. ..#..#..#.. ..#..#..#.. 7 7 ..#.#.. ..#.#.. ###.### ...@... ###.### ..#.#.. ..#.#.. 0 0
45 59 6 13
3.@是一个人的起始位置,#不可以走,. 可以走,求出可以走的个数
4.深度搜索,递归
5.
#include<iostream>
#include<string.h>
#include<vector>
#include<algorithm>
#include<numeric>
#include<string.h>
#include<sstream>
#include<stdio.h>
#include<string>
#include<cstdlib>
#include<queue>
#include<iomanip>
using namespace std;
int n,m;
char map[30][30];
struct ans
{
int x;
int y;
}n1,n2;
int ww(int a,int b)
{
if(a>0&&a<=m&&b>0&&b<=n)
return 1;
return 0;
}
int BFS(int k,int z)
{
int num=0,i;
n1.x=k;
n1.y=z;
int disx[6]={-1,1,0,0};
int disy[6]={0,0,-1,1};
queue<ans> Q;
Q.push(n1);
while(!Q.empty())
{
n1=Q.front();
Q.pop();
for(i=0;i<4;i++)
{
n2.x=n1.x+disx[i];
n2.y=n1.y+disy[i];
if(ww(n2.x,n2.y)&&map[n2.x][n2.y]=='.')
{
num++;
Q.push(n2);
map[n2.x][n2.y]='#';
}
}
}
return num+1;
}
int main()
{
int j,i,t,k,z;
char x;
while(cin>>n>>m&&n!=0||m!=0)
{
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
{
cin>>map[i][j];
if(map[i][j]=='@') {k=i;z=j;}
}
}
t=BFS(k,z);
cout<<t<<endl;
}
return 0;
}