Osajono

#include <iostream>
#include <cmath>

using namespace std;



int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int n, m, p;
    cin >> n >> m >> p;
    int g=sqrt(p);
    int nel[n+1][m+1]={};
    for (int i=1; i<=n; ++i){
        int r=0;
        for (int j=1; j<=m; ++j){
            char w;
            cin >> w;
            if (w=='*') r += 1;
            nel[i][j] += nel[i-1][j]+r;
        }   
    }
long V=0;
    for (int x=0; x<m; ++x){
        for (int y=0; y<n; ++y){
             for (int k=g; k<=(min(m-x, n-y)); ++k){
                 int c = nel[y+k][x+k]+nel[y][x]-nel[y+k][x]-nel[y][x+k];
                 if (c==p) V+=1;

             }
        }
    }
cout << V;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: WRONG ANSWER

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: WRONG ANSWER

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: WRONG ANSWER

Test 13

Group: 3

Verdict: WRONG ANSWER

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: WRONG ANSWER