Cod sursa(job #2078335)
Utilizator | Fares Mohamad MoodyFares | Data | 29 noiembrie 2017 12:57:52 |
---|---|---|---|
Problema | 1-sir | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <cstdio>
const int MAX_N = 256;
const int MOD = 194767;
int d[1 + MAX_N][1 << 16];
int modul(int x) {
return x >= 0 ? x : -x;
}
int main() {
freopen("1-sir.in", "r", stdin);
freopen("1-sir.out", "w", stdout);
int N, S;
scanf("%d%d", &N, &S);
d[1][0] = 1;
for (int i = 2; i <= N; i++) {
for (int j = 0; j <= i * (i - 1) / 2; j++) {
d[i][j] = (d[i - 1][j + i - 1] + d[i - 1][modul(i - j - 1)]) % MOD;
}
}
printf("%d\n", d[N][modul(S)]);
}