Pagini recente » Cod sursa (job #697598) | Cod sursa (job #639949) | Cod sursa (job #1154770) | Cod sursa (job #2638091) | Cod sursa (job #2589769)
#include <bits/stdc++.h>
#define PLEC fin.close(); fout.close(); return 0;
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
const int mod(194767);
int dp[33000], n, s, p, cat;
int main()
{
fin >> n >> s;
p = (n * (n - 1)) / 2;
if (abs(s) > p || abs(s) % 2 != p % 2) {
fout << 0;
PLEC
}
cat = (p - s) / 2;
dp[0] = 1;
for (int i = 1; i < n; ++i)
for (int j = cat - i; j >= 0; --j)
if (dp[j]) {
dp[i + j] += dp[j];
if (dp[i + j] > mod)
dp[i + j] -= mod;
}
fout << dp[cat];
PLEC
}