/*
Name: NYOJ--13--Fibonacci数
Copyright: ©2017 日天大帝
Author: 日天大帝
Date: 20/04/17 16:30
Description: 水题打表
*/
#include<iostream>
using namespace std;
#ifdef TABLE
int main(){
int arr[21];
arr[0] = 1;
arr[1] = 1;
for(int i=2; i<21; ++i) arr[i] = arr[i-1] + arr[i-2];
for(int i=0; i<21; ++i) cout<<arr[i]<<",";
return 0;
}
#endif
int arr[21] = {1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,987,1597,2584,4181,6765,10946};
int main() {
int m;cin>>m;
while(m--){
int n;cin>>n;
cout<<arr[n-1]<<endl;
}
return 0;
}
NYOJ--13--打表--Fibonacci数
最新推荐文章于 2019-10-21 17:09:57 发布