UVA-Solutions/572.cpp at master · tahiat/UVA-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#define _CRT_SECURE_NO_WARNINGS
#include<iostream>
#include<stdio.h>
using namespace std;
#define size 101
int N, M;
char Grid[size][size];
void readcase(){
	int i;
	for (i = 0; i < M; i++)
		scanf("%s", Grid[i]);
}
void fill(int i, int j){
	Grid[i][j] = '*';
	if (i-1>=0 && j-1>=0 && '@' == Grid[i-1][j-1])
	fill(i - 1, j - 1);
	if (i-1>=0 && '@' == Grid[i - 1][j])
	fill(i - 1, j);
	if (i-1>=0 && j+1< N && '@' == Grid[i - 1][j+1])
	fill(i - 1, j + 1);
	if (j-1>=0 && '@' == Grid[i][j - 1])
	fill(i, j - 1);
	if (j+1<N && '@' == Grid[i][j + 1])
	fill(i, j + 1);
	if (i+1<M && j-1>=0 && '@' == Grid[i + 1][j -1])
	fill(i + 1, j - 1);
	if (i+1<M && '@' == Grid[i + 1][j ])
	fill(i + 1, j);
	if (i+1<M && j+1<N && '@' == Grid[i + 1][j + 1])
	fill(i + 1, j + 1);
}
int Ans;
void solvecase(){
	int i, j;
	Ans = 0;
	for (i = 0; i < M; i++){
		for (j = 0; j < N; j++)
			if (Grid[i][j] == '@')
			{
				Ans++;
				fill(i, j);
			}

	}

}
void printcase(){
	cout << Ans << endl;
}
int main(){
	int t;
	freopen("input.txt", "r", stdin);
	while (cin >> M >> N){
		if (M == 0)break;
		readcase();
		solvecase();
		printcase();
	}
	return 0;
}