Pagini recente » Cod sursa (job #1324322) | Cod sursa (job #1391538) | Istoria paginii runda/preoji2014_2/clasament | Istoria paginii runda/preoji_11-12/clasament | Cod sursa (job #239273)
Cod sursa(job #239273)
#include <stdio.h>
#include <stdlib.h>
#define MAX_L 300
int n, s, i, j, l;
int d[2][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; l = 0;
for (i = 2; i <= n; i++) {
for (j = 0; j <= 256 * 256; j++)
d[l][abs(j)] = (d[1 - l][abs(j - (i - 1))] + d[1 - l][abs(j + (i - 1))]) % 194767;
l = 1 - l;
}
printf("%d\n", d[1 - l][s]);
return 0;
}