Pagini recente » Cod sursa (job #616660) | Cod sursa (job #2921545) | Cod sursa (job #1869536) | Cod sursa (job #1278790) | Cod sursa (job #2080189)
#include <cstdio>
using namespace std;
const int NMAX = 150 * 301;
const int MOD = 194767;
int v[3][NMAX];
int ab(int val) {
if(val < 0) {
val = -val;
}
return val;
}
int main() {
int n, s;
freopen("1-sir.in", "r", stdin);
freopen("1-sir.out", "w", stdout);
scanf("%d%d", &n, &s);
v[1][0] = 1;
for(int i = 2; i <= n; ++i) {
for(int j = 0; j <= i * (i - 1) / 2; ++j) {
v[i % 2][j] = (v[(i - 1) % 2][i + j - 1] + v[(i - 1) % 2][ab(i - j - 1)]) % MOD;
}
}
printf("%d\n", v[n % 2][ab(s)]);
return 0;
}