Torni

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
 
ll big = 1e9+7;
ll dp[1010101];
ll dp2[1010101];
int main(){
    ll t;
    cin >> t;
    ll n = 100000;
    for(int i = 0; i < 1010101; i++) dp[i] = 0;
    for(int i = 0; i < 1010101; i++) dp2[i] = 0;
    dp[1] = 1;
    dp2[1] = 1;
    for(int i = 2; i <= n; i++){
        dp2[i] = 4*dp2[i-1] + dp[i-1];
        dp[i] = dp2[i-1] + 2*dp[i-1];
        dp2[i] %= big;
        dp[i] %= big;
    }
        
    while(t--){
        cin >> n;
        cout << (dp[n] + dp2[n])%big << "\n";
    }
}

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 2, 3

Verdict: ACCEPTED

Test 3

Group: 3

Verdict: WRONG ANSWER