題目鏈接：
KY96 Fibonacci 
https://www.nowcoder.com/share/jump/437195121692000803047
描述
??? The Fibonacci Numbers{0,1,1,2,3,5,8,13,21,34,55...} are defined by the recurrence: ??? F0=0 F1=1 Fn=Fn-1+Fn-2,n>=2 ??? Write a program to calculate the Fibonacci Numbers.
輸入描述：
????Each case?contains a number n and you are expected to calculate Fn.(0<=n<=30) 。
輸出描述：
?? For each case, print a number Fn on a separate line,which means the nth Fibonacci Number.
示例1
輸入：
1輸出：
1源代碼：
#include<iostream>
using namespace std;//例題8.3 Fibonacci
int main()
{int n;while (cin >> n) {if (n == 0 || n == 1) {cout << n << endl;continue;}int pre = 0, aft = 1;for (int i = 0; i < n; i++) {int temp = pre;pre += aft;aft = temp;}cout << pre << endl;}return 0;
}提交結果：
?
