Pagini recente » Cod sursa (job #2073371) | Cod sursa (job #1892785) | Cod sursa (job #2341750) | Cod sursa (job #2371884) | Cod sursa (job #1747576)
#include<cstdio>
int v[90000],vec[90000],i,j,n,m,k,vc[401],min,max,cate;
int main ()
{
freopen("diamant.in","r",stdin);
freopen("diamant.out","w",stdout);
scanf("%d%d%d",&n,&m,&k);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
vc[++cate]=i*j;
min=max=45000;
for(j=1;j<=cate;j++)
{
for(i=min;i<=max;i++)
{
if(v[i]>0)
{
vec[i+vc[j]]+=v[i];
vec[i-vc[j]]+=v[i];
if(i+vc[j]>max)
max=i+vc[j];
if(i-vc[j]<min)
min=i-vc[j];
}
}
vec[45000+vc[j]]++;
vec[45000-vc[j]]++;
if(max<45000+vc[j])
max=45000+vc[j];
if(min>45000-vc[j])
min=45000-vc[j];
for(i=min;i<=max;i++)
v[i]=vec[i]%10000;
}
v[45000]++;
if(k>45000||k<-45000)
printf("0");
else
printf("%d",v[45000+k]%10000);
return 0;
}