Pagini recente » Cod sursa (job #870823) | Cod sursa (job #2917670) | Cod sursa (job #2249518) | Cod sursa (job #880652) | Cod sursa (job #1090648)
#include<cstdio>
#include<cstdlib>
#define NMAX 100007
#define mod 10000
#define mid 50000
using namespace std;
int n,m,x,sum,a[NMAX],b[NMAX];
int main()
{
int n,m,i,j,x,val,k;
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)
sum+=i*j;
a[mid]=1;
if (x>sum)
{
printf("0");
return 0;
}
for(i=1;i<=n;++i)
for(j=1;j<=m;++j)
{
val=i*j;
for(k=-abs(sum);k<=abs(sum);++k)
b[mid+k]=(a[mid+k]+a[mid+k-val]+a[mid+k+val])%mod;
for(k=-abs(sum);k<=abs(sum);++k)
a[mid+k]=b[mid+k];
}
printf("%d",a[mid+x]);
return 0;
}