费波拉奇数列,相信大家都听过,但就这个小小的程序,如果你把它的数值调大的一点,然后。。。听听大多数CPU疯狂转动的声音,WOW,不知整了多少班上的女同学------每天都跑来找我们,“这怎么回事啊,快帮我解决一下 “ - // 费波拉奇数列:从0和1开始,后续的每个费波拉奇数字都是前两个数字的和
- 8 o% z) p# `- G
- #include <iostream>
- & [ w6 n& C1 h4 r) g; r/ H( _
- 3 h# }% C( ~# t: a
- using std::cout;
- 5 y. m+ |# s# Y\\" U
- using std::cin;7 O3 S: F/ A- _9 f0 B
- using std::endl;
- $ I$ O& f3 w4 ^2 N0 g7 b
- . I) x1 ]# G1 |& T. h2 Z, K
- n$ x: Y2 @) i
- unsigned long fibonacci( unsigned long );
- 3 \) `7 x. j; L' s t( X
- + M9 {$ ~* V6 p6 N
- int main( void )* k$ Q4 m4 W\\" F6 o0 p# J
- {
- 4 E1 F! p. d. O5 d
- unsigned long result, number;
- * [& F* ^: u+ L4 u5 k; t
- . n0 E/ A4 D) Q, Y, ]
- cout << "Enter an integer: ";
- 8 Y A: ~( ` ?
- cin >> number;9 F; u% Q7 |& E5 w! n6 v* c; Z
- result = fibonacci( number );
- 7 F% u3 g9 `! S3 a }* u
- cout << "Fibonacci( "<< number << " ) = " << result << endl;% r( R3 s q6 @0 O/ g! \
- return 0;' U/ R S6 C4 ]7 _1 w
- }
- ' U, o8 y, P\\" Y# j4 D! L
- g; n* f; ^9 j+ `
- unsigned long fibonacci( unsigned long n )) o: m! k9 V) S2 y4 F! `8 Y! @* ^% B; D
- {
- / X1 o I' {* U+ p [) s
- if ( n == 0 || n == 1 )
- , Y) P* {$ r# L. N
- return n;
- , m& {2 w' A1 J
- else' a- w9 S; U+ m( h
- return fibonacci( n -1 ) + fibonacci( n - 2 );, o( f m1 w# G3 N
- }; U7 e9 G: q; I/ N4 A; Z
|