Cod sursa(job #1405013)
| Utilizator | Data | 28 martie 2015 19:19:41 | |
|---|---|---|---|
| Problema | 1-sir | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include<cstdio>
const int N=256;
int d[2][N*N+1];
int abs(int x){
if(x>0)
return x;
return-x;
}
int main(){
freopen("1-sir.in","r",stdin);
freopen("1-sir.out","w",stdout);
int n,sum;
scanf("%d%d",&n,&sum);
int m=n*(n-1)/2;
d[0][m]=1;
for(int i=1;i<n;i++){
for(int j=0;j<=2*m;j++){
if(j+i<=2*m)
d[1][j+i]+=d[0][j];
if(j-i>=0)
d[1][j-i]+=d[0][j];
}
for(int j=0;j<=2*m;j++){
d[0][j]=d[1][j];
d[1][j]=0;
}
}
printf("%d",d[0][sum+m]);
return 0;
}
