Pagini recente » Cod sursa (job #221193) | Cod sursa (job #2170088) | Cod sursa (job #1114419) | Cod sursa (job #1605398) | Cod sursa (job #2273425)
#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, i, j;
int dp[2][32641];
int main() {
in >> n >> s;
dp[1][0] = 1;
for(i = 2; i <= n; i++) {
for(j = 0; j <= n * (n - 1) / 2; j++)
dp[i % 2][j] = (dp[(i - 1) % 2][abs(j - i + 1)] + dp[(i - 1) % 2][j + i - 1]) % MOD;
}
out << dp[n % 2][abs(s)];
return 0;
}