problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02554 | s380134967 | Wrong Answer | N=int(input())
if N<2:
print(0)
else:
without=10*(N-2)
considered=(without+2)*(without+1)
print(considered)
|
p02554 | s762936331 | Wrong Answer | n = int(input())
if n ==1:
print(0)
elif n == 2:
print(2)
else:
print(1+(n-1)**2*((10-n+2)*(10**(n-3)))%(10**9+7)) |
p02554 | s152891269 | Wrong Answer | n = int(input())
print(10**n - (9**n * 2 - 8**n)) |
p02554 | s880042008 | Wrong Answer | n = int(input())
MOD = 1000000007
a,b,c,d=pow(9,n,MOD),pow(9,n,MOD),pow(8,n,MOD),pow(10,n,MOD)
print(d-a-b+c) |
p02554 | s012986632 | Wrong Answer | N = int(input())
d_num = (10 ** 9) + 7
from operator import mul
from functools import reduce
def cmb(n,r):
r = min(n-r,r)
if r == 0: return 1
over = reduce(mul, range(n, n - r, -1))
under = reduce(mul, range(1,r + 1))
return over // under
if N == 1:
print(0)
elif N == 2:
print(2)
else:
x = N - 2
y = 9 + x
ans = cmb(y, x)
ans = ans % d_num
print(ans) |
p02554 | s667287659 | Wrong Answer | MOD = 10**9 + 7
N = int(input())
print(pow(10, N, MOD) + pow(8, N, MOD) - 2*pow(9, N, MOD)) |
p02554 | s439808063 | Wrong Answer | n=int(input())
mod=10**9+7
print(pow(10,n,mod)-(2*pow(9,n,mod)-pow(8,n,mod)) % mod) |
p02554 | s137917449 | Wrong Answer | N=int(input())
S=10**9+7
if N==1:
z=0
elif N==2:
z=2
else:
z=((10**(N-2) *N*2) - (10**(N-3) * (N*2-1))) %S
print(z) |
p02554 | s589962753 | Wrong Answer | n = int(input())
num1 = 10**n % (10**9 + 7)
num2 = (9**n * 2) % (10**9 + 7)
num3 = 8**n % (10**9 + 7)
print(num1 - num2 + num3) |
p02554 | s721597595 | Wrong Answer | import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
n = int(input())
if n == 1:
print(0)
exit()
else:
k = combinations_count(n,2)
k = k * 10**(n - 2)
print( k % (10**9+7) ) |
p02554 | s658190202 | Wrong Answer | N = int(input())
mod = 10**9+7
print(10**N%mod-(2*(9**N%mod)-8**N%mod)) |
p02554 | s294456105 | Wrong Answer | n = int(input())
print(10 ^ n + 8 ^ n - 9 ^ n -9 ^ n%(10**9+7)) |
p02554 | s298921194 | Wrong Answer | # 21:17-
N = int(input())
kMod = 10**9+7
print(pow(10, N, kMod) - 2*pow(9, N, kMod)+pow(8, N, kMod))
|
p02554 | s956361934 | Wrong Answer | n = int(input())
def p(m, n):
k = 1
for i in range(n):
k = (k * m) % (10**9 + 7)
return k
x = p(10, n) - 2*p(9, n) + p(8, n)
if x < 0:
x += 10 ** 9 + 7
elif x == 10 ** 9 + 7:
x = 0
print(x) |
p02554 | s727490796 | Wrong Answer | N = int(input())
MOD = 10**9 + 7
val1 = 9**N
val2 = 9**N
val3 = 8**N
ans = 10**N - val1 - val2 + val3
print(ans) |
p02554 | s093006836 | Wrong Answer | from math import factorial
mod = 10**9+7
n = int(input())
if n==1:
print(0)
exit()
if n==2:
print(2)
exit()
a = factorial(n)
a = a*(9**(n-2))
print(a%mod)
|
p02554 | s933215446 | Wrong Answer | n=int(input())
print(pow(10,n,10**9+7)-2*pow(9,n,10**9+7)+pow(8,n,10**9+7)) |
p02554 | s649694757 | Wrong Answer | n = int(input())
def pow(x, n):
ans = 1
n_tmp = n
while n:
if n % 2:
ans *= x
ans %= mod
x *= x
n >>= 1
return ans
mod = 10**9+7 #出力の制限
a = pow(8, n) # 0,9を含まない
b = pow(9, n) # 0 or 9 のどちらかを含む
c = pow(10, n) # 全て
print(c-2*b+a)
|
p02554 | s415516892 | Wrong Answer | y=(2**3)-2
x=y*9**(y-2)%(10**9+7)
if x<10**10:print(x)
else:print('ERROR') |
p02554 | s976480161 | Wrong Answer | N = int(input())
d = 1000000007
result = (10 ** N) % d
result -= (9 ** N) % d
result = result % d
result *= 2
result = result % d
result -= (10 ** N) % d
result += (8 ** N) % d
result = result if result > 0 else d + result
print(result) |
p02554 | s403957318 | Wrong Answer | NUM = 1000000007
N = int(input())
all_colab = pow(10, N)
except_0or9_colab = pow(9, N)
except_0and9_colab = pow(8, N)
print(all_colab - (2*except_0or9_colab - except_0and9_colab)) |
p02554 | s111959934 | Wrong Answer | n = int(input())
mod = (10**9)+7
ans = (10**n)%mod - (2*(9**n)-8**n)%mod
print(ans) |
p02554 | s808548507 | Wrong Answer | n = int(input())
MOD = (10**9) + 7
print(((2**n) - 2) % MOD) |
p02554 | s228627565 | Wrong Answer | n = int(input())
p = 10**9+7
print(pow(10, n, p) - 2*pow(9, n, p) + pow(8, n, p)) |
p02554 | s009358415 | Wrong Answer | # -*- coding: utf-8 -*-
from sys import stdin
input = stdin.readline
def main():
p = 10**9+7
n = int(input().strip())
if 1 < n:
print((n-1)*n)
else:
print(0)
if __name__ == "__main__":
main()
|
p02554 | s274266499 | Wrong Answer | n=(int)(input())
if n<2:
print(0)
else:
ans=(9**n)-2*(8**n)+(7**n)
print(ans%(10**9+7)) |
p02554 | s959640214 | Wrong Answer | def main():
N = int(input())
mod = 10 ** 9 + 7
mod_1 = 1
mod_2 = 1
mod_3 = 1
for _ in range(N):
mod_1 = (mod_1 * 10) % mod
mod_2 = (mod_2 * 9) % mod
mod_3 = (mod_3 * 8) % mod
print(mod_1 - 2 * mod_2 + mod_3)
if __name__ == '__main__':
main()
|
p02554 | s100101930 | Wrong Answer | n = int(input())
mod = 10**9+7
ans = int(((n*(n-1))*(10**(n-2))) % mod)
print(ans) |
p02554 | s389315806 | Wrong Answer | n = 869121
a = 10 ** n - 2 * 9 ** n + 8 ** n
print(a % (10 ** 9 + 7)) |
p02554 | s386613065 | Wrong Answer | n = int(input())
x = 0
i = 0
k = n-2
l = [(i+1)*((9**i) * 10**(k-i)) for i in range(k+1)]
"""
while(k>=i):
x += (i+1)*((9**i) * 10**(k-i))
i += 1
x *= 2
"""
x = sum(l)
x *= 2
print(x%(10**9 + 7))
|
p02554 | s095124627 | Wrong Answer | n=int(input())
m=10**9+7
print((10**n)%m-(9**n)%m-(9**n)%m+(8**n)%m) |
p02554 | s106447179 | Wrong Answer | n = int(input())
mod = (10**9)+7
if n == 1:
print(0)
elif n==2:
print(2)
else:
t = n-2
gyou = (8**t)
xsisu = (10**t)
nankotasuka = t*2
itigyo = (gyou + xsisu*nankotasuka)%mod
tmp = n-1
ans = (tmp*itigyo)%mod
ans = (ans*n)%mod
print(ans) |
p02554 | s472994314 | Wrong Answer | n = int(input())
print((10 ** (n-2) * n * (n - 1) - 4 * n ) % (10 ** 9 + 7)) |
p02554 | s895871043 | Wrong Answer | N = int(input())
mod = 10 ** 9 + 7
print(pow(10, N, mod) - pow(9, N, mod) - pow(9, N, mod) + pow(8, N, mod))
|
p02554 | s569686071 | Wrong Answer | N=int(input())
if N<2:
print(0)
else:
without=10*(N-2)
considered=(without+2)*(without+1)
considered=considered%(1000000007)
print(considered)
|
p02554 | s125244134 | Wrong Answer | N = int(input())
print(N*(N-1)%1000000007) |
p02554 | s947065385 | Wrong Answer | n = int(input())
if n ==0:
print(0)
exit()
print(10**n+8**n-9**n-9**n) |
p02554 | s959753776 | Wrong Answer | N = int(input())
if N == 1:
print(0)
else:
a = (10**N) % (10**9+7)
b = (2*(9**N)) % (10**9+7)
c = (8**N) % (10**9+7)
print(a-b+c) |
p02554 | s190194690 | Wrong Answer | import math
A=int(input())
ANS=0
for i in range(1,A):
ANS=ANS+(math.factorial(A)/((math.factorial(A-i))*(math.factorial(i))))
ANS=ANS+pow(8,A-2)*math.factorial(A)
if A==2:
print(2)
elif ANS>1000000007:
print(int(ANS%1000000007))
else:
print(int(ANS)) |
p02554 | s814165967 | Wrong Answer | n = int(input())
rest = n - 2
MOD = 10 ** 9 + 7
# tmp = 10 ** rest
tmp = 1
for _ in range(rest):
tmp *= 10
tmp %= MOD
ans = n * (n-1) % MOD * tmp % MOD
ans %= MOD
print(int(ans)) |
p02554 | s489043612 | Wrong Answer | num = int(input())
print(2**num - 2) |
p02554 | s667091175 | Wrong Answer | n = int(input())
MOD = 10**9 + 7
print(pow(10, n, MOD)-pow(9, n, MOD) - pow(9, n, MOD) + pow(8, n, MOD)) |
p02554 | s302411756 | Wrong Answer | N = int(input())
MOD = 1000000000 + 7
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
print(str(power_func(10, N, MOD) - 2 * power_func(9, N, MOD) + power_func(8, N, MOD)))
|
p02554 | s347343274 | Wrong Answer | import math
N = int(input())
print(10**N - 2 * 9**N + 8**N) |
p02554 | s787413553 | Wrong Answer | MOD = 10**9 + 7
n = int(input())
def pow(x, n):
res = 1
while n > 0:
if n & 1:
res = res * x % MOD
x = x**2 % MOD
n >>= 1
return res
print(pow(10,n) - pow(9,n)*2 + pow(8,n)) |
p02554 | s454070578 | Wrong Answer | n = int(input(''))-1
mod = 1000000007
cnt= (10**n - 8**n)%mod
#print("{} - {} = {}".format(10**n,8**n,cnt))
print(cnt)
|
p02554 | s126448352 | Wrong Answer | N = int(input())
a = 10**9 + 7
tmp1 = 10**N %a
tmp2 = 2*9**N %a
tmp3 = 8**N %a
answer = tmp1-tmp2+tmp3 %a
print(answer) |
p02554 | s683978054 | Wrong Answer | a = int(input())
mod = 10**9 +7
if a > 1:
num =2**a-2
cum = num % mod
print(cum)
exit()
print(0) |
p02554 | s608831451 | Wrong Answer | import numpy as np
n = int(input())
#print ((n*(n-1)*10**(n-2)) % (1E9+7))
div=1000000007
mod1=n % div
mod2=(n-1) % div
loop=(n-2)//10
amari=(n-2)%10
mod3=1
for i in range(0,loop):
mod3=(mod3*(10000000000 % div) ) % div
mod3=mod3*(10**amari % div)
print((((mod1*mod2) % div)*mod3)%div) |
p02554 | s093778376 | Wrong Answer | N=int(input())
pr=10**9+7
print((pow(10,N,pr)-2*pow(9,N,pr)+pow(8,N,pr)%pr)) |
p02554 | s265669701 | Wrong Answer | N = int(input())
def haha(n):
a = 0
for i in range(n-1):
a += (9**(n-2-i))*(10**(i))
return a*8+10**(n-1)
ans = 0
for i in range(1,N):
ans += haha(i)
print((ans*2)%(10**9+7)) |
p02554 | s937999224 | Wrong Answer | N=int(input())
if N==1:
print(0)
elif N==2:
print(2)
else:
print((2*((10**(N-2)))%(10**9+7))) |
p02554 | s442615408 | Wrong Answer | N = int(input())
ans = 2**N - 2
print(ans%(10**9 + 7)) |
p02554 | s704779991 | Wrong Answer | n = int(input())
s = (10**n-2*(9**n)-8**n)//1000000007
print(10**n-2*(9**n)-8**n) |
p02554 | s727674642 | Wrong Answer | N = int(input())
print(10**N - 2 * 9**N + 8**N) |
p02554 | s089559625 | Wrong Answer | n = int(input())
MOD = int(1e9 + 7)
cnt = n * (n - 1) % MOD
for i in range(n - 2):
cnt *= 9
cnt %= MOD |
p02554 | s691441528 | Wrong Answer | n = int(input())
MOD = (10**9) + 7
num = ((2**(n-1)) - 2)
ans = ((2**(n)) - 2)
res = 10*num*n
print((res - ans) % MOD) |
p02554 | s008136914 | Wrong Answer | n = int(input())
print(10**n - 2*(9**n) + 8**n) |
p02554 | s192047613 | Wrong Answer | import sys
MOD = 10 ** 9 + 7
def main():
input = sys.stdin.buffer.readline
n = int(input())
print(pow(10, n, MOD) - (pow(9, n, MOD) * 2 - pow(8, n, MOD)))
if __name__ == "__main__":
main()
|
p02554 | s783742976 | Wrong Answer | n = int(input())
mod = 10**9 + 7
ans = 10**n % mod
ans -= (2 * 9**n) % mod
ans += (8**n) % mod
print(ans) |
p02554 | s066411700 | Wrong Answer | n = int(input())
MOD = 10**9 + 7
print(pow(10, n, MOD) - 2 * pow(9, n, MOD) + pow(8, n, MOD))
|
p02554 | s798464127 | Wrong Answer | inp = int(input())
comb = inp*(inp-1)
bekiz = comb
Answer = 1
if inp <= 1:
print(0)
elif inp == 2:
print(2)
else:
for i in range(inp-2):
bekiz = bekiz*10%1000000007
Answer = bekiz
print(Answer)
|
p02554 | s166909404 | Wrong Answer | n = int(input())
if n == 1:
print(0)
else:
t = 10**9 + 7
a = (10**n)%t
b = (8**n)%t
c = (9**n)%t
d = 2*(c - b)
print(a-b-d)
|
p02554 | s038961093 | Wrong Answer | n=int(input())
a=(10**n+8**n-2*(9**n))//1000000007
print(a) |
p02554 | s375059968 | Wrong Answer | n =int(input())
Sum=(10**n)-(9**n)-(9**n)+(8**n)
print(Sum)
|
p02554 | s506814564 | Wrong Answer | import sys
input=sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')
def main():
n=II()
a=pow(10,n,10**9+7)
b=pow(9,n,10**9+7)
c=pow(8,n,10**9+7)
print(a-2*b+c)
if __name__=="__main__":
main()
|
p02554 | s993964417 | Wrong Answer | n=int(input())
print(10**n-2*(9**n)+8**n) |
p02554 | s880335336 | Wrong Answer | from operator import mul
from functools import reduce
N = int(input())
MOD = 10**9+7
if N == 1:
print(0)
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, N, MOD)
b = power_func(8, N, MOD)
c = power_func(9, N, MOD)
print((a+b+(-2)*c)%MOD)
|
p02554 | s965912193 | Wrong Answer | n = int(input())
num = 10**9 + 7
print(10**n % num - (9**n%num)*2 + 8**n%num) |
p02554 | s452408914 | Wrong Answer | MOD = 1000000007
def modpow(a, n, mod) :
ret = 1
while n > 0:
if n % 2 == 1:
ret = ret * a % mod
a = a * a % mod
n = n // 2
return ret
N = int(input())
print(modpow(2,10,1000))
if N < 2:
print(0)
elif N == 3:
print(2)
else:
ret1 = modpow(10,N,MOD)
ret2 = modpow(8,N,MOD)
ret3 = modpow(9,N,MOD)
ret = (ret1 - ret3 - ret3 + ret2) % MOD
print(ret) |
p02554 | s719043667 | Wrong Answer | n=int(input())
ans = 0
if n==1:
print(0)
else:
ans = 10**n-9**n-9**n+8**n
ans %= 10**9+7
print(ans) |
p02554 | s711314616 | Wrong Answer | N = int(input())
print((pow(10,N,int(10e9)+7) - 2*pow(9,N,10**9+7) +pow(8, N, 1_000_000_007)) % (pow(10,9) +7))
|
p02554 | s076306005 | Wrong Answer | 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
N = int(input())
a1 = power_func(10,N,10**9+7)
a2 = power_func(9,N,10**9+7)
a3 = power_func(8,N,10**9+7)
print(a1 - 2 * a2 + a3)
#10**N - 2 * 9 ** N + 8 **N |
p02554 | s504851113 | Wrong Answer | n = int(input())
def p(m, n):
k = 1
for i in range(n):
k = (k * m) % (10**9 + 7)
return k
print(p(10, n) - 2*p(9, n) + p(8, n)) |
p02554 | s423343547 | Wrong Answer | n = int(input())
mod = 10**9 + 7
print(pow(10, n, mod) - 2*pow(9, n, mod) - pow(8, n, mod)) |
p02554 | s233091494 | Wrong Answer | print((2**int(input())-2)%1000000007) |
p02554 | s822315651 | Wrong Answer | N=int(input())
ten=1
nine=1
eight=1
mod=10**9+7
for i in range(N):
ten *=10
ten %=mod
nine *=9
nine %=mod
eight *=8
eight %=mod
print(ten-2*nine+eight) |
p02554 | s631056820 | Wrong Answer | from math import factorial
N = int(input())
def combination_count(n,r):
return factorial(n) // (factorial(n-r) * factorial(r))
def mod_calc(x):
if x == 1:
return 0
elif x == 2:
return 2
else:
return int((combination_count(x,2)*(x-2)*10*2) % (10e9 + 7))
print(mod_calc(N)) |
p02554 | s766921357 | Wrong Answer | N = int(input())
print(10**N-2*9**N-8**N) |
p02554 | s901919849 | Wrong Answer | i = int(input())
print(i, (10**i - 9**i - 9**i + 8**i) % (10**9 + 7))
|
p02554 | s621696142 | Wrong Answer | n = int(input())
MOD = 10 ** 9 + 7
print( ((n * (n - 1)) * (10 ** (n - 2)) if n > 1 else 0 ) % MOD ) |
p02554 | s103413572 | Wrong Answer | N = int(input())
def ruizyou(x, n, S=1):
S = 1
for _ in range(n):
S = (S*x)%(1e9+7)
return S
a = int( ruizyou(10, N) + ruizyou(8, N) - ruizyou(9, N)*2 )
print(a) |
p02554 | s388924983 | Wrong Answer | def mypow(x,k,p):
out = 1
while(k > 0):
if(k%2 == 1):
out = out * x % p
k = k // 2
x *= x
return out
p = 10 ** 9 + 7
n = int(input())
res = mypow(10,n,p) - mypow(9,n,p)*2 + mypow(8,n,p)
print(res)
|
p02554 | s960639364 | Wrong Answer | import math
n = int(input())
ans = (2 * 10**(n-2)) % (10**9 + 7)
print(math.floor(ans)) |
p02554 | s156501610 | Wrong Answer | N = int(input())
a = 10**N - 8**N - 2*9**N
b = a % (10**9 + 7)
print(b) |
p02554 | s231472236 | Wrong Answer | n=int(input())
a=1000000007
ans=10**n%a-9**n%a-9**n%a+8**n%a
print(ans) |
p02554 | s140352237 | Wrong Answer | N = int(input())
comb = 10**N-2*(9**N-8**N)
print(comb%(10**9+7)) |
p02554 | s805212974 | Wrong Answer | N = int(input())
mod = 10**9+7
print(10**N%mod-(2*9**N%mod-8**N%mod)) |
p02554 | s753553259 | Wrong Answer | N = int(input())
MOD = 7+10**9
ans = (10**N) % MOD
ans = (ans + (8**N)) % MOD
ans = (ans - (2*(9**N))%MOD)
print(ans) |
p02554 | s634390434 | Wrong Answer | def main():
n = int(input())
if n == 1:
print(0)
return 0
com = n*(n-1)
print(com*(10**(n-2)) % (int(1e9)+7))
if __name__ == '__main__':
main() |
p02554 | s988109478 | Wrong Answer | M = 10**9+7
N = int(input())
print(pow(10,N,M)-pow(9,N,M)-pow(9,N,M)+pow(8,N,M)) |
p02554 | s694063472 | Wrong Answer |
import math
mod=10**9+7
N=int(input())
if(N==1):
print(0)
else:
a=10**N-9**N*2+8**N
if(a>mod):
b=a//mod
print(b)
else:
print(a) |
p02554 | s894344008 | Wrong Answer | N = int(input())
mod = 10**9+7
ans = pow(10, N, mod) - 2*pow(9, N, mod) + pow(8, N, mod)
print(ans) |
p02554 | s534789825 | Wrong Answer | import sys
import itertools
# import numpy as np
import time
import math
from heapq import heappop, heappush
from collections import defaultdict
from collections import Counter
from collections import deque
from itertools import permutations
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
N = int(input())
ans = (10 ** N) % MOD - (9 ** N) * 2 % MOD + (8 ** N) % MOD
print(ans) |
p02554 | s454216759 | Wrong Answer | import sys
import math
input = sys.stdin.readline
n = int(input())
if n == 1:
print(0)
else:
print(((n**2)-2)%10000000007) |
p02554 | s835305922 | Wrong Answer | import sys
from heapq import heappush, heappop, heapify
import math
from math import gcd
import itertools as it
from collections import deque
input = sys.stdin.readline
def inp():
return int(input())
def inpl():
return list(map(int, input().split()))
def dbg(o):
print(o, file=sys.stderr)
# ---------------------------------------
N = inp()
mod = 10**9 + 7
a = 1
b = 1
c = 1
for _ in range(N):
a = (a * 10) % mod
b = (b * 9) % mod
c = (c * 8) % mod
print(a - 2 * b + c)
|
p02554 | s374311703 | Wrong Answer | 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
N = int(input())
MAX = 10 ** 9 + 7
print(power_func(2, N, MAX) - 2) |
p02554 | s057455136 | Wrong Answer | n=int(input())
m=(10**9)+7
a=(n*(n-1))
b=pow(10,n-2)
print((a*b)%m) |
p02554 | s677247472 | Wrong Answer | M = 10**9+7
def p(n, r):
x = 1
for i in range(r):
x *= n - i
x %= M
return x
N = int(input())
tmp = p(N,2)
tmp2 = (10**(N-2)) %M
#print(tmp)
tmp3 = (2**(N-2)) %M
if N==1:
print(0)
elif N==2:
print(2)
else:
a = tmp*tmp2
b = tmp*tmp3//2
print((a%M-b%M)%M) |
p02554 | s754285023 | Wrong Answer | mod=10**9
n=int(input())
print((pow(10,n,mod)-(2*pow(9,n,mod)-pow(8,n,mod)))%mod) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.