Cod sursa(job #239264)
| Utilizator | Data | 4 ianuarie 2009 15:01:27 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <stdio.h>
#include <stdlib.h>
#define MAX_L 300
int n, s, i, j;
int d[MAX_L][MAX_L * MAX_L];
int main() {
freopen("1-sir.in", "r", stdin);
freopen("1-sir.out", "w", stdout);
scanf("%d %d", &n, &s);
d[1][0] = 1;
for (i = 2; i <= n; i++)
for (j = 0; j <= 256 * 256; j++)
d[i][j] = d[i - 1][abs(j - (i - 1))] + d[i - 1][abs(j + (i - 1))];
printf("%d\n", d[n][s]);
return 0;
}
