problem_id
stringclasses 100
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 6
806
|
|---|---|---|---|
p02554
|
s541156219
|
Accepted
|
N = int(input())
print(((10**N) - (2 * (9**N) - (8**N))) % ((10**9) + 7))
|
p02554
|
s230485168
|
Accepted
|
#178-C
N = int(input())
ans = 10**N - 2*9**N + 8**N
print(ans % (10**9+7))
|
p02554
|
s190563996
|
Accepted
|
n=int(input())
mod=10**9+7
def power_func(a,n,mod):
bi=str(format(n,"b"))
res=1
for i in range(len(bi)):
res=(res*res)%mod
if bi[i]=='1':
res=(res*a)%mod
return res
x=power_func(10,n,mod)
y=power_func(9,n,mod)
z=power_func(8,n,mod)
ans=(x-(y-z)*2-z)%mod
print(ans)
|
p02554
|
s653426444
|
Accepted
|
mod = 10**9+7
n = int(input())
print((pow(10,n,mod)-pow(9,n,mod)*2+pow(8,n,mod))%mod)
|
p02554
|
s500354185
|
Accepted
|
n = int(input())
if n > 1:
print(((10**n) - (9**n * 2 - 8**n))%(10**9+7))
else:
print("0")
|
p02554
|
s215782424
|
Accepted
|
N = int(input())
S = 0
if N == 1:
print('0')
else:
S0 = 10**N - 9**N
S9 = 10**N - 9**N
S09 = 8**N
S = S0 + S9 + S09 - 10**N
S = S % (10**9 + 7)
print(S)
|
p02554
|
s471444268
|
Accepted
|
n=int(input())
print((10**n-2*9**n+8**n)%1000000007)
|
p02554
|
s357180021
|
Accepted
|
N = int(input())
MOD = 10**9 + 7
_or = 9**N % MOD
_and = 8**N % MOD
wa = ((9**N) * 2 - 8**N) % MOD
ans = (10**N - wa) % MOD
print(ans)
|
p02554
|
s059318461
|
Accepted
|
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n = inp()
res = pow(10,n,mod)
res -= pow(9,n,mod)*2
res %= mod
res += pow(8,n,mod)
print(res%mod)
|
p02554
|
s044782761
|
Accepted
|
N=int(input())
print((10**N-8**N-(2*(9**N-8**N)))%(10**9+7))
|
p02554
|
s044735363
|
Accepted
|
n = int(input())
print((10**n-8**n-(9**n-8**n)*2)%(10**9+7))
|
p02554
|
s223883490
|
Accepted
|
n = int(input())
mod=10**9+7
if n==1:
print(0)
else:
print(((10**n)-(9**n)-(9**n)+(8**n))%mod)
|
p02554
|
s306908018
|
Accepted
|
n = int(input())
MOD = 10 ** 9 + 7
ans = pow(10, n, MOD) - 2 * pow(9, n, MOD) + pow(8, n, MOD)
ans %= MOD
print(ans)
|
p02554
|
s915669343
|
Accepted
|
n = int(input())
m = 10**9+7
a = 10**n - 9**n - 9**n + 8**n
print(a % m)
|
p02554
|
s673361954
|
Accepted
|
MOD = 10 ** 9 + 7
n = int(input())
print((pow(10, n, MOD) - pow(9, n, MOD) - pow(9, n, MOD) + pow(8, n, MOD)) % MOD)
|
p02554
|
s643674266
|
Accepted
|
N=int(input())
mod = 10**9+7
A=pow(10,N,mod)-2*pow(9,N,mod)+pow(8,N,mod)
print(A%mod)
|
p02554
|
s188324975
|
Accepted
|
import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
ans = pow(10,N,MOD) - pow(9,N,MOD)*2 + pow(8,N,MOD)
ans %= MOD
print(ans)
if __name__ == '__main__':
main()
|
p02554
|
s258705276
|
Accepted
|
n = int(input())
mod = 10**9+7
total = 10**n % mod
rest = (((9**(n) % mod) * 2 % mod) - (8**n % mod)) % mod
print((total - rest) % mod)
|
p02554
|
s506251482
|
Accepted
|
n = int(input())
MOD = 10**9+7
def f(num):
return pow(num, n, MOD)
print((f(10)-f(9)-f(9)+f(8))%MOD)
|
p02554
|
s111184177
|
Accepted
|
N = int(input())
p = 10**9+7
a = 1
b = 1
c = 1
for _ in range(N):
a = a*10%p
b = b*9%p
c = c*8%p
n = (a-2*b+c)%p
print(n)
|
p02554
|
s336013588
|
Accepted
|
n=int(input())
ans=10**n-2*(9**n)+8**n
ans=ans%1000000007
print(ans)
|
p02554
|
s643375345
|
Accepted
|
mod = 1000000007
N = int(input())
ans = (10 ** N) - (9 ** N) - (9 ** N) + (8 ** N)
ans = ans % mod
print(ans)
|
p02554
|
s447105713
|
Accepted
|
def f(n):
mod = 1000000007
return (pow(10, n, mod) - 2 * pow(9, n, mod) + pow(8, n, mod)) % mod
n = int(input())
print(f(n))
|
p02554
|
s616337953
|
Accepted
|
M = 10**9 + 7
n = int(input())
print((pow(10, n, M) - 2 * pow(9, n, M) + 8**n) % M)
|
p02554
|
s213976950
|
Accepted
|
n = int(input())
ans = (10 ** n - 9 ** n * 2 + 8 ** n) % (10 ** 9 + 7)
print(ans)
|
p02554
|
s838643428
|
Accepted
|
n=int(input())
v=pow(10,9)+7
a=pow(10,n,v)-2*pow(9,n,v)+pow(8,n,v)
print (a%v)
|
p02554
|
s204043451
|
Accepted
|
N = int(input())
MOD = 10**9+7
ans = 10**N-(9**N+9**N-8**N)
print(ans%MOD)
|
p02554
|
s428093356
|
Accepted
|
import sys
input = sys.stdin.readline
n = int(input())
print((10**n - (2*9**n-8 **n)) % (10**9 + 7))
|
p02554
|
s593634014
|
Accepted
|
n=int(input())
MOD=10**9+7
ans=pow(10,n,MOD)-2*pow(9,n,MOD)+pow(8,n,MOD)
print(ans%MOD)
|
p02554
|
s333535962
|
Accepted
|
m=int(1e9+7)
n=int(input())
ans=pow(10,n,m)-2*pow(9,n,m)+pow(8,n,m)
print(ans%m)
|
p02554
|
s178631629
|
Accepted
|
n = int(input())
mod = int(1e9)+7
print((pow(10, n, mod) - 2*pow(9, n, mod) + pow(8, n, mod))%mod)
|
p02554
|
s594219727
|
Accepted
|
n = int(input())
mod = 10**9 + 7
ans = pow(10,n,mod)
ans -= pow(9,n,mod)*2
ans += pow(8,n,mod)
print(ans%mod)
|
p02554
|
s081060227
|
Accepted
|
n = int(input())
x = 10 ** n
x -= 2*(9**n)
x += 8**n
x %= 1000000007
print(x)
|
p02554
|
s886603629
|
Accepted
|
import sys
import math
sys.setrecursionlimit(10**6)
MOD = 10**9+7
def main(input, print):
n = int(input())
ans = 10**n - 9**n - 9**n + 8**n
ans %= MOD
print(ans)
if __name__ == '__main__':
main(sys.stdin.readline, print)
|
p02554
|
s044135574
|
Accepted
|
n = int(input())
mod = 10**9 + 7
print((pow(10, n, mod) - 2 * pow(9, n, mod) + pow(8, n, mod)) % mod)
|
p02554
|
s678930746
|
Accepted
|
n=int(input())
x=(10**n)%(10**9+7)
y=(9**n)%(10**9+7)
z=(8**n)%(10**9+7)
print((x-2*y+z)%(10**9+7))
|
p02554
|
s629847208
|
Accepted
|
n=int(input())
print((10**n-2*(9**n)+8**n)%(10**9+7))
|
p02554
|
s019418768
|
Accepted
|
tmp = 10 ** 9 + 7
def div(n,T):
_ = 1
for t in range(T):
_ *= n
_ %= tmp
return _
N = int(input())
a = div(10,N)
b = div(9,N)
c = div(8,N)
print((a + c - 2 * b) % tmp)
|
p02554
|
s564235835
|
Accepted
|
N = int(input())
y = 10**N - 2*(9**N) + 8**N
y_d = y % ( 10**9 + 7 )
print(y_d)
|
p02554
|
s657534991
|
Accepted
|
def main():
N = int(input())
mod = 10 ** 9 + 7
return (pow(10, N, mod) - pow(9, N, mod) - pow(9, N, mod) + pow(8, N, mod)) % mod
print(main())
|
p02554
|
s977712082
|
Accepted
|
N = int(input())
a = 10**N - 9**N -9**N + 8**N
print(a%(10**9+7))
|
p02554
|
s767276107
|
Accepted
|
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n = int(input())
mod = 10**9+7
ans = pow(10, n, mod)-pow(9, n, mod)*2+pow(8, n, mod)
print(ans % mod)
if __name__ == '__main__':
main()
|
p02554
|
s093711127
|
Accepted
|
N = int(input())
mod = 10**9+7
ans = pow(10, N, mod) - ((pow(9, N, mod) * 2) - pow(8, N, mod))
ans %= mod
print(ans)
|
p02554
|
s941530604
|
Accepted
|
N = int(input())
A = 10**N + 8**N - 2*9**N
B = A%(10**9 + 7)
print(B)
|
p02554
|
s074904933
|
Accepted
|
n = int(input())
ans = ((((10 ** n) - (9 ** n)) * 2) - ((10 ** n) - (8 ** n))) % (10 ** 9 + 7)
print(ans)
|
p02554
|
s840684897
|
Accepted
|
n = int(input())
k = 1000000007
if n == 1:
print(0)
else:
print((10**n - 2* 9**n+8**n)%k)
|
p02554
|
s047938258
|
Accepted
|
seq = int(input())
a = int(10**9 + 7)
answer = (10**seq - 9**seq - 9**seq + 8**seq)%a
print(answer)
|
p02554
|
s087071473
|
Accepted
|
N = int(input())
if N == 1:
print(0)
exit()
if N == 2:
print(2)
exit()
# N >= 3
# 全事象
all_pattern = 10 ** N
# 0も9もない
pattern_a = 8 ** N
# 0あるが9ない
pattern_b = 9 ** N - 8 ** N
ans = all_pattern - pattern_a - pattern_b * 2
ans = ans % (10**9 + 7)
print(ans)
|
p02554
|
s897067867
|
Accepted
|
n = int(input())
a,b,c = 1,1,1
for i in range(n):
a *= 10
b *= 9
c *= 8
a %= 10** 9 + 7
b %= 10** 9 + 7
c %= 10** 9 + 7
print((a - 2 * b +c)%(10** 9 + 7))
|
p02554
|
s557138414
|
Accepted
|
print((pow(10,n:=int(input()),M:=10**9+7)-pow(9,n,M)*2+pow(8,n,M))%M)
|
p02554
|
s857464135
|
Accepted
|
N=int(input())
M=10**9+7
ans=1
m=1
for i in range(N):ans=(ans*10)%M
for i in range(N):m=(m*9)%M
ans-=(m*2)%M
m=1
for i in range(N):m=(m*8)%M
print((ans+m)%M)
|
p02554
|
s734763180
|
Accepted
|
INF = 10 ** 9 + 7
N = int(input())
a = 10**N
b = 9**N
c = 8**N
ans = a -(b + b - c)
ans = ans%INF
print(ans)
|
p02554
|
s430262909
|
Accepted
|
a=int(input())
if a<=1:
print(0)
else:
n=(10**a)-(9**a)*2+(8**a)
print(n%1000000007)
|
p02554
|
s549920088
|
Accepted
|
n = int(input())
# ぜんぶ
a = 10 ** n
# 0が存在しない
b = 9 ** n
# 9が存在しない
c = 9 ** n
# 0も9も存在しない
d = 8 ** n
ans = a - b - c + d
print(ans % 1000000007)
|
p02554
|
s931003662
|
Accepted
|
import sys
sys.setrecursionlimit(10000000)
mod = 10 ** 9 + 7
def pow(a, n):
if n == 0:
return 1
if n == 1:
return a
tmp = pow(a, n//2)
tmp = (tmp * tmp) % mod
if n % 2 == 1:
tmp = (tmp * a) % mod
return tmp
n = int(input())
print()
print((((pow(10, n) - 2 * pow(9, n) + mod ** 2) % mod) + pow(8, n)) % mod)
|
p02554
|
s468991321
|
Accepted
|
n = int(input())
MOD = 1000000007
print((pow(10,n)- 2*(pow(9,n)) + pow(8,n))%MOD)
|
p02554
|
s863985119
|
Accepted
|
MOD=10**9+7
N=int(input())
ans=1
nine=1
eight=1
for i in range(N):
ans*=10
ans%=MOD
nine*=9
nine%=MOD
eight*=8
eight%=MOD
nine*=2
nine%=MOD
ans-=nine
ans%=MOD
ans+=eight
ans%=MOD
print(ans)
|
p02554
|
s368039175
|
Accepted
|
def main():
n = int(input())
mod = 10**9 + 7
# すべての組み合わせから、いずれかの条件を満たさないパターンを引く
pattern = 10 ** n
not_pattern = (9 ** n) + (9 ** n) - (8 ** n)
answer = (pattern - not_pattern) % mod
print(answer)
if __name__ == "__main__":
main()
|
p02554
|
s069040170
|
Accepted
|
n = int(input())
def modpow(a, n, mod):
res = 1
while n > 0:
if n & 1:
res = res * a % mod
a = a * a % mod
n >>= 1
return res
mod = 1000000007
ans = modpow(10, n, mod) - (modpow(9, n, mod) + modpow(9, n, mod) - modpow(8, n, mod))
ans = ans % mod
print(ans)
|
p02554
|
s389881722
|
Accepted
|
N = int(input())
ans = 10 ** N - (9 ** N * 2 - 8 ** N)
print(ans % (10 ** 9 + 7))
|
p02554
|
s395674941
|
Accepted
|
N=int(input())
x=(10**N-2*(9**N)+8**N)%(10**9+7)
print(x)
|
p02554
|
s187306750
|
Accepted
|
N = int(input())
output = ((10 ** N) - 2 * (9 ** N) + (8 ** N) ) % 1000000007
print(output)
|
p02554
|
s754406958
|
Accepted
|
n=int(input())
mod=10**9+7
ans=10**n-2*9**n+8**n
print(ans%mod)
|
p02554
|
s543609639
|
Accepted
|
def func(x, n):
res = 1
for _ in range(n):
res = res * x % MOD
return res
n = int(input())
MOD = 10**9 + 7
ans = func(10, n) - func(9, n) - func(9, n) + func(8, n)
ans %= MOD
print(ans)
|
p02554
|
s877004506
|
Accepted
|
n=int(input())
x=pow(10,n,10**9+7)-2*pow(9,n,10**9+7)+pow(8,n,10**9+7)
print(x%(10**9+7))
|
p02554
|
s175248897
|
Accepted
|
N = int(input())
if(N>1):
all = 2**N * ((5**N) + (4**N)) - 2 * (9**N)
else:
all = 0
print(all % 1000000007)
|
p02554
|
s866671686
|
Accepted
|
import sys
input = sys.stdin.readline
N = int(input().rstrip('\n'))
res = 10**N-(9**N)*2 + 8**N
print(res % 1000000007)
|
p02554
|
s588533659
|
Accepted
|
n = int(input())
p = 10**9+7
print((pow(10, n, p) - 2*pow(9, n, p) + pow(8, n, p)) % p)
|
p02554
|
s906849107
|
Accepted
|
N = int(input())
mod = 10**9+7
if N == 1:
print(0)
elif N == 2:
print(2)
else:
tmp = 2*(pow(10,N,mod)-pow(9,N,mod))-(pow(10,N,mod)-pow(8,N,mod))
print(tmp%mod)
|
p02554
|
s673191964
|
Accepted
|
def main():
N = int(input())
a = 1
b = 1
c = 1
mod = (10 ** 9) + 7
for _ in range(N):
a = (a * 10) % mod
b = (b * 9) % mod
c = (c * 8) % mod
print((a - (2*b) + c) % mod )
main()
|
p02554
|
s990637414
|
Accepted
|
num=int(input())
num2=[10, 9 ,8]
num2a=map(int, num2)
def multi(x):
y=x**num
return y
a, b, c=map(multi, num2a)
print((a-2*b+c)%(int(1e9+7)))
|
p02554
|
s816902543
|
Accepted
|
mod = 1000000007
n = int(input())
a = 1
b = 1
c = 1
for i in range(n):
a = a * 10 % mod
b = b * 8 % mod
c = c * 9 % mod
d = (a - 2 * c + b + mod) % mod
d = (d + mod) % mod
print(d)
|
p02554
|
s342273208
|
Accepted
|
import sys
input = sys.stdin.readline
N = int(input())
if N == 1:
print(0)
exit(0)
mod = 10 ** 9 + 7
res = pow(10, N, mod) - pow(9, N, mod) * 2 + pow(8, N, mod)
print(res % mod)
|
p02554
|
s796897372
|
Accepted
|
n = int(input())
print((10**n - 2*9**n + 8**n) % (10 ** 9 + 7))
|
p02554
|
s819906316
|
Accepted
|
N = int(input())
ans = 0
if N==1:
ans=0
if N==2:
ans=2
if 2<N:
ans=(10**N-2*9**N+8**N)%(10**9+7)
print(ans)
|
p02554
|
s173183778
|
Accepted
|
n=int(input())
mod=10**9+7
al=10**n
ex=8**n
a=9**n
x=al-ex
ans=x-(a-ex)*2
print(ans%mod)
|
p02554
|
s264509894
|
Accepted
|
n = int(input())
mod = 10**9+7
all = 10**n
yobun = 9**n + 9**n- 8**n
ans = all-yobun
print(ans % mod)
|
p02554
|
s343865682
|
Accepted
|
#!/usr/bin/env python3
import sys
def main():
input = sys.stdin.readline
n = int(input())
mod = 10 ** 9 + 7
if n == 1:
print(0)
elif n == 2:
print(2)
else:
print((pow(10, n, mod) - pow(9, n, mod) * 2 + pow(8, n, mod)) % mod)
if __name__ == '__main__':
main()
|
p02554
|
s839137395
|
Accepted
|
import math
NN = int(input())
def power_func(a,n,p):
bi = str(format(n,"b"))#2進表現に
res = 1
for i in range(len(bi)):
res = (res*res) %p
if bi[i] == "1":
res = (res*a) %p
return res
a = power_func(10, NN , 10 ** 9 + 7)
b = power_func(9 , NN , 10 ** 9 + 7)
c = power_func(8 , NN , 10 ** 9 + 7)
x = ((a - b - b + c) + 10 ** 9 + 7 + 10 ** 9 + 7 ) % (10 ** 9 + 7)
print(x)
|
p02554
|
s549039871
|
Accepted
|
N = int(input())
dp = [0 for j in range(4)]
dp[0] = 1
M = 1_000_000_007;
for i in range(N):
x = dp[0]
y = dp[1]
z = dp[2]
dp[0] = (x * 8) % M
dp[1] = (y * 9 + x) % M
dp[2] = (z * 9 + x) % M
dp[3] = (dp[3] * 10 + y + z) % M
print(dp[3])
|
p02554
|
s854117219
|
Accepted
|
n=int(input())
print((10**n-2*9**n+8**n)%int(1e9+7))
|
p02554
|
s185469846
|
Accepted
|
def pow(a, b, mod):
result = 1
while b:
if b&1: result = (result * a) %mod
a = (a * a) % mod
b >>= 1
return result
n = int(input())
if n <= 1:
print(0)
else:
mod = 10 ** 9 + 7
print((mod + pow(10, n, mod) - 2 * pow(9, n, mod) + pow(8, n, mod)) % mod)
|
p02554
|
s455090167
|
Accepted
|
N = int(input())
MOD = 10 ** 9 + 7
answer = (pow(10, N, MOD) + pow(8, N, MOD) - 2 * pow(9, N, MOD)) % MOD
print(answer + MOD if answer < 0 else answer)
|
p02554
|
s824567081
|
Accepted
|
n = int(input())
if n < 2:
print('0')
elif n == 2:
print('2')
else:
zero = 10 ** n - 9 ** n
nine = 10 ** n - 9 ** n
zq = 10 ** n - 8 ** n
ans = zero + nine - zq
print(ans % (10 ** 9 + 7))
|
p02554
|
s096837205
|
Accepted
|
N=int(input())
MOD=10**9+7
ans=10**N %MOD
ans=ans-2*9**N %MOD
ans=ans+8**N %MOD
print(ans%MOD)
|
p02554
|
s616782687
|
Accepted
|
from sys import stdin,stdout
M=10**9+7
n=int(stdin.readline())
# a,b,c,d=list(map(int,stdin.readline().split()))
# pp=int(pow(10,n-2))
# ans=(pp*n*(n-1))
ans=(10**n)-2*(9**n)+(8**n)
print(ans%M)
|
p02554
|
s317386303
|
Accepted
|
N = int(input())
ans = (10**N + 8**N - 2*(9**N)) % (10**9 + 7)
print(ans)
|
p02554
|
s851316819
|
Accepted
|
n = int(input())
ans = 10**n - 9**n - 9**n + 8**n
print(ans%(10**9 + 7))
|
p02554
|
s581640088
|
Accepted
|
int_n = int(input())
ans = 10**int_n -2*(9**int_n) +8**int_n
ans_divide = ans % (10**9 + 7)
print(ans_divide)
|
p02554
|
s932841296
|
Accepted
|
n = int(input())
mod = 10**9+7
ans = pow(10, n, mod)
ans -= pow(9, n, mod)*2
ans += pow(8, n, mod)
print(ans % mod)
|
p02554
|
s934566763
|
Accepted
|
n=int(input())
print((10**n-9**n-9**n+8**n)%(10**9+7))
|
p02554
|
s895161871
|
Accepted
|
n = int(input())
mod = 10**9+7
print((10**n-(9**n+9**n-8**n))%mod)
|
p02554
|
s339215413
|
Accepted
|
import sys
N = int(input())
if N == 1:
print(0)
sys.exit()
alla = 1
for i in range(N):
alla = (alla * 10) % (10**9+7)
exi1or9 = 1
for i in range(N):
exi1or9 = (exi1or9 * 9) % (10**9+7)
exi1and9 = 1
for i in range(N):
exi1and9 = (exi1and9 * 8) % (10**9+7)
ans = (alla-2*exi1or9+exi1and9) % (10**9+7)
print(ans)
|
p02554
|
s985977093
|
Accepted
|
n = int(input())
mod = 10 ** 9 + 7
ans = pow(10,n,mod)
ans -= pow(9,n,mod) * 2
ans += pow(8,n,mod)
print(ans % mod)
|
p02554
|
s202598044
|
Accepted
|
n = int(input())
m = 10**9 + 7
print(((10**n) % m - (9**n) % m * 2 + (8**n) % m) % m)
|
p02554
|
s829830464
|
Accepted
|
N = int(input())
MOD = 10**9+7
a = 8
b = 1
c = 1
d = 0
for _ in range(N-1):
at = a * 8
bt = b * 9 + a * 1
ct = c * 9 + a * 1
dt = b * 1 + c * 1 + d * 10
a = at % MOD
b = bt % MOD
c = ct % MOD
d = dt % MOD
print(d)
|
p02554
|
s727576518
|
Accepted
|
import math
import collections
import fractions
import itertools
import functools
import operator
import bisect
N = int(input())
def solve():
mod = 10**9+7
ans = 10**N - (9**N)*2 + 8**N
ans %= mod
print(ans)
return 0
if __name__ == "__main__":
solve()
|
p02554
|
s612222751
|
Accepted
|
mod = 10**9+7
N = int(input())
a = 1
b = 1
c = 1
for _ in range(N):
a *= 10
b *= 9
c *= 8
a %= mod
b %= mod
c %= mod
ans = (a -2*b + c)%mod
print(ans)
|
p02554
|
s684286218
|
Accepted
|
MOD = int(1e9+7)
N = int(input())
answer = pow(10, N, MOD)
answer -= pow(9, N, MOD) * 2
answer += pow(8, N, MOD)
answer %= MOD
print(answer)
|
p02554
|
s642154874
|
Accepted
|
N = int(input())
mod = 10**9+7
def p(a,n):
ans = 1
for i in range (n):
ans = ans * a % mod
return ans
print((p(10,N)+p(8,N) - 2* p(9,N))%mod)
|
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 1