Pagini recente » Cod sursa (job #763206) | Cod sursa (job #960940) | Cod sursa (job #1696705) | Cod sursa (job #1277514) | Cod sursa (job #2012928)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("diamant.in");
ofstream fout("diamant.out");
int n, m, x, i, j, k, g, a, b, c, e, f, d, h, sum, mj;
int v[100000], V[100000];
int main () {
fin >> n >> m >> x;
mj = 50000;
v[mj] = V[mj] = 1;
for (a = 1; a <= n; a++)
for (b = 1; b <= m; b++)
{
d = a*b;
for (i = mj-sum; i <= mj+sum; i++)
if (v[i] != 0)
{ V[i-d] += v[i]; V[i+d] += v[i]; }
sum += d;
for (i = mj-sum; i <= mj+sum; i++)
{ v[i] = V[i] % 10000; }
}
if (x > 45000 || x < -45000) fout << 0 << "\n";
else fout << v[mj + x] % 10000<< "\n";
}