Submission #16730543

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
#define rep(i,n) for(int i=0;i<n;i++)
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define debug1(a) cout<<#a<<" "<<(a)<<endl;
#define debug2(a,b) cout<<#a<<" "<<(a)<<" "<<#b<<" "<<(b)<<endl;
#define debug3(a,b,c) cout<<#a<<" "<<(a)<<" "<<#b<<" "<<(b)<<" "#c<<" "<<(c)<<endl;
typedef long double ld;
ll mod1 = 1e9 + 7;
long long mod(long long x) {
	return ((x % mod1 + mod1) % mod1);
}
long long add(long long a, long long b) {
	return mod(mod(a) + mod(b));
}
long long mul(long long a, long long b) {
	return mod(mod(a) * mod(b));
}
long long minu(long long a, long long b) {
	return mod(mod(a) - mod(b));
}
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 << endl;
		return;
	}
	else if (n == 2)
	{
		cout << 2 << endl;
		return;
	}
	ll ans = minu(add(power(10, n, mod1), power(8, n, mod1)), mul(2, power(9, n, mod1)));
	cout << ans << endl;


}
int main()
{
	//ios_base::sync_with_stdio(false);
	//cin.tie(NULL);
	int t;
	t = 1;
	while (t--)
	{
		solve();
	}
}

Submission Info

Judge Result