Pagini recente » Cod sursa (job #1674315) | Cod sursa (job #2715289) | Cod sursa (job #706682) | Cod sursa (job #1212954) | Cod sursa (job #2589687)
#include <fstream>
#define MAXX 35000
#define MOD 194767
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
typedef long long ll;
int ok[MAXX], dp[MAXX];
int main()
{
ll n, s;
fin >> n >> s;
ll lim = ((n - 1) * n) / 2;
if(s < -lim || s > lim){
fout << 0 << '\n';
return 0;
}
if((lim - s) % 2){
fout << 0 << '\n';
return 0;
}
int cM = (lim - s) / 2;
ok[0] = dp[0] = 1;
for(int i = 1; i < n; ++i)
for(int j = cM - i; j >= 0; --j)
if(ok[j])
dp[i + j] = (dp[i + j] + dp[j]) % MOD, ok[i + j] = 1;
fout << dp[cM] << '\n';
return 0;
}