Submission #16719202

---

Source Code Expand

#include <bits/stdc++.h>
typedef long long ll;
#define M 1000000007
using namespace std;

ll power(ll x, ll y, ll p)  
{  
    ll res = 1;     // Initialize result  
  
    x = x % p; // Update x if it is more than or  
                // equal to p 
   
    if (x == 0) return 0; // In case x is divisible by p; 
  
    while (y > 0)  
    {  
        // If y is odd, multiply x with result  
        if (y & 1)  
            res = (res*x) % p;  
  
        // y must be even now  
        y = y>>1; // y = y/2  
        x = (x*x) % p;  
    }  
    return res;  
}  

void solve(){
    ll n;
    cin >> n;
    if(n == 1){
        cout << 0 << "\n";
        return;
    }
    ll a1 = power(10,n,M);
    ll a2 = (2*power(9,n,M))%M;
    ll b1 = power(8,n,M);
    ll ans = (a1 - a2 + b1)%M;
    cout << ans << "\n";

    

}


int main(){
    #ifndef ONLINE_JUDGE
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif
    ll q;
    q=1;
    // cin>>q;
    while(q--) solve();


    return 0;
}

Submission Info

Judge Result