Pagini recente » Cod sursa (job #2249524) | Cod sursa (job #1920760) | Cod sursa (job #1112648) | Cod sursa (job #613655) | Cod sursa (job #519731)
Cod sursa(job #519731)
#include<stdio.h>
#define MOD 10000
int n,m,s,sol;
int p[45005],q[45005];
int main ()
{
int i,j,k;
freopen("diamant.in","r",stdin);
freopen("diamant.out","w",stdout);
scanf("%d%d%d",&n,&m,&s);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
sol+=i*j;
if(s>sol || s<-sol)
{
printf("0\n");
return 0;
}
q[0]=q[1]=1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
if(i==1 && j==1)
continue;
for(k=0;k<=sol;k++)
p[k]=q[k];
for(k=0;k<=sol;k++)
q[k]=(p[k]+q[k+i*j]+(i*j<=k ? p[k-i*j] : p[i*j-k]))%MOD;
}
if(s<0)
printf("%d\n",q[-s]);
else
printf("%d\n",q[s]);
return 0;
}