Pagini recente » Cod sursa (job #1038393) | Cod sursa (job #2030070) | Cod sursa (job #983685)
Cod sursa(job #983685)
#include<cstdio>
using namespace std;
int a[100005];
int b[100005];
void adauga(short val)
{
for(int i=val;i<=100000;i++)
b[i]+=a[i-val];
for(int i=0;i<=100000-val;i++)
b[i]+=a[i+val];
for(int i=0;i<=100000;i++)
a[i]=(a[i]+b[i])%10000,b[i]=0;
}
int main()
{
freopen("diamant.in","r",stdin);
freopen("diamant.out","w",stdout);
int w,m,n,i,j;
scanf("%d%d%d",&m,&n,&w);
if(w>44100 || w<-44100) {printf("0\n");return 0;}
a[50000]=1;
for(i=1;i<=m;++i)
for(j=1;j<=n;++j)
adauga(i*j);
printf("%d\n",a[w+50000]);
return 0;
}