| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 204466 | 14kg | 타일 장식물 (KOI16_bb) | C++11 | 6 ms | 504 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
int n;
long long dp[81];
int main() {
	scanf("%d", &n), dp[1] = 1, dp[2] = 1;
	for (int i = 3; i <= n; i++) dp[i] = dp[i - 1] + dp[i - 2];
	printf("%lld", dp[n] * 4 + dp[n - 1] * 2);
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
