1 solutions
-
0
C++ :
#include<cstdio> #include<cstring> #define clr(x)memset(x,0,sizeof(x)) long long f[50000]; int main() { long long n,i,j,v; while(scanf("%lld",&n)!=EOF) { if(n==0) break; v=n*(n+1)/2; if(v%2==1) { printf("0\n"); continue; } clr(f); f[0]=1; v/=2; for(i=1;i<=n;i++) for(j=v;j>=i;j--) f[j]+=f[j-i]; printf("%lld\n",f[v]/2); } return 0; }
- 1
Information
- ID
- 18413
- Time
- 1000ms
- Memory
- 128MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By