Cod sursa(job #1405026)
| Utilizator | Data | 28 martie 2015 19:29:39 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#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];
for(int j=0;j<=sum;j++)
d[0][j]=d[1][j];
}
printf("%d",d[0][sum]);
return 0;
}
