hdu 2132 An easy problem (递推)
2012-10-15 13:10
363 查看
点击打开链接
wrong: #include"stdio.h" __int64 a[100002],i; int main() { int n; a[1]=1; a[2]=3; for(i=3;i<100002;i++) { if(i%3==0) a[i]=a[i-1]+i*i*i; else a[i]=a[i-1]+i; } while(scanf("%d",&n)!=EOF&&n>0)//这里n>=0,!!!!一定要注意!! printf("%I64d\n",a ); return 0; } AC: #include"stdio.h" __int64 a[100005],i; int main( ) { int n; for(i=1;i<=100000;i++) { if(i%3==0) a[i]=a[i-1]+i*i*i; else a[i]=a[i-1]+i; } while(scanf("%d",&n)&&n>=0) { printf("%I64d\n",a ); } return 0; }
相关文章推荐
- hdu 2132 An easy problem (递推)
- HDU 2132 An easy problem
- hdu 2132 An easy problem
- HDOJ(HDU) 2132 An easy problem
- HDOJ(HDU) 2132 An easy problem
- hdu 2132 An easy problem
- An easy problem HDU 2132
- JAVA hdu 2132 An easy problem
- HDU 2132 An easy problem
- HDU 2132 An easy problem
- hdu 2055 An easy problem
- HDU-2601-An easy problem
- HDU 2055 An easy problem
- HDU 2601 An easy problem
- HDU 5572 An Easy Physics Problem【计算几何】
- hdu 5572 An Easy Physics Problem
- hdu-2055-An easy problem
- hdu - 5475 - An easy problem - (线段树)
- 【线段树】单点更新 hdu 5475 An easy problem
- HDU 2601 An easy problem