View Code of Problem 60

#include<stdio.h>
#include<iostream>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<stack>
#include<map>
#include<vector>
#include<cstdbool>
using namespace std;
int p[1000];
int k = 0;
int digui(int a) {
	int answer;
	if (p[a] != 0) {
		return p[a];
	}
	if (a == 1) {
		answer=2;
	}
	else if (a == 2) {
		answer = 3;
	}
	else {
		answer = digui(a - 1) + digui(a - 2);
	}
	p[k++] = answer;
	return answer;
}
int main()
{
	int n;
	cin >> n;
	int k = 1;
	while (n--) {
		int shu;
		cin >> shu;
		printf("Scenario #%d:\n", k++);
		printf("%d\n", digui(shu));

	}
	return 0;
}