Lehmät

#include <algorithm>
#include <iostream>
#include <string>

using namespace std;

int main() {
    int n, m;
    cin >> n >> m;

    int first, last;
    int total = 0;
    for (int i=0; i<n; i++) {
        string row;
        cin >> row;
    
        string reversed(row.rbegin(), row.rend());

        if (row.find('*') != string::npos) {
            first = row.find('*');
            last = m - reversed.find('*');
            row = row.substr(first, last - first);
            total += count(row.begin(), row.end(), '@');
        }
        
    }
    cout << total;
}

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