-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathc.cpp
More file actions
57 lines (47 loc) · 1.31 KB
/
Copy pathc.cpp
File metadata and controls
57 lines (47 loc) · 1.31 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define REP(i, n, m) for(ll i=n; i<(ll)m; ++i)
#define IREP(i, n, m) for(ll i=n-1; i>=m; --i)
#define rep(i, n) REP(i, 0, n)
#define irep(i, n) IREP(i, n, 0)
#define all(v) v.begin(), v.end()
#define vprint(v) for(auto e:v){cout<<e<<" ";};cout<<endl;
#define vvprint(vv) for(auto v:vv){vprint(v)};
ll pow_mod(ll n, ll m, ll mod=1000000007){
ll a = 1;
while(m>0){
if(m&1) a = a*n % mod;
n = n*n % mod;
m >>= 1;
}
return a;
}
ll combi(ll n, ll m, ll mod=1000000007){
static const ll N_MAX = 200001;
static vll fac(N_MAX+1, -1);
static vll ifac(N_MAX+1, -1);
if(fac[0]<0){
fac[0] = ifac[0] = 1;
rep(i, N_MAX){
fac[i+1] = fac[i] * (i+1) % mod;
ifac[i+1] = ifac[i] * pow_mod(i+1, mod-2, mod) % mod;
}
}
if(n<=0 && m<=0) return 1;
if(n<m || n<0) return 0;
return (ifac[n-m] * ifac[m] % mod) * fac[n] % mod;
}
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(20);
ll N;
cin >> N;
ll s = ((pow_mod(10, N)-pow_mod(9, N)*2) % 1000000007 + 1000000007) % 1000000007;
s = (s+pow_mod(8, N)) % 1000000007;
cout << s << endl;
}