急求编写斐波那契数列前10和数(1,1,2,3,5,8,13,....)

[wanwanman]

急求高手写 ~~多谢!

[doubhor]

下面接口关系描述的对吗？
输入：无
输出：斐波那契数列前面10个数的和

如果是这样的话，是不是函数的输入输出就是固定的了，这样的话：
1 + 1 + 2 + 3 + 5 + 8 + 13 + 21 + 34 + 55 = 143
那么直接return 143 好了

[jixingzhong]

循环， 累加求和即可 ～

也可以用递归 ～

[DonaldKnuth]

给你3个简单的：
1.
#include<iostream>
using namespace std;

int fibonaci(int n)
{
if(n==1 || n==2)
return 1;
return fibonaci(n-1) + fibonaci(n-2);
}

void main(void)
{
for(int i = 1; i <= 10; ++i)
cout<<fibonaci(i)<<" ";
}

2.
#include<iostream>
using namespace std;

void main(void)
{
int a[10];
a[0] = a[1] = 1;

for(int i = 2; i < 10; ++i)
{
a[i] = a[i-1] + a[i-2];
}

for(int i=0 ; i < 10; ++i)
cout<<a[i]<<" ";
}

3.
#include<stdio.h>
void main(void)
{
int a, b, c;
a=b=c=1;
printf(" %d %d ", a, b);
for(int i = 2; i < 10; ++i)
{
b = a;
a = c;
printf(" %d ",c = a + b);
}

}

[jixingzhong]

#include <stdio.h>
#include <stdlib.h>


int main()
{
int x, y, sum;
int i;

x=y=1;
sum = x+y;
printf("sum = %d + %d", x, y);
for(i=3; i<=10; i++)
{
int tmp=x;
x=y;
y = tmp+y;
sum += y;
printf(" + %d", y);
}
printf(" = %d.\n", sum);

system("PAUSE");
return 0;
}

[frogmad]

#include <stdio.h>
#define MAX_NUM 100000 //假设机器能计算的最大Fib(n)

//直接返回Fib(n)
unsigned long Fib (unsigned int n)
{

unsigned long a[2] = {1,1};
if ((n<=0)||(n>MAX_NUM)) return 0;
int i=2;
while (i<n)
{
a[0]+=a[1];
i++;
if (i<n) a[1]+=a[0]; else return a[0];
i++;
}
return a[1];
}

int main()
{
int n,i,sum=0;
printf("Input the N:\n");
scanf("%d",&n);
for ( i = 1; i<= n; i++)
sum+=Fib(i);
printf("%d\n",sum);
getchar();
getchar();
return 0;
}

[mLee79]

酱紫 ...

#include <math.h>
#include <stdio.h>

#define s5 (2.2360679774997898) /* sqrt(5) */
const double p1 = ( 1 + s5 ) / 2 , p2 = ( 1 - s5 ) / 2 , a1 = 1 / s5;

double sumFib( int n )
{
return a1 * (
( 1. - pow( p1 , n + 1 ) ) / p2 -
( 1. - pow( p2 , n + 1 ) ) / p1 );
}

int main()
{
int i;
for( i = 0; i <= 10; ++i )
printf( "--- %d --- : %.10g\n" , i , sumFib(i) );
return 0;
}