Code666 (代码贴、代码片段)

[C++] c++ 使用迭代计算第n个斐波纳契数 →→→→→进入此内容的聊天室

来自 , 2021-03-06, 写在 C++, 查看 128 次.
URL http://www.code666.cn/view/85f007f8
  1. #include <iostream>
  2.  
  3. unsigned int fib(unsigned int position );
  4. int main()
  5. {
  6.     using namespace std;
  7.     unsigned int answer, position;
  8.     cout << "Which position? ";
  9.     cin >> position;
  10.     cout << endl;
  11.  
  12.     answer = fib(position);
  13.     cout << answer << " is the ";
  14.     cout << position << "th Fibonacci number. " << endl;
  15.     return 0;
  16. }
  17.  
  18. unsigned int fib(unsigned int n)
  19. {
  20.     unsigned int minusTwo=1, minusOne=1, answer=2;
  21.  
  22.     if (n < 3)
  23.         return 1;
  24.  
  25.     for (n -= 3; n != 0; n--)
  26.     {
  27.         minusTwo = minusOne;
  28.         minusOne = answer;
  29.         answer = minusOne + minusTwo;
  30.     }
  31.  
  32.     return answer;
  33. }
  34.  

回复 "c++ 使用迭代计算第n个斐波纳契数"

这儿你可以回复上面这条便签

captcha

贴代码片段 - Code666