Pagini recente » Cod sursa (job #3257374) | Cod sursa (job #984053) | Cod sursa (job #2187139) | Cod sursa (job #1846241) | Cod sursa (job #756287)
Cod sursa(job #756287)
#include <cstdio>
const int maxval = 45000;
const int MAX_N = 100001;
const int MOD = 10000;
int n,m,valoare ;
int v[MAX_N] ;
int sol[MAX_N] ;
int main()
{
freopen("diamant.in","r",stdin);
freopen("diamant.out","w",stdout);
scanf("%d%d%d",&n,&m,&valoare);
int s = 0;
for(int i=1;i<=n;++i)
for(int j=1;j<=m;++j)
s += i*j ;
if(valoare > s || valoare < -s )
{
printf("0\n");
return 0;
}
v[maxval] = 1 ;
for(int i=1;i<=n;++i)
{
for(int j=1;j<=m;++j)
{
for(int k=-s;k<=s;++k)
{
sol[k+maxval] = v[k+i*j+maxval] + v[k+maxval] + v[k-i*j+maxval] ;
sol[k+maxval] %= MOD ;
}
for(int k=-s;k<=s;++k)
v[k+maxval] = sol[k+maxval] ;
}
}
printf("%d\n",v[valoare+maxval]);
return 0;
}