Pagini recente » Cod sursa (job #1280008) | Cod sursa (job #737519) | Cod sursa (job #691056) | Cod sursa (job #742843) | Cod sursa (job #2001721)
#include<cstdio>
using namespace std;
const int nmax=305;
const int mod=194767;
int d[2][nmax*nmax];
inline int modul(int a)
{
if(a>=0)
return a;
return -a;
}
int main()
{
freopen("1-sir.in","r",stdin);
freopen("1-sir.out","w",stdout);
int n,i,j,s,maxval;
scanf("%d%d",&n,&s);
maxval=n*(n-1)/2;
d[1][0]=1;
if(s<0)
s*=-1;
for(i=2;i<=n;++i)
{
for(j=0;j<=maxval;++j)
{
d[i&1][j]=d[(i-1)&1][modul(j-i+1)] + d[(i-1)&1][modul(j+i-1)];
if(d[i&1][j]>mod)
d[i&1][j]-=mod;
}
for(j=0;j<=maxval;++j)
d[(i-1)&1][j]=0;
}
printf("%d",d[n&1][s]);
}