Pagini recente » Cod sursa (job #2460096) | Cod sursa (job #2259575) | Cod sursa (job #2815577) | Cod sursa (job #2326346) | Cod sursa (job #805684)
Cod sursa(job #805684)
#include<stdio.h>
int v[407];
int sol[1000000];
int main()
{
int n,m,k,mod=10000,i,j,x;
freopen("diamant.in","r",stdin);
freopen("diamant.out","w",stdout);
scanf("%d %d %d",&n,&m,&x);
for (i=1;i<=n;++i)
for(j=1;j<=m;++j)
v[++v[0]]=i*j;
sol[0]=1;
for (i=1;i<=v[0];++i)
for (j=x;j>=0;--j)
if (sol[j]!=0)
sol[j+v[i]]=(1+sol[j])%mod;
printf("%d",sol[x]-1);
}