Tontti

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author alexey
 */
import java.util.*;

import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.NoSuchElementException;
import java.util.StringTokenizer;

public class Datatahti20163 {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
       
        
        IO io = new IO(); 
        int h = io.nextInt();
        int w = io.nextInt();
        int t = io.nextInt();
        int min=Math.min(h, w);
        int[][][] forest=new int[h][w][min+2];

        int answer=0;
        boolean stop = false;

        
       
        
        int iq=0;
        
        while(iq<h) {
            String newline = io.next();
            for (int j = 0; j < w; j++) {
                if (newline.charAt(j) == '*') {
                    forest[iq][j][0]=1;
                } else {
                    forest[iq][j][0]=0;
                }
            }
            iq++;
        }
        
int s=0;
boolean overload=false;

int a=0;
if(h==1){
    for (int i = 0; i < w; i++) {
        answer+=forest[1][i][0];
    }
}
if(w==1){
    for (int i = 0; i < h; i++) {
        answer+=forest[i][w][0];
    }
}

        for (int i = 1; i < min; i++) {
            
            for (int j = i ; j < w; j++) {
                //System.out.println(forest[i][j][0]);
               
               
                
                a=0;
                for (int k = 1; k < i+1; k++) {
                    
                    s=forest[i][j][0];
                    a+=forest[i-k][j][0]+forest[i][j-k][0];
                    if(forest[i-1][j-1][k-1]==-1){
                        forest[i][j][k]=-1; 
                       break;
                    }
                    s+=a+forest[i-1][j-1][k-1];
                    if(s>t){
                       forest[i][j][k]=-1; 
                       break;
                    }
                    forest[i][j][k]=s;
                    
                    if(s==t){
                        answer++;
                    }
                }
                s=0;
                a=0;
            }
            for (int j = i+1; j < h; j++) {
                //System.out.println(forest[j][i][0]);
                 
                
               
                a=0;
                for (int k = 1; k < i+1; k++) {
                    s=forest[j][i][0];
                    a+=forest[j-k][i][0]+forest[j][i-k][0];
                    if(forest[j-1][i-1][k-1]==-1){
                        forest[j][i][k]=-1; 
                       break;
                    }
                    s+=a+forest[j-1][i-1][k-1];
                    if(s>t){
                       forest[j][i][k]=-1; 
                       break;
                    }
                    forest[j][i][k]=s;
                    
                    if(s==t){
                        answer++;
                    }
                }
                s=0;
                a=0;
                
            }
        }









        io.println(answer);
        io.close();
    }
    static class IO extends PrintWriter {
	private BufferedReader r;
	private StringTokenizer s;
	
	public IO() {
		super(new BufferedOutputStream(System.out));
		r = new BufferedReader(new InputStreamReader(System.in));
	}
	
	public String nextLine() {
		String s = null;
		try {
			s = r.readLine();
		} catch (Exception e) {}
		if(s == null) throw new NoSuchElementException();
		return s;
	}
	
	public String next() {
		while (s == null || !s.hasMoreElements()) {
			s = new StringTokenizer(nextLine());
		}
		return s.nextToken();
	}
        public int nextInt() {
		return Integer.parseInt(next());
	}
}
}

Test 1

Group: 1

Verdict: WRONG ANSWER

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

Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
	at Datatahti20163.main(Datatahti20163.java:36)

Test 7

Group: 2

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
	at Datatahti20163.main(Datatahti20163.java:36)

Test 8

Group: 2

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
	at Datatahti20163.main(Datatahti20163.java:36)

Test 9

Group: 2

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
	at Datatahti20163.main(Datatahti20163.java:36)

Test 10

Group: 2

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
	at Datatahti20163.main(Datatahti20163.java:36)

Test 11

Group: 3

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
	at Datatahti20163.main(Datatahti20163.java:36)

Test 12

Group: 3

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
	at Datatahti20163.main(Datatahti20163.java:36)

Test 13

Group: 3

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
	at Datatahti20163.main(Datatahti20163.java:36)

Test 14

Group: 3

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
	at Datatahti20163.main(Datatahti20163.java:36)

Test 15

Group: 3

Verdict: RUNTIME ERROR

Exception in thread "main" java.lang.OutOfMemoryError: Java heap space
	at Datatahti20163.main(Datatahti20163.java:36)