Tontti

import java.util.ArrayList;

public class Main {

    private static int hits;

    public static void main(String[] args) {
        IO io = new IO();
        int height = io.nextInt();
        int width = io.nextInt();
        int trees = io.nextInt();
        hits = 0;

        ArrayList<String> woods = new ArrayList<>();

        for (int i = 0; i < height; i++) {
            woods.add(io.next());
        }
        int smallest = height;
        if (height > width) {
            smallest = width;
        }

        iterateThroughAllSquares(width, height, smallest, woods, trees);

        io.println(hits);
        io.close();
    }

    private static int searchSquare(int startx, int starty, int size, ArrayList<String> woods, int trees) {
        int temphits = 0;
        int f1 = starty+size;
        int f2 = startx+size;
        
        for (int j = starty; j < f1; j++) {
            for (int i = startx; i < f2; i++) {
                System.out.print(woods.get(j).charAt(i));
                if (woods.get(j).charAt(i) == '*') {
                    temphits++;
                    
                }
                
            }
            System.out.println("");
            
        }
        System.out.println("------------");
        if (temphits == trees) {
            hits++;
        }
        size--;
        if (temphits >= trees && size*size >= trees) {
            
        }
     /*   size--;
        if (temphits >= trees && size*size >= trees) {
            for (int i = 0; i <= woods.size()-size-starty; i++) {
                searchSquare(startx, starty+i, size, woods, trees);
            }
        }*/
        
        
        
        return temphits;
    }
    //in this function, the grid starts from 0,0 in the left upper corner
    private static void iterate2(int width, int height, int size, ArrayList<String> woods, int trees) {
        int temphits = 0;
        for (int i = height; i <= woods.size()-size; i++) {
            
        }
    }
    private static void iterateThroughAllSquares(int width, int height, int size, ArrayList<String> woods, int trees) {
        for (int i = 0; i <= width - size; i++) {
            for (int j = 0; j <= height - size; j++) {
                int temphits = searchSquare(i, j, size, woods, trees);
                if (height < width) {
                    iterate2(i,0,size-1,woods,trees);
                }
            }
        }
        
        //if higher than wider: diff function. Iterate through only the top or left side of the square and only if there 
        //are enough potential trees
        
        // no need for if??, just stick them in different parts of the for loop
        
        
        /*size--;
        if (Math.pow(size, 2) >= trees) {
            iterateThroughAllSquares(width, height, size, woods, trees);
        }*/
    }
    
    
}

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