Submission #5,912

2023-10-05 16:10:20

cpp17

Accepted 50/50

13ms

11032 KiB

#include <bits/stdc++.h>
using namespace std;
#define f(i,k,n) for(int i=k; i<n; i++)
#define ll long long
const int inf = INT_MAX;

void solve()
{
    int n;
    cin>>n;
    vector<int> torony(n+1,0);
    torony[0]=0;
    torony[1]=2;
    torony[2]=4;
    torony[3]=10;
    f(i,4,n+1)
    {
       torony[i]=(torony[i-1]*2 + torony[i-3]*2)%20210108;
    }
    cout<<torony[n]%20210108;
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t=1;
    //cin>>t;
    while(t--)  solve();
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	3ms	1828 KiB
		2	Accepted	0/0	3ms	1876 KiB
		3	Accepted	3/3	3ms	2084 KiB
		4	Accepted	3/3	2ms	2172 KiB
		5	Accepted	4/4	3ms	2300 KiB
		6	Accepted	4/4	3ms	2544 KiB
		7	Accepted	4/4	12ms	10456 KiB
		8	Accepted	4/4	4ms	3784 KiB
		9	Accepted	4/4	3ms	3184 KiB
		10	Accepted	4/4	3ms	3240 KiB
		11	Accepted	4/4	4ms	4832 KiB
		12	Accepted	4/4	13ms	11032 KiB
		13	Accepted	4/4	12ms	10252 KiB
		14	Accepted	4/4	6ms	6308 KiB
		15	Accepted	2/2	3ms	3984 KiB
		16	Accepted	2/2	3ms	4136 KiB