【转】写个程序:)让女同学靠近你

wangzheng3056

费波拉奇数列，相信大家都听过，但就这个小小的程序，如果你把它的数值调大的一点,然后。。。听听大多数CPU疯狂转动的声音，WOW，不知整了多少班上的女同学------每天都跑来找我们，“这怎么回事啊，快帮我解决一下“

2. // 费波拉奇数列：从0和1开始，后续的每个费波拉奇数字都是前两个数字的和8 E3 L9 N/ l# ]7 a. ?9 W
   
4. #include <iostream>* p: K9 O0 R8 l' m3 T; U. w
   
6. + X; S; {\\" ~6 i# q9 L: ?% D0 V
   
8. using std::cout;7 F( m. a9 v6 j6 p
   
10. using std::cin;0 q+ A+ c& C7 L2 x. P  L, z3 ]
    
12. using std::endl;0 b2 F4 o  w* j9 }
    
14. 
    
15. 3 Z0 M6 g4 e6 t( r9 @+ d& H
16. 
    
17. 5 H' Y3 X3 }  w: @
18. unsigned long fibonacci( unsigned long );
    
19. 6 Y$ L- J8 `) A( N7 ~5 n2 e
20. 1 Q( a5 |\\" Z7 y# p6 T4 m
    
22. int main( void )6 j4 L0 \; y' s
    
24. {1 a3 q) P\\" X' U! n6 e
    
26.   unsigned long result, number;
    
27. : a$ E+ [3 T\\" P8 h
28. 
    
29. ! j4 v\\" s& b' p0 n! N
30.   cout << "Enter an integer: ";
    
31. * K6 k7 T/ B& K# j7 ^3 ~( @% L
32.   cin  >> number;
    
33. ! K; U7 M% V  g) x4 r
34.   result = fibonacci( number );
    
35. * }# |, G2 k1 ?; O, P, l# t
36.   cout << "Fibonacci( "<< number << " ) = " << result << endl;+ T% \1 P! g6 E( V% y1 J
    
38.   return 0;; S6 _* a4 P8 w6 |* B' J
    
40. }4 `' `0 k0 u; B4 f
    
42. 
    
43. - m( q+ n# u  H. c4 D! G
44. unsigned long fibonacci( unsigned long n )% D- v7 q9 d& {4 V
    
46. {
    
47. + P1 g6 N7 Q* a  i& ]; k+ X
48.   if ( n == 0 || n == 1 )\\" O+ \6 {2 k- Z% d
    
50.     return n;
    
51. \\" _5 ?; Z  p+ z4 P
52.   else. f$ n/ w\\" P7 \# R\\" \
    
54.     return fibonacci( n -1 ) + fibonacci( n - 2 );
    
55. ' C4 u# r\\" H, z5 d
56. }
    
57. ( F+ R) Y; Q2 G/ C% A9 P6 z

// 费波拉奇数列：从0和1开始，后续的每个费波拉奇数字都是前两个数字的和<font class=\\"jammer\\">8 E3 L9 N/ l# ]7 a. ?9 W</font><br /> #include <iostream><font class=\\"jammer\\">* p: K9 O0 R8 l' m3 T; U. w</font><br /> <font class=\\"jammer\\">+ X; S; {\\" ~6 i# q9 L: ?% D0 V</font><br /> using std::cout;<font class=\\"jammer\\">7 F( m. a9 v6 j6 p</font><br /> using std::cin;<font class=\\"jammer\\">0 q+ A+ c& C7 L2 x. P  L, z3 ]</font><br /> using std::endl;<font class=\\"jammer\\">0 b2 F4 o  w* j9 }</font><br /> <br /> <span style=\\"display:none\\">3 Z0 M6 g4 e6 t( r9 @+ d& H</span> <br /> <span style=\\"display:none\\">5 H' Y3 X3 }  w: @</span> unsigned long fibonacci( unsigned long );<br /> <span style=\\"display:none\\">6 Y$ L- J8 `) A( N7 ~5 n2 e</span> <font class=\\"jammer\\">1 Q( a5 |\\" Z7 y# p6 T4 m</font><br /> int main( void )<font class=\\"jammer\\">6 j4 L0 \; y' s</font><br /> {<font class=\\"jammer\\">1 a3 q) P\\" X' U! n6 e</font><br />   unsigned long result, number;<br /> <span style=\\"display:none\\">: a$ E+ [3 T\\" P8 h</span> <br /> <span style=\\"display:none\\">! j4 v\\" s& b' p0 n! N</span>   cout << "Enter an integer: ";<br /> <span style=\\"display:none\\">* K6 k7 T/ B& K# j7 ^3 ~( @% L</span>   cin  >> number;<br /> <span style=\\"display:none\\">! K; U7 M% V  g) x4 r</span>   result = fibonacci( number );<br /> <span style=\\"display:none\\">* }# |, G2 k1 ?; O, P, l# t</span>   cout << "Fibonacci( "<< number << " ) = " << result << endl;<font class=\\"jammer\\">+ T% \1 P! g6 E( V% y1 J</font><br />   return 0;<font class=\\"jammer\\">; S6 _* a4 P8 w6 |* B' J</font><br /> }<font class=\\"jammer\\">4 `' `0 k0 u; B4 f</font><br /> <br /> <span style=\\"display:none\\">- m( q+ n# u  H. c4 D! G</span> unsigned long fibonacci( unsigned long n )<font class=\\"jammer\\">% D- v7 q9 d& {4 V</font><br /> {<br /> <span style=\\"display:none\\">+ P1 g6 N7 Q* a  i& ]; k+ X</span>   if ( n == 0 || n == 1 )<font class=\\"jammer\\">\\" O+ \6 {2 k- Z% d</font><br />     return n;<br /> <span style=\\"display:none\\">\\" _5 ?; Z  p+ z4 P</span>   else<font class=\\"jammer\\">. f$ n/ w\\" P7 \# R\\" \</font><br />     return fibonacci( n -1 ) + fibonacci( n - 2 );<br /> <span style=\\"display:none\\">' C4 u# r\\" H, z5 d</span> }<br /> <span style=\\"display:none\\">( F+ R) Y; Q2 G/ C% A9 P6 z</span>