Pagini recente » Cod sursa (job #1838643) | Cod sursa (job #2816764) | Cod sursa (job #3219787) | Cod sursa (job #2651591) | Cod sursa (job #2497546)
#include <bits/stdc++.h>
#define mod 10000
using namespace std;
ifstream fin("diamant.in");
ofstream fout("diamant.out");
int x, n, m, a[150000], b[150000];
int main()
{
fin >> n >> m >> x;
a[44000] = 1;
if(x <= 44000)
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
{
memcpy(b, a, sizeof(a));
for(int k = 88000; k >= 0; k--)
{
a[k] = b[k-i*j] + b[k] + b[k+i*j];
a[k]%=mod;
}
}
fout << a[44000+x];
}