Pagini recente » Cod sursa (job #2945542) | Cod sursa (job #2082590) | Cod sursa (job #141784) | Cod sursa (job #282277) | Cod sursa (job #320596)
Cod sursa(job #320596)
#include <stdio.h>
#include <string.h>
using namespace std;
int An[8300];
int Bn[8300];
int i,j,n,m,k;
int main()
{
freopen ("diamant.in","r",stdin);
freopen ("diamant.out","w",stdout);
scanf ("%d%d%d",&n,&m,&k);
An[4000]=1;
if (k<4100)
for (i=1;i<=n;i++)
for (j=1;j<=m;j++){
memcpy(Bn,An,sizeof(An));
for (int t=820;t>=0;t--)
{
An[t]=Bn[t-i*j]+Bn[t]+Bn[t+i*j];
An[t]%=100;
}
}
else
k=1;
printf ("%d\n",An[400+k]);
return 0;
}