费波拉奇数列,相信大家都听过,但就这个小小的程序,如果你把它的数值调大的一点,然后。。。听听大多数CPU疯狂转动的声音,WOW,不知整了多少班上的女同学------每天都跑来找我们,“这怎么回事啊,快帮我解决一下 “ - // 费波拉奇数列:从0和1开始,后续的每个费波拉奇数字都是前两个数字的和
- * Z5 ]4 b/ W' {# v5 R$ D( i6 x
- #include <iostream>/ _1 n6 V) `* P/ n* n( x
- * i `3 ]5 `' A, q\\" @\\" I
- using std::cout;* O _, f5 i5 u* a4 i7 t+ k
- using std::cin;, o! e- d, Y6 o- U3 y
- using std::endl;) L. ]! X\\" N* [
- ( n% l0 e5 w* ]. Z- R+ p
- - l( Z- [- n1 q! v h
- unsigned long fibonacci( unsigned long );
- / N, I1 i6 g& O3 Y
- - F I( d# ?! H8 F' L
- int main( void )& X/ {6 a* p+ ?7 T1 W. D
- {# z4 ]' n% s: {, x8 h* I/ y( H
- unsigned long result, number;
- - Y2 i$ }! w) _/ G3 W% h9 O6 s
- * k T2 v- d# ^, j
- cout << "Enter an integer: ";; z* R\\" | O! ]) [6 h) I
- cin >> number;
- 8 q/ O& Z B- v1 j
- result = fibonacci( number );
- + d+ z9 o' x v1 n
- cout << "Fibonacci( "<< number << " ) = " << result << endl;
- \\" X% J- @5 ^9 B' M5 Z- [$ U. @$ D
- return 0;7 ]1 i V2 f) L) c( W
- }
- 7 v( H6 R5 @, `9 M% h\\" G
- 7 s6 Z- i; O7 U1 C9 s
- unsigned long fibonacci( unsigned long n )$ E# k\\" I+ b8 W, S/ W8 d4 I6 Y; i
- {\\" K( _\\" N# z4 p! y$ B& C
- if ( n == 0 || n == 1 )
- $ X0 b$ J$ V5 b9 ^6 P% M) l' F
- return n;2 P1 q6 Q! p' ], O( c; t
- else! j2 y: s) o4 N0 F2 x4 x
- return fibonacci( n -1 ) + fibonacci( n - 2 );
- 6 b\\" D4 [+ h/ @. e3 c. ~; H! k
- }
- / {+ O/ K. @% f. o. i0 J6 r* C
|