Pagini recente » Cod sursa (job #810135) | Cod sursa (job #1789045) | Cod sursa (job #298936) | Cod sursa (job #1828757) | Cod sursa (job #2837714)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("1-sir.in");
ofstream fout ("1-sir.out");
const int MOD=194767;
const int NMAX=261;
int n;
int dp[NMAX*NMAX];
void solve()
{
int i,j,s;
dp[0]=1;
for(i=1;i<n;i++)
{
for(j=i*(i-1);j>=0;j--)
{
dp[j+2*i]=(dp[j+2*i]+dp[j])%MOD;
}
}
}
int main()
{
int s;
fin>>n>>s;
if(n*(n+1)/2<s || n*(n+1)/2*(-1)>s)
{
fout<<0;
}
else
{
solve();
fout<<dp[s+n*(n-1)/2];
}
return 0;
}