Submission #83 :: njudge

2021-01-10 16:03:43

cpp11

Wrong answer 43/50

14ms

17452 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;
    if (i == n - 1){
      cout << lehetoseg[i] << 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	43/50
		1	Accepted	0/0	2ms	1868 KiB
		2	Accepted	0/0	1ms	1928 KiB
		3	Accepted	3/3	1ms	1900 KiB
		4	Wrong answer	0/3	1ms	1904 KiB
		5	Accepted	4/4	1ms	1904 KiB
		6	Accepted	4/4	1ms	1912 KiB
		7	Accepted	4/4	14ms	17452 KiB
		8	Accepted	4/4	3ms	3780 KiB
		9	Accepted	4/4	1ms	1920 KiB
		10	Accepted	4/4	1ms	1924 KiB
		11	Accepted	4/4	4ms	5048 KiB
		12	Accepted	4/4	14ms	17292 KiB
		13	Accepted	4/4	13ms	15560 KiB
		14	Accepted	4/4	6ms	7208 KiB
		15	Wrong answer	0/2	1ms	1940 KiB
		16	Wrong answer	0/2	1ms	1948 KiB