Pagini recente » Cod sursa (job #851729) | Cod sursa (job #2469088) | Cod sursa (job #346145) | Cod sursa (job #1909337) | Cod sursa (job #829757)
Cod sursa(job #829757)
#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];
/*int abs(int x)
{
if(x>0)
return x;
return -x;
}*/
int main()
{
f>>n>>s;
f.close();
int sol;
smax=n*(n-1);
if(smax<abs(s))
{
sol=0;
}
else
{
a[0][0]=1;
p=1;
for(i=2;i<=n;p=p^1,++i)
{
smax=s+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;
}
}
if(n%2)
sol=a[0][s];
else
sol=a[1][s];
}
g<<sol<<'\n';
return 0;
}