[C How To Program] 习题5.37 x的n次方
2014-12-14 20:31
232 查看
#include <stdio.h> int power( int, unsigned int); int main(){ int base, comp; while(1){ scanf("%d %d", &base, &comp); printf("%d^%d = %d\n", base, comp, power( base, comp )); } } int power( int base, unsigned int comp ){ if(comp == 0) return 1; if(comp == 1) return base; return base * power( base, comp - 1 ); }
相关文章推荐
- [C How To Program] 习题5.39 汉诺塔
- [C How To Program] 习题6.39 递归求数组的最小值
- [C How To Program] 习题6.38 字符串反转打印
- [C How To Program] 习题6.35 二分查找
- [C How To Program] 习题7.17 龟兔赛跑问题
- [C How To Program] 习题 3.36
- [C How To Program] 习题3.38
- [C How To Program] 习题3.46
- [C How To Program] 习题5.22
- 《java how to program》第三版1-6章大部分习题答案[原创]
- [C How To Program] 习题5.28-最大公约数
- [C How To Program] 习题6.24c 骑士漫游问题
- [C How To Program] 习题5.32 学习算术
- [C How To Program] 习题6.30 erato_traverse
- [C How To Program] 习题4.38
- [C How To Program] 习题6.32 递归的选择排序
- 《java how to program》习题全解----正在创作中
- How to compile COBOL program into shared library
- How to think like a Computer Scientist: 课后习题第十四章4
- How to access JIRA in your Python program