Pagini recente » Cod sursa (job #3219340) | Cod sursa (job #1946357) | Cod sursa (job #858101) | Cod sursa (job #1288895) | Cod sursa (job #2025806)
#include <fstream>
using namespace std;
ifstream f ("diamant.in");
ofstream g ("diamant.out");
const int Dim = 2e5 + 5;
const int Mod = 10000;
const int N = 5e4;
int dp[ Dim ], aux[ Dim ], v[ Dim ];
int n, m, x, nr;
int main() {
f >> n >> m >> x;
int vmax = (n * (n + 1) / 2) * (m * (m + 1) / 2);
int vmin = -vmax;
if (x < vmin || x > vmax) {
g << 0;
return 0;
}
for (int i = 1; i <= n; ++i) {
for (int j = 1; j <= m; ++j) {
v[++nr] = i * j;
}
}
dp[N] = 1;
for (int i = 1; i <= nr; ++i) {
for (int s = vmin; s <= vmax; ++s) {
aux[s + N] = dp[s + N];
if (s + v[i] <= vmax)
aux[s + N] += dp[s + v[i] + N];
if (s - v[i] >= vmin)
aux[s + N] += dp[s - v[i] + N];
}
for (int s = vmin; s <= vmax; ++s) {
dp[s + N] = aux[s + N];
dp[s + N] %= Mod;
}
}
g << dp[x + N];
return 0;
}