//首先,1,1,2,3,5,8,13,21……是Fibonacci數列。
程式:
/*************************************************************************
> File Name: 5_t10.c
> Author: Crow
> Mail: [email protected]
> Created Time: Wed 19 Dec 2018 01:45:09 PM CST
************************************************************************/
#include <stdio.h>
int main()
{
double ss=0,a1=1.0,a2=2.0;
for(int i=1;i<=10;i++)
{
ss=ss+a2/a1;
a1=a1+a2;
ss=ss+a1/a2;
a2=a2+a1;
}
printf("%g\n",ss);
return 0;
}