Pagini recente » Cod sursa (job #816166) | Cod sursa (job #1868535) | Cod sursa (job #1721449) | Cod sursa (job #949910) | Cod sursa (job #964574)
Cod sursa(job #964574)
#include<fstream>
#include<cstdlib>
#define MOD 194767
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int n,i,p,s,j,smax,a[2][60000];
inline int abs(int x)
{
if(x>0)
return x;
return -x;
}
int main()
{
f>>n>>s;
int sol;
s=abs(s);
smax=n*(n-1)/2;
if(smax<s)
{
g<<0<<'\n';
return 0;
}
a[1][0]=1;
p=1;
for(i=2;i<=n;p=p^1,++i)
{
for(j=0;j<=smax;++j)
{
a[p^1][j]=(a[p][j+i-1]+a[p][abs(j-i+1)])%MOD;
if(a[p^1][j]>=MOD)
a[p^1][j]-=MOD;
}
}
g<<a[p][s]<<'\n';
return 0;
}