Submission

Status:

PPPPPPPPPP

Score: 100

User: njoop

Problemset: Medulla

Language: cpp

Time: 1.896 second

Submitted On: 2025-01-03 19:40:02

#include <bits/stdc++.h>
#define int long long
using namespace std;

int mod = 20011, dp[7500010];

signed main() {
    cin.tie(0)->sync_with_stdio(0);
    dp[0] = 0;
    dp[1] = 1;
    dp[2] = 8;
    for(int i=3; i<=7500000; i++) {
        dp[i] = (dp[i-3]*dp[i-3]*dp[i-3] + dp[i-2]*dp[i-1]) % mod;
    }
    int t;
    cin >> t;
    while(t--) {
        int in;
        cin >> in;
        cout << dp[in] << "\n";
    }
    return 0;
}