Pagini recente » Cod sursa (job #2148864) | Cod sursa (job #1757950) | Cod sursa (job #3155300) | Cod sursa (job #2189829) | Cod sursa (job #1363472)
#include<cstdio>
int di[100005],d2[100005];
int main()
{
freopen("diamant.in","r",stdin);
freopen("diamant.out","w",stdout);
int n,m,i,j,q,l,md,p;
int x,s;
md=10000;
scanf("%d%d%d",&n,&m,&x);
if(x>=50000 || x<=-50000)
{
printf("0\n");
}
else
{
di[50000]=1;
s=50000;
x=x+50000;
l=100000;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
for(q=s;q<=l;q++)
if(di[q]>0)
{
p=i*j;
if(q-p<s)
s=q-p;
d2[q+p]=(d2[q+p]+di[q]);
if(d2[q+p]>=md)
d2[q+p]-=md;
d2[q-p]=(d2[q-p]+di[q]);
if(d2[q-p]>=md)
d2[q-p]-=md;
d2[q]=(d2[q]+di[q]);
if(d2[q]>=md)
d2[q]-=md;
}
for(q=0;q<=l;q++)
{
di[q]=d2[q];
d2[q]=0;
}
}
printf("%d\n",di[x]);
}
return 0;
}