![](https://img-blog.csdnimg.cn/20201014180756919.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
自学
子幻先生
身无长物,却又心比天高;
眼高手低,毫无自知之明。
展开
-
C Primer Plus 9.11 第11题(用循环代替递归计算斐波那契数列)
int main(void) { int n; int Fi_num; while (scanf("%d", &n)==1) printf("%d\n", Fibonacci(n)); return 0; } int Fibonacci(int n) { int num; int n1 = 1, n2 = 1; int n3; if (n>2) for (s...原创 2020-02-22 19:01:53 · 210 阅读 · 0 评论 -
C Primer Plus 9.11第八题(可计算次方幂不为整数时结果)
#include<stdio.h> double power(double ,double ); double pow_num(double, double); int main(void) { double x, y, ans; while ((scanf("%lf %lf",&x,&y))==2) { ans = power(x, y); printf...原创 2020-02-22 16:52:06 · 122 阅读 · 0 评论 -
C Primer Plus 9.11编程练习第九题
C Primer Plus 9.11编程练习第九题 #include<stdio.h> double power(int ,int ); int main(void) { int x, y; while ((scanf("%d %d",&x,&y))==2) printf("%lf\n", power(x, y)); return 0; } double po...原创 2020-02-22 16:46:59 · 175 阅读 · 0 评论