Pagini recente » Cod sursa (job #337459) | Cod sursa (job #2570627) | Cod sursa (job #1429679) | Cod sursa (job #2462645) | Cod sursa (job #425833)
Cod sursa(job #425833)
#include <stdio.h>
#include <string.h>
#define IN "diamant.in"
#define OUT "diamant.out"
using namespace std;
int An[83000];
int Bn[83000];
int n,m,k;
int main()
{
freopen (IN ,"r",stdin);
freopen (OUT,"w",stdout);
scanf ("%d%d%d",&n,&m,&k);
An[40000]=1;
if (k<41000)
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++){
memcpy(Bn,An,sizeof(An));
for (int t=82000;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[40000+k]);
return 0;
}