Tontti

input/code.cpp: In function 'int main(int, char**)':
input/code.cpp:7:42: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d %d", &yMax, &xMax, &target);
                                          ^
input/code.cpp:12:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s", line);
                    ^

#include <stdio.h>
#include <math.h>

int main(int argc, char* argv[])
{
	int yMax, xMax, target;
	scanf("%d %d %d", &yMax, &xMax, &target);
	char *arr = new char[yMax*xMax];
	char *line = new char[xMax + 1];
	for (int i = 0; i < yMax; i++){
		int t = 0;
		scanf("%s", line);
		for (int j = 0; j < xMax; j++){
			if (line[j] == '*')
				t++;
			arr[(i*xMax) + j] = t;
		}
	}
	delete[] line;
	int areas = 0;
	int a = ceil(sqrt((double)target));
	while (a <= xMax && a <= yMax){
		for (int y = 0; y < yMax - a; y++){
			for (int x = 0; x < xMax - a; x++){
				int yT = y + a-1,xT = x+a -1;
				int trees = arr[(yT*xMax) + xT];
				if ((xT - a) >= 0)
					trees -= arr[(yT*xMax) + xT - a];
				if ((yT - a) >= 0){
					trees -= arr[((yT*xMax) - a) + xT];
					if ((xT-a)>=0)
						trees += arr[((yT*xMax)-a) + (xT - a)];
				}
				if (trees == target)
					areas++;

			}
		}
		a++;
	}
	printf("%d", areas);
	delete[] arr;
	return 0;
}

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: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED