Pagini recente » Cod sursa (job #594219) | Cod sursa (job #1926854) | Cod sursa (job #412128) | Cod sursa (job #919118) | Cod sursa (job #2447211)
#include <bits/stdc++.h>
using namespace std;
ifstream in("diamant.in");
ofstream out("diamant.out");
int v[2][160005];
int main()
{
int n, m, k, s = 1, r = 0;
in >> n >> m >> k;
v[0][0] = v[0][1] = 1;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++)
{
if(i == 1 && j == 1)
continue;
s += i * j;
for(int h = 0; h <= s; h++)
v[r % 2][h] = ((v[(r + 1) % 2][h + i * j] + v[(r + 1) % 2][abs(h - i * j)]) % 10000 + v[(r + 1) % 2][h]) % 10000;
r++;
}
}
k = abs(k);
out << v[(r + 1) % 2][abs(k)] % 10000;
return 0;
}