Pagini recente » Cod sursa (job #2714579) | Cod sursa (job #1231207) | Cod sursa (job #1139551) | Cod sursa (job #2698439) | Cod sursa (job #1621078)
#include <iostream>
#include <cstdio>
#define MAXN 260
#define MOD 194767
using namespace std;
int din[MAXN*MAXN], n, s;
void solve()
{
int maxs = (n-1)*n/2;
if (s > maxs) {
printf("0\n");
return;
}
int exp = maxs - s;
din[0] = 1;
for (int i = 1; i < n; i++) {
int val = i<<1;
for (int j = exp-val; j >= 0; j--)
din[j+val] = (din[j+val] + din[j]) % MOD;
}
printf("%d\n", din[exp]);
}
int main()
{
freopen("1-sir.in", "r", stdin);
freopen("1-sir.out", "w", stdout);
scanf("%d %d", &n, &s);
solve();
return 0;
}