Pagini recente » Cod sursa (job #680076) | Cod sursa (job #2229233) | Cod sursa (job #1326406) | Cod sursa (job #2130356) | Cod sursa (job #752661)
Cod sursa(job #752661)
#include <stdio.h>
FILE *f=fopen("diamant.in","r");
FILE *g=fopen("diamant.out","w");
int a[50000][400];int n,m,k;
void solve();
int main()
{
fscanf(f,"%d %d %d",&n,&m,&k);
if (k<0) k=-k;
if (k<=44100)
{
solve();
fprintf(g,"%d\n",a[k][n*m]);
}
else fprintf(g,"0\n");
fclose(f);fclose(g);
return 0;
}
void solve()
{
a[1][1]=1;
for (int i=2;i<=k;i++)
{
a[i][1]=1;a[i][i]=1;
for (int j=2;j<i && j<=n*m;j++)
for (int k0=1;k0<=i-j && k0<=j;k0++)
a[i][j]+=a[i-j][k0];
}
}