Pagini recente » Rating Iarina-Maria Basa (iarinabasa1) | Cod sursa (job #826066) | Cod sursa (job #1645703) | Cod sursa (job #201267) | Cod sursa (job #282439)
Cod sursa(job #282439)
#include<stdio.h>
#include<stdlib.h>
int n;
int i;
int vs;
int no[100000];
int j;
int max;
int k;
int mij;
int m;
int x;
int main()
{
freopen("diamant.in","r",stdin);
freopen("diamant.out","w",stdout);
scanf("%d %d %d",&n, &m, &x);
mij = 50000;
for(i = 1; i <= n; i++)
for(j = 1; j <= m; j++)
max += i * j;
if (abs(x) > max)
{
printf("0\n");
return 0;
}
no[mij] = 1;
for(i = 1; i <= n; i++)
for(j = 1; j <= m; j++)
{
int val = i * j;
for(k = 100000; k >=0; k--)
if (no[k])
no[k+val] += no[k];
no[mij + val] = 1;
no[mij - val] = 1;
}
printf("%d", no[mij+x]);
return 0;
}