Problem p00555 (C++)

Buggy submission (status: Runtime Error):
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<long long, int> ll_i;

#define PI 3.141592653589793238462643383279
#define mod 1000000007LL
#define rep(i, n) for (i = 0; i < n; ++i)
#define rep1(i, n) for (i = 1; i < n; ++i)
#define per(i, n) for (i = n - 1; i > -1; --i)
#define int(x)                                                                 \
  int x;                                                                       \
  scanf("%d", &x)
#define int2(x, y)                                                             \
  int x, y;                                                                    \
  scanf("%d%d", &x, &y)
#define int3(x, y, z)                                                          \
  int x, y, z;                                                                 \
  scanf("%d%d%d", &x, &y, &z)
#define int4(v, x, y, z)                                                       \
  int v, x, y, z;                                                              \
  scanf("%d%d%d%d", &v, &x, &y, &z)
#define int5(v, w, x, y, z)                                                    \
  int v, w, x, y, z;                                                           \
  scanf("%d%d%d%d%d", &v, &w, &x, &y, &z)
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
#define pri3(x, y, z) cout << (x) << " " << (y) << " " << (z) << "\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << (x) << "\n"
#define debug2(x, y) cout << " --- " << (x) << " " << (y) << "\n"
#define debug3(x, y, z)                                                        \
  cout << " --- " << (x) << " " << (y) << " " << (z) << "\n"
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)

string s[100];
int f[101][101] = {0};

int getsum(int t, int l, int b, int r) {
  return f[b][r] - f[b][l] - f[t][r] + f[t][l];
}
signed main(void) {
  int i, j;
  for (int testcase = 0; testcase >= 0; testcase++) {
    int3(n, m, d);
    rep(i, n) cin >> s[i];
    rep(i, n) rep(j, m) if (s[i][j] == '#') f[i + 1][j + 1]++;

    rep(i, n + 1) rep(j, m) f[i + 1][j + 1] += f[i + 1][j];
    rep(j, m + 1) rep(i, n) f[i + 1][j + 1] += f[i][j + 1];

    int res = 0;
    rep(i, n) rep(j, m - d + 1) if (getsum(i, j, i + 1, j + d) == 0)++ res;
    rep(j, m) rep(i, n - d + 1) if (getsum(i, j, i + d, j + 1) == 0)++ res;

    pri(res);

    /*/

    //*/
    break;
  }
  return 0;
}

Fixed submission:
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> i_i;
typedef pair<long long, int> ll_i;

#define PI 3.141592653589793238462643383279
#define mod 1000000007LL
#define rep(i, n) for (i = 0; i < n; ++i)
#define rep1(i, n) for (i = 1; i < n; ++i)
#define per(i, n) for (i = n - 1; i > -1; --i)
#define int(x)                                                                 \
  int x;                                                                       \
  scanf("%d", &x)
#define int2(x, y)                                                             \
  int x, y;                                                                    \
  scanf("%d%d", &x, &y)
#define int3(x, y, z)                                                          \
  int x, y, z;                                                                 \
  scanf("%d%d%d", &x, &y, &z)
#define int4(v, x, y, z)                                                       \
  int v, x, y, z;                                                              \
  scanf("%d%d%d%d", &v, &x, &y, &z)
#define int5(v, w, x, y, z)                                                    \
  int v, w, x, y, z;                                                           \
  scanf("%d%d%d%d%d", &v, &w, &x, &y, &z)
#define pri(x) cout << (x) << "\n"
#define pri2(x, y) cout << (x) << " " << (y) << "\n"
#define pri3(x, y, z) cout << (x) << " " << (y) << " " << (z) << "\n"
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define kabe puts("---------------------------")
#define kara puts("")
#define debug(x) cout << " --- " << (x) << "\n"
#define debug2(x, y) cout << " --- " << (x) << " " << (y) << "\n"
#define debug3(x, y, z)                                                        \
  cout << " --- " << (x) << " " << (y) << " " << (z) << "\n"
#define X first
#define Y second
#define eps 0.0001
#define prid(x) printf("%.15lf\n", x)

string s[100];
int f[101][101] = {0};

int getsum(int t, int l, int b, int r) {
  return f[b][r] - f[b][l] - f[t][r] + f[t][l];
}
signed main(void) {
  int i, j;
  for (int testcase = 0; testcase >= 0; testcase++) {
    int3(n, m, d);
    rep(i, n) cin >> s[i];
    rep(i, n) rep(j, m) if (s[i][j] == '#') f[i + 1][j + 1]++;

    rep(i, n + 1) rep(j, m) f[i][j + 1] += f[i][j];
    rep(j, m + 1) rep(i, n) f[i + 1][j] += f[i][j];

    int res = 0;
    rep(i, n) rep(j, m - d + 1) if (getsum(i, j, i + 1, j + d) == 0)++ res;
    rep(j, m) rep(i, n - d + 1) if (getsum(i, j, i + d, j + 1) == 0)++ res;

    pri(res);

    /*/

    //*/
    break;
  }
  return 0;
}