Pagini recente » Cod sursa (job #3037630) | Cod sursa (job #1614051) | Cod sursa (job #1041329) | Cod sursa (job #2489389) | Cod sursa (job #1405030)
#include<cstdio>
const int N=256;
const int MOD=194767;
int d[2][2*N*N+1];
int n,sum;
int main(){
freopen("1-sir.in","r",stdin);
freopen("1-sir.out","w",stdout);
scanf("%d%d",&n,&sum);
int m=n*(n-1)/2;
sum=m-sum;
d[0][0]=1;
d[1][0]=1;
for(int i=1;i<n;i++){
for(int j=0;j<=sum;j++){
d[1][j+i*2]+=d[0][j];
if(d[1][j+i*2]>MOD)
d[1][j+i*2]-=MOD;
}
for(int j=0;j<=sum;j++){
d[0][j]=d[1][j];
if(d[0][j]>=MOD)
d[0][j]-=MOD;
}
}
printf("%d",d[0][sum]);
return 0;
}