Pagini recente » Borderou de evaluare (job #1621846) | Borderou de evaluare (job #2611757) | Borderou de evaluare (job #2002200) | Borderou de evaluare (job #1371418) | Cod sursa (job #848062)
Cod sursa(job #848062)
#include<cstdio>
using namespace std;
int p,surp,n,m,i,j,s,x,v[100009],cop[100009];
int main()
{
freopen("diamant.in","r",stdin);
freopen("diamant.out","w",stdout);
scanf("%d",&n);
scanf("%d",&m);
scanf("%d",&x);
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
s=s+i*j;
if(s<x||-s>x)
{
printf("0\n");
return 0;
}
surp=s;
v[surp]=1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
for(p=0;p<=2*s;p++)
cop[p]=v[p];
for(p=i*j;p<=2*s+x;p++)
{
v[p-i*j]+=v[p];
if(v[p-i*j]>=10000) v[p-i*j]-=10000;
}
for(p=2*s-i*j;p>=0;p--)
{
v[p+i*j]+=cop[p];
if(v[p+i*j]>=10000) v[p+i*j]-=10000;
}
}
printf("%d\n",v[surp+x]);
return 0;
}