Pagini recente » Cod sursa (job #1066700) | Cod sursa (job #1808902) | Cod sursa (job #978172) | Cod sursa (job #1451165) | Cod sursa (job #829407)
Cod sursa(job #829407)
#include<fstream>
#define MOD 194767
using namespace std;
ifstream f("1-sir.in");
ofstream g("1-sir.out");
int n,i,p,s,j,smax,a[3][50000];
int abs(int x)
{
if(x>0)
return x;
return -x;
}
int main()
{
f>>n>>s;
smax=n*(n-1);
if(smax<s)
{
g<<0<<'\n';
return 0;
}
a[0][0]=1;
p=1;
for(i=2;i<=n;p=p^1,++i)
for(j=0;j<=smax;++j)
{
a[p][j]=a[p^1][j+i-1]+a[p^1][abs(j-i+1)];
if(a[p][j]>=MOD)
a[p][j]-=MOD;
}
g<<a[(n%2)^1][s]<<'\n';
return 0;
}