Pagini recente » Cod sursa (job #2839265) | Cod sursa (job #2095635) | Cod sursa (job #2271498) | Cod sursa (job #1264838) | Cod sursa (job #2102857)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("1-sir.in");
ofstream fout("1-sir.out");
const int mod=194767;
int dp[200000];
int n, s;
int main()
{
fin>>n>>s;
int nr=n*(n-1)/2;
if(s>nr || s<-nr)
{
fout<<"0\n";
return 0;
}
dp[nr+100000]=1;
for(int i=2; i<=n; ++i)
{
for(int j=-nr; j<=nr; ++j)
{
dp[j+100000]=(dp[j+100000]+dp[j+2*(n-i+1)+100000])%mod;
}
}
fout<<dp[s+100000]<<"\n";
return 0;
}