Submission #544685

#TimeUsernameProblemLanguageResultExecution timeMemory
544685pokmui9909타일 장식물 (KOI16_bb)C++17
100 / 100
1 ms340 KiB
#include <string>
#include <iostream>
#include <algorithm>
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <functional>
#include <climits>
using namespace std;

using ll = long long;

int main()
{
	cin.tie(NULL); cout.tie(NULL);
	ios_base::sync_with_stdio(false);

	ll D[85] = { 1, 1 };
	int n; cin >> n;
	for (int i = 2; i <= 83; i++)
		D[i] = D[i - 2] + D[i - 1];
	cout << D[n + 1] * 2;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...