Pagini recente » Cod sursa (job #1888855) | Cod sursa (job #1678641) | Cod sursa (job #1990004) | Cod sursa (job #1189576) | Cod sursa (job #993149)
Cod sursa(job #993149)
#include<cstdio>
using namespace std;
short a[90005];
short b[90005];
void adauga(short val)
{
for(int i=val;i<=90000;i++)
b[i]+=a[i-val];
for(int i=0;i<=90000-val;i++)
b[i]+=a[i+val];
for(int i=0;i<=90000;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;short m,n;
scanf("%hd%hd%d",&m,&n,&w);
if(w>44100 || w<-44100) {printf("0\n");return 0;}
a[45000]=1;
for(int i=1;i<=m;++i)
for(int j=1;j<=n;++j)
adauga(i*j);
printf("%hd\n",a[w+45000]);
return 0;
}