Pagini recente » Cod sursa (job #1666515) | Cod sursa (job #1310743) | Cod sursa (job #2347252) | Cod sursa (job #1758827) | Cod sursa (job #2104993)
#include <cstdio>
#define N 256
#define MOD 194767
int dp[2][N * N + 1];
int abs(int x) {
return (x < 0 ? -x : x);
}
int main() {
freopen("1-sir.in", "r", stdin);
freopen("1-sir.out", "w", stdout);
int n, s, mx, line = 1;
scanf("%d %d", &n, &s);
mx = n * (n + 1) / 2;
if (s > mx || s < -mx) {
printf("0");
return 0;
}
dp[0][0] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 0; j <= mx; j++) {
dp[line][j] = (dp[1 - line][abs(j - (i - 1))] + dp[1 - line][abs(j + (i - 1))]) % MOD;
}
line = 1 - line;
}
printf("%d", dp[1 - line][s]);
return 0;
}