Pagini recente » Cod sursa (job #1623389) | Cod sursa (job #1522759) | Cod sursa (job #686978) | Cod sursa (job #162818)
Cod sursa(job #162818)
#include <stdio.h>
#include <string.h>
#define MOD 10000
int N, M, K;
int ant[100010];
int cur[100010];
int main()
{
int i, j, q, w, k;
freopen("diamant.in", "r", stdin);
freopen("diamant.out", "w", stdout);
int off = 50000;
scanf("%d %d %d", &N, &M, &K);
if (K > off || -K > off) {
printf("0\n");
return 0;
}
ant[off] = 1;
q = 0;
for (i = 1; i <= N; i++)
for (j = 1; j <= M; j++) {
q += i * j; w = i * j;
for (k = off - q; k <= off + q; k++) {
cur[k] = ant[k - w] + ant[k + w] + ant[k];
while (cur[k] >= MOD) cur[k] -= MOD;
}
memcpy(ant, cur, sizeof(ant));
}
printf("%d\n", cur[off + K]);
return 0;
}