Submission #2833694

---

Source Code Expand

#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define For(i, a, b) for (i = a; i <= b; i++)
using namespace std;
const int N = 2005, PYZ = 1e9 + 7;
int n, m, K, f[N][N], ans;
int main() {
	int i, j, k; cin >> n >> m >> K; For (i, 1, K - 1) f[i][K - i] = 1;
	For (i, 1, n) For (j, 1, m) {
		if (!f[i][j]) continue;
		For (k, 0, K - 1) if (i + k <= n && j + K - 1 - k <= m)
			f[i + k][j + K - 1 - k] = (f[i + k][j + K - 1 - k] + f[i][j]) % PYZ;
		if ((i - 1) % (K - 1) == (n - 1) % (K - 1) && (j - 1) % (K - 1) == (m - 1) % (K - 1))
			ans = (ans + f[i][j]) % PYZ;
	}
	cout << ans << endl; return 0;
}

Submission Info

Judge Result