Tontti

#include <iostream>
#include <algorithm>

using namespace std;

int main(int argc, char** argv) {
    int n, m, x;
    int v = 0;
    cin >> n >> m >> x;
    string s;
    int r[min(n, m)+1][n][m];
    for (int i = 0; i < n; ++i){
        cin >> s;
        for (int j = 0; j < m; ++j){
            r[0][i][j] = 0;
            r[1][i][j] = s[j] == '*';
            if (r[1][i][j] == x) ++v;
        }
    }
    for (int k = 2; k <= min(n, m); ++k){
        for (int i = k-1; i < n; ++i){
            for (int j = k-1; j < m; ++j){
                r[k][i][j] = r[1][i][j] + r[k-1][i-1][j] + r[k-1][i][j-1] -
                             r[k-2][i-1][j-1] + r[1][i-k+1][j-k+1];
                if (r[k][i][j] == x) ++v;
            }
        }
    }
    cout << v << "\n";
    return 0;
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: RUNTIME ERROR

Test 7

Group: 2

Verdict: RUNTIME ERROR

Test 8

Group: 2

Verdict: RUNTIME ERROR

Test 9

Group: 2

Verdict: RUNTIME ERROR

Test 10

Group: 2

Verdict: RUNTIME ERROR

Test 11

Group: 3

Verdict: RUNTIME ERROR

Test 12

Group: 3

Verdict: RUNTIME ERROR

Test 13

Group: 3

Verdict: RUNTIME ERROR

Test 14

Group: 3

Verdict: RUNTIME ERROR

Test 15

Group: 3

Verdict: RUNTIME ERROR