View Code of Problem 3695

#include<iostream>
#include<cstdio>

using namespace std;
long long money[2][93];

int main()
{
	int t, n;
	cin >> t;
	money[0][1] = 1;
	money[0][2] = 2;
	money[1][1] = 1;
	money[1][2] = 3;
	for(int i = 3; i <= 90; i++)
	{
		money[0][i] = money[0][i-1] + money[0][i-2];
		money[1][i] = money[0][i] + money[1][i-1];
	}
	while(t--)
	{
		cin >> n;
		cout << money[1][n] << endl;
	}
	return 0;
}

Double click to view unformatted code.


Back to problem 3695