Pagini recente » Cod sursa (job #2747191) | Cod sursa (job #2517409) | Cod sursa (job #1512351) | Cod sursa (job #2464570) | Cod sursa (job #425823)
Cod sursa(job #425823)
#include <stdio.h>
#include <string.h>
#define IN "diamant.in"
#define OUT "diamant.out"
#define Mod 10000
using namespace std;
int An[82001];
int Bn[82001];
int i,j,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 (i=1;i<=n;i++)
for (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]%=Mod;
}
}
else
k=1;
printf ("%d\n",An[40000+k]);
return 0;
}