Lehmät

#include <iostream>
#include <string>
using namespace std;
 
int main() {
	int n; int m;
	int lehmat = 0;
	
	cin >> n; // Korkeus
	cin >> m; // Leveys
 
	for (int i = 0; i < n; i++) {
		string rivi;
		cin >> rivi;
		int aitaPalat = 0;
 
		for (int j = 0; j < m; j++) {
			char letter = rivi[j];
			
			switch(letter){
				case '@': // Lehm�
					if (j == 0 || i == 0 || j == m || i == n || aitaPalat != 1) { // Lehm� on kartan reunalla ja aidan ulkopuolella
						continue;
					}
					else {
						lehmat++;
					}
					break;
				case '*': // Aita
					aitaPalat++;
					break;
				case '.': // V�li
					break;
			}
		}
	}
 
	cout << lehmat;
	return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED