Lehmät

#include <iostream>

int main()
{
    uint32_t n, m;
    std::cin >> n;
    std::cin >> m;

    uint32_t cowCount = 0;

    for(uint32_t y = 0; y < n; y++)
    {
        std::string line;
        std::cin >> line;

        bool insideFence = false;

        // Sketchy way to check if its the upper bound of the fence :D
        uint32_t lastStar = 0;

        for(uint32_t x = 0; x < m; x++)
        {
            if(line[x] == '*')
            {
                if(lastStar + 1 == x)
                    break;

                insideFence = !insideFence;
                lastStar = x;
            }

            if(insideFence && line[x] == '@')
                cowCount++;
        }
    }

    std::cout << cowCount << "\n";

    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