Pagini recente » Cod sursa (job #910630) | Cod sursa (job #710515) | Cod sursa (job #2633355) | Cod sursa (job #1413932) | Cod sursa (job #1363456)
#include<cstdio>
int di[320005],d2[320005];
int main()
{
freopen("diamant.in","r",stdin);
freopen("diamant.out","w",stdout);
int n,m,x,i,j,q,l,md;
md=10000;
scanf("%d%d%d",&n,&m,&x);
if(x>=160000)
{
printf("0\n");
}
else
{
di[160000]=1;
x=x+160000;
l=320000;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
for(q=0;q<=l;q++)
if(di[q]>0)
{
d2[q+i*j]=(d2[q+i*j]+di[q])%md;
d2[q-i*j]=(d2[q-i*j]+di[q])%md;
d2[q]=(d2[q]+di[q])%md;
}
for(q=0;q<=l;q++)
{
di[q]=d2[q];
d2[q]=0;
}
}
printf("%d\n",di[x]);
}
return 0;
}