Submission #84 :: njudge

2021-01-10 16:07:12

cpp11

Accepted 50/50

12ms

17576 KiB

#include <iostream>
using namespace std;

long long lehetoseg[1000001];

int main() {
  int n, p = 1, z = 1, s = 3, f = 3;
  cin >> n;
  lehetoseg[0] = 2;
  lehetoseg[1] = 4;
  lehetoseg[2] = 10;
  for (int i = 3; i < n; i++){
    lehetoseg[i] = (lehetoseg[i - 1] * 2 + lehetoseg[i - 3] * 2) % 20210108;
  }
  cout << lehetoseg[n - 1] << endl;
	return 0;
}

/*
n   f(n)
1   2
2   4
3   10
4   24
5   56

f[n] = 2 * f[n-1] + 2 * f[n - 3]

F/S - P/Z -> 2*f(n-1)   F/S -> 2*f(n-3)
F/S
F/S
X
X

*/

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	1ms	1876 KiB
		2	Accepted	0/0	1ms	1908 KiB
		3	Accepted	3/3	1ms	1952 KiB
		4	Accepted	3/3	1ms	1952 KiB
		5	Accepted	4/4	1ms	1960 KiB
		6	Accepted	4/4	1ms	1956 KiB
		7	Accepted	4/4	12ms	17576 KiB
		8	Accepted	4/4	2ms	3816 KiB
		9	Accepted	4/4	1ms	1956 KiB
		10	Accepted	4/4	1ms	1960 KiB
		11	Accepted	4/4	3ms	5076 KiB
		12	Accepted	4/4	12ms	17304 KiB
		13	Accepted	4/4	9ms	15580 KiB
		14	Accepted	4/4	4ms	7148 KiB
		15	Accepted	2/2	1ms	1952 KiB
		16	Accepted	2/2	1ms	1952 KiB