Cod sursa(job #303413)
Utilizator | Tudorica Constantin Alexandru tudalex | Data | 9 aprilie 2009 20:28:37 |
---|---|---|---|
Problema | Diamant | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <stdio.h>
#include <string.h>
const int base = 10000;
int a[100000],
b[100000];
int n, m, i, j, t, x;
int main()
{
freopen("diamant.in","r",stdin);
freopen("diamant.out","w",stdout);
scanf("%d %d %d", &n, &m, &x);
a[50000] = 1;
for (i = 1; i<= n; ++ i)
for (j = 1; j <= m; ++ j)
{
int p = i*j;
memcpy(b,a,sizeof(a));
for (t = 1000; t <= 99000; ++ t)
a[t] = (b[t] + b[t-p] + b[t+p])%base;
}
printf("%d", a[50000+x]);
return 0;
}