Pagini recente » Cod sursa (job #2169093) | Cod sursa (job #1564105) | Cod sursa (job #517295) | Cod sursa (job #3278207) | Cod sursa (job #846017)
Cod sursa(job #846017)
#include<cstdio>
#define XMAX 60000+20
int i,j,n,m,x,k,An[2][XMAX],Ap[2][XMAX],s;
bool p;
#define A(p,i) (((i)<0)?(An[(p)][-(i)]):(Ap[(p)][(i)]))
using namespace std;
int main()
{
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++)
s+=i*j;
if(x>s || x<-s) {printf("0\n"); return 0;}
A(0,0)=1;
for(i=1,p=1;i<=n;i++)
for(j=1;j<=m;j++,p=!p)
{
for(k=s;k>=-s;k--)
{
A(p,k)=A(!p,k-i*j)+A(!p,k)+A(!p,k+i*j);
A(p,k)%=10000;
}
}
printf("%d\n",A(!p,x));
return 0;
}