Cod sursa(job #2273423)
Utilizator | Dart Monkey lucametehau | Data | 31 octombrie 2018 15:37:00 |
---|---|---|---|
Problema | 1-sir | Scor | 80 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in ("1-sir.in");
ofstream out ("1-sir.out");
const int MOD = 194767;
int n, s, x;
int dp[2][32641];
int main() {
in >> n >> s;
dp[1][0] = 1;
for(int i = 2; i <= n; i++) {
for(int j = 0; j <= n * (n - 1) / 2; j++)
dp[i % 2][j] = (dp[(i - 1) % 2][abs(j - i + 1)] + dp[(i - 1) % 2][abs(j + i - 1)]) % MOD;
}
out << dp[n % 2][abs(s)];
return 0;
}