Pagini recente » Cod sursa (job #377585) | Cod sursa (job #1899524) | Cod sursa (job #1197844) | Cod sursa (job #1729071) | Cod sursa (job #293489)
Cod sursa(job #293489)
#include <cstdio>
#include <cstring>
#include <ctime>
using namespace std;
int An[1<<20];
int Bn[1<<20];
int i,j,n,m,k;
int main()
{
long t1=clock();
freopen ("diamant.in","r",stdin);
freopen ("diamant.out","w",stdout);
scanf ("%d%d%d",&n,&m,&k);
An[50000]=1;
if (k<50000)
for (i=1;i<=n;i++)
for (j=1;j<=m;j++){
memcpy(Bn,An,sizeof(An));
for (int t=100000;t>=0;t--)
{
An[t]=Bn[t-i*j]+Bn[t]+Bn[t+i*j];
An[t]%=10000;
}
}
else
k=1;
printf ("%d\n",An[50000+k]);
return 0;
}