Pagini recente » Cod sursa (job #2097801) | Cod sursa (job #3171604) | Cod sursa (job #2939522) | Cod sursa (job #1171950) | Cod sursa (job #34364)
Cod sursa(job #34364)
#include <stdio.h>
#define max 200000
#define mod 10000
int n, m, s, c[max];
int main()
{
int i, j, k;
freopen("5-diamant.in", "r", stdin);
freopen("5-diamant.out", "w", stdout);
scanf("%d%d%d", &n, &m, &s);
if (s < -100000 || s > 100000)
{
printf("0\n");
return 0;
}
c[0] = 1;
for (i = 1; i <= n; ++i)
for (j = 1; j <= m; ++j)
for (k = max - 1; k >= 0; --k)
if (c[k])
{
c[k + i * j] = (c[k + i * j] + c[k]) % mod;
c[k + 2 * i * j] = (c[k + 2 * i * j] + c[k]) % mod;
}
printf("%d\n", c[s + (n + 1) * n * (m + 1) * m / 4]);
return 0;
}