【C++】斐波那契数列

#include<iostream>using namespace std;int fab(int a);int main(void){int a;cin >> a;int m[10] = {0};int i = 0,b;while(i<a){cin >> b;m[i] = fab(b);i++;}for(int j = 0;j<a;j++){cout <<m[j]<<endl;}}int fab(int a){if(a==1||a==2)return 1;elsereturn fab(a-1)+fab(a-2);}