杭电oj2190重建希望小学原题链接
题目描述:
思路:
和前面骨牌铺方格类似,找规律递推,f(n) = f(n-1) + f(n-2)*2
AC代码:
#include <iostream>
using namespace std;
const int N =35;
long long arr[N];
int main()
{
int c,n;
cin >> c;
arr[1] = 1;
arr[2] = 3;
arr[3] = 5;
for(int i = 4; i <= n; i++)
{
arr[i] = arr[i-1] + arr[i-2] * 2;
}
while(c--)
{
cin >> n;
cout << arr[n] << endl;
}
return 0;
}