Pagini recente » Cod sursa (job #2944510) | Cod sursa (job #605981) | Cod sursa (job #3267412) | Cod sursa (job #3139022) | Cod sursa (job #2139389)
#include <cstdio>
using namespace std;
#define MOD 194767
int N, S;
int dp[2][256 * 256];
int smax;
int absx(int x) {
return x < 0 ? -x : x;
}
void dinamica() {
dp[0][0] = 1;
int line = 1;
for (int i = 2; i <= N; i++) {
for (int j = 0; j <= smax; j++) {
dp[line][j] = (dp[line ^ 1][absx(j - i + 1)] + dp[line ^ 1][absx(j + i - 1)]) % MOD;
printf("%d ", dp[line][j]);
}
line ^= 1;
}
printf("%d", dp[line ^ 1][S]);
}
int main() {
freopen("1-sir.in", "r", stdin);
freopen("1-sir.out", "w", stdout);
scanf("%d %d ", &N, &S);
smax = N * (N + 1) / 2;
if (S > smax || S < -smax) {
printf("0");
return 0;
}
dinamica();
return 0;
}