Submission #6,084

2023-10-29 17:22:17

cpp17

Accepted 40/40

3ms

4072 KiB

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
int main()
{
    int n;
    cin>>n;
    vector<ll> dp={1,2,5};
    vector<ll> lyuk={0,2,4};
    ll mod=20200111;
    int cnt=0;
    for (int i=3; i<n;i++){
        dp.push_back((lyuk[i-1]+dp[i-1]+dp[i-2])%mod);
        lyuk.push_back((lyuk[i-1]+lyuk[i-2]+dp[i-2]*2)%mod);

    }
    cout<<dp[n-1]%mod;
}

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	3ms	1812 KiB
		2	Accepted	0/0	3ms	2064 KiB
		3	Accepted	1/1	3ms	2424 KiB
		4	Accepted	1/1	3ms	2524 KiB
		5	Accepted	2/2	3ms	2744 KiB
		6	Accepted	2/2	3ms	2868 KiB
		7	Accepted	3/3	3ms	3060 KiB
		8	Accepted	3/3	3ms	3196 KiB
		9	Accepted	3/3	3ms	3556 KiB
		10	Accepted	3/3	3ms	3684 KiB
		11	Accepted	3/3	3ms	3932 KiB
		12	Accepted	3/3	3ms	3944 KiB
		13	Accepted	3/3	3ms	3948 KiB
		14	Accepted	3/3	3ms	3948 KiB
		15	Accepted	3/3	3ms	3948 KiB
		16	Accepted	3/3	3ms	4072 KiB
		17	Accepted	4/4	3ms	3960 KiB