Pagini recente » Cod sursa (job #2685761) | Cod sursa (job #1387032) | Cod sursa (job #133890) | Cod sursa (job #1130893) | Cod sursa (job #1992263)
#include <bits/stdc++.h>
#define vm 50000
#define nm 21
#define MOD 10000
using namespace std;
ifstream f("diamant.in");
ofstream g("diamant.out");
int n,m,val,s,a[nm*nm],d[2][vm*2],nr;
int main()
{
int i,j,k;
f>>n>>m>>val;
if(abs(val)>vm)
{
fout<<0;
fout.close();
return 0;
}
d[0][vm]=1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
a[++nr]=i*j;
for(i=1;i<=nr;i++)
{
s+=a[i];
for(j=vm-s;j<=vm+s;j++)
{
k=(i+1)%2;
d[i%2][j]=(d[k][j]+d[k][j-a[i]]+d[k][j+a[i]])%MOD;
}
}
g<<d[nr%2][val+vm];
return 0;
}