hdu 1001
2013-12-01 23:23
204 查看
//problem 1001 #include <stdio.h> int main(){int sum(int n);int i;while (scanf("%d",&i)!=EOF){printf("%d\n\n",sum(i));}return 1;} int sum(int n){if (n == 1){return 1;}return sum(n - 1)+n;}
感觉上 递归还不是最好的结果,,
很简单的一道题~
相关文章推荐
- HDU--warmup2(1001)
- HDU_1001
- STL之二分查找:hdu 5178 ( BestCoder Round #31 1001 )
- HDU 4981 Goffi and Median(BestCoder Round #6 1001)
- HDU 5793 A Boring Question(推公式+求逆元)——2016 Multi-University Training Contest 6 (1001)
- 2015 多校赛 第一场 1001 (hdu 5288)
- HDU 5651 xiaoxin juju needs help(BestCoder Round #77 (div.1)1001)
- HDU 百度之星(测试赛)1001 - 大搬家
- hdu 1001 Sum Problem
- HDU BestCoder 1001
- hdu 5747 Aaronson (BestCoder Round #84 1001)
- HDU 1001 Sum Problem
- BestCoder10 1001 Revenge of Fibonacci(hdu 5018) 解题报告
- HDu 1001 Sum Problem
- 17 多校 - 2 - 1001 - Is Derek lying? (HDU - 6045)
- hdu 1001 Sum Problem
- HDU 1001【Sum Problem】
- hdu 1001
- poj 1001 && hdu 1063 (java版本)
- 多校第一场 1001 hdu 5288 OO’s Sequence(枚举)