Pagini recente » Cod sursa (job #3345560) | Monitorul de evaluare | Borderou de evaluare (job #3331217) | Cod sursa (job #3324607) | Cod sursa (job #3315489)
#include <bits/stdc++.h>
#define ll long long
#pragma GCC optimize("O3")
#define pb push_back
#define MOD 194767
using namespace std;
signed main(){
ifstream cin ("1-sir.in");
ofstream cout ("1-sir.out");
int n, k;cin >> n >> k;
vector <int> dp(67000,0);
dp[0]=1;
for(int i=1;i < n;i++){
for(int j=66999;j - ((n - i) * 2) >= 0;j--){
dp[j]=(dp[j] + dp[j - ((n - i) * 2)] + MOD) % MOD;
}
}
if(abs(k) < 32896)cout << dp[k + n * (n - 1LL) / 2] % MOD;
else cout << "0";
return 0;
}