Submission

Status:

PPPPPPPPPP

Score: 100

User: mydKN

Problemset: Medulla

Language: cpp

Time: 2.009 second

Submitted On: 2024-12-12 16:19:54

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 75e5 + 5;
const int MOD = 2e4+11;

int n;
vector<ll> dp(maxn);

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin >> n;
	dp[0] = 0;
	dp[1] = 1;
	dp[2] = 8;
	for(int i=3;i<=75e5;++i){
		dp[i] = (dp[i-3]*dp[i-3]*dp[i-3] + dp[i-2]*dp[i-1]) % MOD;
	}
	for(int i=0;i<n;++i){
		int x;
		cin >> x;
		cout << dp[x] << "\n";
	}
}