Pagini recente » Cod sursa (job #2157235) | Cod sursa (job #1266952) | Cod sursa (job #972099) | Cod sursa (job #821242) | Cod sursa (job #983335)
Cod sursa(job #983335)
#include<cstdio>
const int MOD=194767;
int d[2][65540];
inline int abs(int x) {return x>0?x:-x;}
int main()
{
freopen("1-sir.in","r",stdin);
freopen("1-sir.out","w",stdout);
int n,S,s;
scanf("%d%d",&n,&s);
S=n*(n-1)/2;
if(s>S)
{
printf("0\n");
return 0;
}
d[1][0]=1;
for(int i=2,l=0;i<=n;i++,l=1-l)
for(int j=0;j<=S;j++)
d[l][j]=(d[1-l][j+i-1]+d[1-l][abs(j-i+1)])%MOD;
printf("%d\n",d[n&1][s]);
return 0;
}