ratar

#include <bits/stdc++.h>
#define ll long long
#define INF 999999999
#define N (1<<17)
#define M 1000000007

using namespace std;

int ans = 0;
int v[50][50];
map<pair<pair<int, int>, int>, int> m;
map<pair<pair<int, int>, int>, int> m2;
inline int sum (int x1, int x2, int y1, int y2) {
  int s = v[y2][x2];
  if (x1) s -= v[y2][x1-1];
  if (y1) s -= v[y1-1][x2];
  if (x1 && y1) s += v[y1-1][x1-1];
  return s;
}

int main () {
  int n;
  cin>>n;
  for (int y = 0; y < n; y++) {
    for (int x = 0; x <n; x++) {
      cin>>v[y][x];
      if (x) v[y][x] += v[y][x - 1];
    }
  }
  for(int y = 1; y < n; y++) {
    for (int x = 0; x < n; x++) {
     v[y][x] += v[y - 1][x]; 
    }
  }
  for (int y = 0; y < n; y++) {
    for (int x = 0; x <n; x++) {
      for (int y1 = 0; y1 <= y; y1++) {
	for (int x1 = 0; x1 <= x; x1++) {
	  m[{{x1, y1}, sum(x1, x, y1, y)}]++;
	  m2[{{x1, y + 1}, sum(x1, x, y1, y)}]++;
	}
      }
    }
  }
  for (int y = 0; y < n; y++) {
    for (int x = 0; x <n; x++) {
      for (int y1 = 0; y1 <= y; y1++) {
	for (int x1 = 0; x1 <= x; x1++) {
	  ans += m[{{x + 1, y + 1}, sum(x1, x, y1, y)}];
	  ans += m2[{{x + 1, y1}, sum(x1, x, y1, y)}];
	}
      }
    }
  }
  cout<<ans<<endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: TIME LIMIT EXCEEDED

Test 10

Verdict: TIME LIMIT EXCEEDED

Test 11

Verdict: TIME LIMIT EXCEEDED

Test 12

Verdict: TIME LIMIT EXCEEDED

Test 13

Verdict: TIME LIMIT EXCEEDED