哟，这不是阔别已久的斐波那契吗

整点高级的

---

#include<bits/stdc++.h>
using namespace std;

long long fibonacci(int n)
{
	if(n == 1 || n == 2) return 1;
	else return fibonacci(n - 1) + fibonacci(n - 2);
}

int main()
{
	int n;
	cin >> n;
	cout << fibonacci(n) << endl;
}