费波拉奇数列,相信大家都听过,但就这个小小的程序,如果你把它的数值调大的一点,然后。。。听听大多数CPU疯狂转动的声音,WOW,不知整了多少班上的女同学------每天都跑来找我们,“这怎么回事啊,快帮我解决一下 “ - // 费波拉奇数列:从0和1开始,后续的每个费波拉奇数字都是前两个数字的和3 {( Z( ~3 k3 k$ X) { y6 z7 n; K. i
- #include <iostream>
- : j. v$ W, k4 d( K
- ! X& X' J8 l) N9 ?
- using std::cout;4 S& s; D: v- \4 E* S x
- using std::cin;, ?& [0 U* P: A8 p v- ]0 Q5 b+ g8 }
- using std::endl;\\" h* ?, t% ^5 k3 e, t6 r
- _& y. ]; N& m8 F
- * M# l, H. j! B# H' F( L
- unsigned long fibonacci( unsigned long );3 l/ O; ~\\" N- {% c! c; V9 ^& I
- ( G4 Y& D- L; M
- int main( void )& [# S _4 y4 J\\" o. m) ]
- {3 P) H O z5 z: j7 e& c
- unsigned long result, number;
- 7 ]4 W# D7 o3 C7 K+ c/ E
- # D4 ]* z# |( c+ V0 `
- cout << "Enter an integer: ";
- $ e8 V0 y\\" z- ^
- cin >> number;
- % U, x+ a$ ^& A\\" a% R6 Q9 v2 [
- result = fibonacci( number );& f5 Q4 A2 o5 U! P( z) K
- cout << "Fibonacci( "<< number << " ) = " << result << endl;
- \\" C% ^4 U8 M2 f7 _! ~\\" }8 D
- return 0;/ b/ z$ [+ k5 n0 H+ i0 |& Q% ?
- }; H- y! J% M$ L1 p8 a6 |
- \\" \2 u& j8 v5 I\\" t
- unsigned long fibonacci( unsigned long n )
- 8 {: o5 @3 x, w5 \2 }
- {
- - x* R/ B; m& Z\\" _. h
- if ( n == 0 || n == 1 )
- + \; N$ t4 w v\\" J
- return n;3 p& q m J7 W( b) _
- else
- \\" U/ x8 i6 } v4 I) `& b. _3 \
- return fibonacci( n -1 ) + fibonacci( n - 2 );$ s6 y- Y8 \0 i8 x
- }
- ; C; d) {4 K0 b5 s: ?
|