problem_id
stringclasses 100
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 6
806
|
|---|---|---|---|
p02554
|
s739096528
|
Wrong Answer
|
import math
n = int(input())
if n == 1:
print(0)
else:
print(10**(n-2)*(math.factorial(n))%(10**9+7))
|
p02554
|
s920081892
|
Wrong Answer
|
N = int(input())
print(pow(10,N,1000000007)-2*pow(9,N,1000000007)+pow(8,N,1000000007))
|
p02554
|
s195023311
|
Wrong Answer
|
N = int(input())
mod = 10 ** 9 + 7
ans=(10**N)%mod-(9**N)%mod-(9**N)%mod+(8**N)%mod
print(ans)
|
p02554
|
s170115568
|
Wrong Answer
|
n = int(input())
mod = 1000000007
a = 1
b = 1
w = 1
for i in range(n):
a *= 9
b *= 8
w *= 10
a %= mod
b %= mod
w %= mod
ex = a * 2 - b
if ex < 0:
ex += mod
ans = w - ex
if ans < 0:
ans += mod
print(ans)
|
p02554
|
s498020440
|
Wrong Answer
|
n = int(input())
if(n == 1):
print(0)
elif(n==2):
print(2)
else:
print((n*(n-1)+10**(n-2))%(10**9+7))
|
p02554
|
s706573202
|
Wrong Answer
|
n = int(input())
ans = 0
ans += 8**(n-2) % (10**9 + 7)
print(ans)
|
p02554
|
s153656421
|
Wrong Answer
|
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-b*2+c)
|
p02554
|
s985443590
|
Wrong Answer
|
n=int(input())
mod=10**9+7
ans=pow(n,10,mod)
ans-=2*pow(n,9,mod)
ans+=pow(n,8,mod)
print(ans%mod)
|
p02554
|
s160272755
|
Wrong Answer
|
n = int(input())
def modpow(a, n):
mod = 10 ** 9 + 7
res = 1
while n > 0:
if n & 1:
res = res * a % mod
a = a * a % mod
n >>= 1
return res
print(modpow(10, n) - 2 * modpow(9, n) + modpow(8, n))
|
p02554
|
s604373698
|
Wrong Answer
|
N = int(input())
if N < 2:
print(0)
exit()
N = N - 2
result = 2 * (10 ** N)
result = result % ((10 ** 9)+ 7)
print(result)
|
p02554
|
s132574485
|
Wrong Answer
|
n=int(input())
mod=10**9+7
print(pow(10,n,mod)-2*pow(9,n,mod)+pow(8,n,mod))
|
p02554
|
s799876827
|
Wrong Answer
|
n = int(input())
def modpow(x, y):
mod = 1000000007
res = 1
for i in range(y):
res = res * x % mod
return res
ten = modpow(10, n)
nine = modpow(9, n)
eight = modpow(8, n)
ans = ten - nine - nine + eight
print(ans)
|
p02554
|
s718080507
|
Wrong Answer
|
N = int(input())
mod = 10 ** 9 + 7
e = pow(8, N, mod)
f = pow(9, N, mod)
g = pow(10, N, mod)
# 全体 - (0を含まない + 9を含まない) + 0と9どちらも含まない
ans = g - 2 * f + e
print(ans)
|
p02554
|
s578849047
|
Wrong Answer
|
n = int(input())
MOD = 10**9+7
ans = pow(10, n, MOD) - pow(9, n, MOD) + pow(10, n, MOD) - pow(9, n, MOD) - (pow(10, n, MOD) - pow(8, n, MOD))
print(ans)
|
p02554
|
s087696416
|
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
|
s815390469
|
Wrong Answer
|
N = int(input())
result = N * (N - 1)
result = result * (10 ** (N - 2))
result = result % (10 ** 9 + 7)
print(result)
|
p02554
|
s118062456
|
Wrong Answer
|
N = int(input())
print(10**N - (9**N + 9**N- 8**N))
|
p02554
|
s942011084
|
Wrong Answer
|
N = int(input())
mod = 10**9+7
print(pow(10, N, mod) - (pow(9, N, mod) * 2 - pow(8, N, mod)))
|
p02554
|
s726881326
|
Wrong Answer
|
mod = 10**9+7
N = int(input())
if N == 1:
print(0)
exit()
plus = 1
minus = 1
cap = 1
for _ in range(N):
plus *= 10
minus *= 9
cap *= 8
plus %= mod
minus %= mod
cap %= mod
print(plus-2*minus+cap)
|
p02554
|
s409693789
|
Wrong Answer
|
n = int(input())
if n == 1 or n == 2:
print(n * (n-1))
else:
print((10 * n * (n - 1) - (4 * n)) % (10 ** 9 + 7))
|
p02554
|
s222255735
|
Wrong Answer
|
n = int(input())
if (n == 1)or(n==0):
print(0)
else:
xn = n-2
a10 = 2*10**xn
if n != 2:
a9 = (9**(n-2)*(n-1)*2)
else:
a9 = 0
ans = (a10+a9)%((10**9)+7)
print(ans)
|
p02554
|
s180974687
|
Wrong Answer
|
n=int(input())
ans=10**n-2*9**n+8**n
print(ans)
|
p02554
|
s783886218
|
Wrong Answer
|
n = int(input())
mod = 10 ** 9 + 7
print(pow(10, n, mod) - 2 * pow(9, n, mod) + pow(8, n, mod))
|
p02554
|
s064591024
|
Wrong Answer
|
N=int(input())
if N<2:
print(0)
elif N==2:
print(2)
else:
without=10**(N-2)
each=N*(N-1)
final=without*each
considered=final%(1000000007)
print(int(considered))
|
p02554
|
s132580968
|
Wrong Answer
|
n = int(input())
mod = 10 ** 9 + 7
re = (10 ** n) - (2 * (9 ** n)) + (8 ** n)
if n == 1:
print(0)
else:
print(re)
|
p02554
|
s151008502
|
Wrong Answer
|
n = int(input())
ans = 0
for i in range(n):
if i == 0:
ans = 1
else:
ans *= 2
|
p02554
|
s102937974
|
Wrong Answer
|
n = int(input())
mod = 1000000007
print(pow(10, n, mod) - pow(9, n, mod) - pow(9, n, mod) + pow(8, n, mod))
|
p02554
|
s705059284
|
Wrong Answer
|
# -*- using:utf-8 -*-
def factorial_cor(n):
fact = 1
for integer in range(1, n + 1):
fact *= integer
return fact
if __name__ == "__main__":
MOD = 1000000007
N = int(input())
if N == 1:
print(0)
elif N == 2:
print(2)
else:
C = factorial_cor(N)
ten = 10 ** (N - 2) * C
ans = C % MOD
print(int(ans))
|
p02554
|
s134903167
|
Wrong Answer
|
from collections import defaultdict
from collections import deque
from collections import Counter
import math
import itertools
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
n = readInt()
if n==1:
print(0)
exit()
mod = 10**9+7
a = pow(10,n,mod)
b = pow(8,n,mod)
c = pow(9,n,mod)
print(a-2*c+b)
|
p02554
|
s517067510
|
Wrong Answer
|
N=int(input())
if N<2:
print(0)
else:
without=10**(N-2)
each=N*(N-1)
final=without*each-each
considered=final%(10**9+7)
print(considered)
|
p02554
|
s952150091
|
Wrong Answer
|
# -*- coding: utf-8 -*-
MOD=1000000007
x = int(input())
n1 = (10**x)%MOD
n2 = 2*9**x%MOD
n3 = 8**x%MOD
print(n1, n2, n3)
n = n1-n2+n3
print(int(n))
|
p02554
|
s206857861
|
Wrong Answer
|
N=int(input())
mod=10**9+7
ans1=1
ans2=1
ans3=1
ans4=1
ans=0
for x in range(1,N):
for y in range(1,N):
ans1*=(N-(x-1))
ans1%=mod
ans2*=x
ans2%=mod
ans3*=(N-x-(y-1))
ans3%=mod
ans4*=y
ans4%=mod
ans5=8**(N-(x+y))
ans5%=mod
ans+=ans1*ans3*ans5/(ans2*ans4)
ans%=mod
print(ans)
|
p02554
|
s223554436
|
Wrong Answer
|
N = int(input())
mod = int(1e9) + 7
print(pow(10, N, mod) - pow(9, N, mod) - pow(9, N, mod) + pow(8, N, mod))
|
p02554
|
s084634647
|
Wrong Answer
|
mod = (int)(1e9+7)
n = (int)(input())
print(pow(10, n, mod) - 2*pow(9, n, mod) + pow(8, n, mod))
|
p02554
|
s733575732
|
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
|
s184827361
|
Wrong Answer
|
N = int(input())
result = N * (N - 1)
result = (result * (10 ** (N - 2))) % (10 ** 9 + 7)
print(result)
|
p02554
|
s992454024
|
Wrong Answer
|
n = int(input())
MOD = 10**9 + 7
if n == 1:
print(0)
elif n == 2:
print(1)
else:
ans = pow(10, n, MOD) + pow(8, n, MOD) - 2 * pow(9, n, MOD)
print(ans % MOD)
|
p02554
|
s034421571
|
Wrong Answer
|
from math import comb
if __name__=="__main__":
n=int(input())
if n==1:
print(0)
exit
else:
print(comb(n,2)*2)
|
p02554
|
s926613510
|
Wrong Answer
|
mod = 10**9+7
n = int(input())
ans = int((n*(n-1)* 10**(n-2))) % mod
print(ans)
|
p02554
|
s787337795
|
Wrong Answer
|
N = int(input())
ans = (9**N - 2*8**N + 7**N)%(10**9+7)
print(ans)
|
p02554
|
s518193817
|
Wrong Answer
|
import math
n = int(input())
if n < 2:
print(0)
exit()
combs = ((n+7)*(n+6)*(n+5)*(n+4)*(n+3)*(n+2)*(n+1)*(n)*(n-1))/(9*8*7*6*5*4*3*2)
combs *= (n-1)*n
print(int(combs % (10**9 + 7)))
|
p02554
|
s932571354
|
Wrong Answer
|
N = int(input())
# (0.9)確定以外のAnの場合の数 * [(0.9), (9,0)]の２通り * [(0,9),(9,0)]の場合の数
ans = (10 ** (N - 2) * 2 * (N - 1)) % (10 ** 9 + 7)
print(ans)
|
p02554
|
s172356204
|
Wrong Answer
|
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
|
s776525261
|
Wrong Answer
|
n = int(input())
mod = 10**9 + 7
print(pow(10,n,mod) - 2*pow(9,n,mod) + pow(8,n,mod))
|
p02554
|
s981377914
|
Wrong Answer
|
N =int(input())
if ( N==1):
print(0)
if(N>=2):
a=N*(N-1)*(10**(N-2))
print(a%(10^9+7))
|
p02554
|
s837404328
|
Wrong Answer
|
n = int(input())
ans = 0
m = 10**9+7
ans = pow(10,n,m)
ans-=pow(9,n,m)*2
ans+=pow(8,n,m)
print(ans)
|
p02554
|
s732228716
|
Wrong Answer
|
mod=10**9+7
def Ch(n,r):
res=1
for i in range (n,n-r,-1):
res*=(i%mod)
res%=mod
return res
n=int(input())
ans=0
for zero in range(1,9):
for nine in range(1,10-zero):
ans+=((Ch(n,zero)*Ch(n-zero,nine))%mod)*(8**(n-zero-nine)%mod)
ans%=mod
|
p02554
|
s940571300
|
Wrong Answer
|
N = int(input())
s = N * (N-1)
p = 10 ** (N-2)
d = s * p
ans = d % (10 ** 9 + 7)
print(ans)
|
p02554
|
s111694917
|
Wrong Answer
|
def fact(n):
val = 1
for i in range(2, n + 1):
val += i
return val
n = int(input())
if n ==1:
print(0)
elif n == 2:
print(2)
else:
print((fact(n-1)*9**(n-2))%(10**9+7))
|
p02554
|
s090322768
|
Wrong Answer
|
MOD = int(1e9 + 7)
n=int(input())
print(10 ** n % MOD - 9 ** n % MOD - 9 ** n % MOD + 8 ** n % MOD)
|
p02554
|
s334535979
|
Wrong Answer
|
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
MOD = 10**9 + 7
n = int(input())
ret = pow(10, n, MOD)
ret -= pow(9, n, MOD)
ret -= pow(9, n, MOD)
ret += pow(8, n, MOD)
print(ret)
|
p02554
|
s624908289
|
Wrong Answer
|
n = int(input())
MOD = 10**9 + 7
allp = pow(10,n,MOD)
not09 = 2*pow(9,n,MOD)
closs = pow(8,n,MOD)
print(allp - not09 + closs)
|
p02554
|
s650320078
|
Wrong Answer
|
N = int(input())
mod = 10**9+7
if N == 1:
result = 0
else:
result = (10**(N-2) * 2) % mod
print(result)
|
p02554
|
s912698837
|
Wrong Answer
|
import random
N = int(input())
A = []
B = 0
while 0 not in A and 9 not in A:
for i in range(0,N):
A.append(random.randint(0,9))
for j in range(0,N):
B += A[j]*10**j
x = B % 10**9 + 7
print(x)
|
p02554
|
s777070475
|
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 (loop, amari)
print((((mod1*mod2) % div)*mod3)%div)
|
p02554
|
s557270267
|
Wrong Answer
|
x = input()
N = int(x)
if N == 1:
print(0)
else:
z = 10**N - 2*9**N + 8**N
print(z)
|
p02554
|
s274009699
|
Wrong Answer
|
n=int(input())
cnt=(10**n+8**n-2*(9**n))//(10**9+7)
|
p02554
|
s224795776
|
Wrong Answer
|
def powmod(a,n,mod):
ans = 1
while n > 0:
if n & 1: # nの2進数表示の末尾が1か
ans = ans * a % mod
a = a ** 2 % mod # aを2乗する
n >>= 1 # nを2で割る
#print(ans,a,n)
return ans
#2分累乗法 ばらして余りとってかけ算
N=int(input())
m=powmod(10,N,1000000007)-powmod(9,N,1000000007)-powmod(9,N,1000000007)+powmod(8,N,1000000007)
print(m)
|
p02554
|
s838794610
|
Wrong Answer
|
n = int(input())
num = 10**9 + 7
print((10**n)%num - (9**n)*2%num + (8**n)%num)
|
p02554
|
s718808759
|
Wrong Answer
|
N = input()
x = int(N)
y = (x*(x-1)*(10**(x-2))) % (10**9+7)
print(y)
|
p02554
|
s017757822
|
Wrong Answer
|
#!/usr/bin/env pypy3
MODULUS = 10**9+7
N = int(input())
ret = pow(10, N, MODULUS)
ret -= 2*pow(9, N, MODULUS)
ret += pow(8, N, MODULUS)
print(ret)
|
p02554
|
s323163295
|
Wrong Answer
|
n = int(input())
mod = 10**9 +7
if n == 1:
print(0)
elif n == 2:
print(2)
else:
print((10**n%mod)-(8**n%mod))
|
p02554
|
s755071311
|
Wrong Answer
|
N = int(input())
mod = 10**9 + 7
if N == 1:
print(0)
elif N == 2:
print(2)
else:
x = ((N * (N-1))*10**(N-2))
print(x % mod)
|
p02554
|
s389975819
|
Wrong Answer
|
N = int(input())
print(10**N-2*9**N+8**N)
|
p02554
|
s056018300
|
Wrong Answer
|
mod = 1000000007
N = int(input())
A = 1
B = 1
C = 1
for _ in range(1,N+1):
A *= 10
A %= mod
B *= 9
B %= mod
C *= 8
C %= mod
ans = A - (2*B - C)
print(ans)
|
p02554
|
s163906520
|
Wrong Answer
|
import sys
sys.setrecursionlimit(250000)
from scipy.special import comb
# a = comb(n, r)
def main():
# a,b,c,d = map(int, input().split())
n = int(input())
# temp = (10 ** 9 + 7)
# sum = 0
# if n >= 2:
# for i in range(2, n+1):
# a = int(comb(i, 2)) * 2
# a = (a * 8**(i-2)) % temp
# sum = sum + a
# else:
# print(0)
print(10**n - 9**n*2 + 8**n % (10 ** 9 + 7))
main()
|
p02554
|
s442642844
|
Wrong Answer
|
def func(a, n):
p = 10 ** 9 + 7
bi = str(format(n, "b"))
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())
n = func(10, N)
no_0 = func(9, N)
no_9 = func(9, N)
no_09 = func(8, N)
ans = (n - no_0 - no_9 + no_09)
if ans < 0:
ans += 10 ** 9 + 7
print(ans)
|
p02554
|
s720218569
|
Wrong Answer
|
n = int(input())
ans = int(((10 ** (n - 2)) * ((n - 1) * n)) % ((10 ** 9)+ 7))
print(ans)
|
p02554
|
s851251749
|
Wrong Answer
|
n = int(input())
if n == 1:
print(0)
elif n == 2:
print(2)
else :
x = n - 2
combi = (n*(n-1))
ans = ((10 ** x)%(10**9+7) * combi - combi)%(10**9+7)
print(ans)
|
p02554
|
s574370313
|
Wrong Answer
|
import math
from scipy.special import comb
mod = 1000000007
N = int(input())
def Solve(N, n, r):
ans = comb(N, 2, exact=True)*2
for i in range(r):
ans = ans * (n - i) % mod
return ans
print(Solve(N,10*(N-2),N-2))
|
p02554
|
s533247416
|
Wrong Answer
|
#coding:utf-8
N = int(input())
ron = 10 ** 9 + 7
a = (10 ** N) % ron
b = (9 ** N) % ron
c = (9 ** N) % ron
bandc = (8 ** N) % ron
ans = a - b - c + bandc
print("{}".format(ans))
|
p02554
|
s795968609
|
Wrong Answer
|
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
|
s056590549
|
Wrong Answer
|
def pow_r(x, n):
"""
O(log n)
"""
if n == 0: # exit case
return 1
if n % 2 == 0: # standard case ① n is even
return pow_r(x ** 2, n // 2)
else: # standard case ② n is odd
return x * pow_r(x ** 2, (n - 1) // 2)
total = 0
num = int(input())
for i in range(1, num):
total += pow_r(2, i)
print(total)
|
p02554
|
s480057181
|
Wrong Answer
|
N = int(input())
INF = 10 ** 9 + 7
if N < 2:
print(0)
exit()
print(pow(10, N, INF) - 2 * pow(9, N, INF) + pow(8, N, INF))
|
p02554
|
s096942477
|
Wrong Answer
|
from functools import reduce
N = int(input())
mod = 10**9 + 7
def powmod(val, n, mod):
vals = [val]*n
ret = reduce(lambda x, y : x * y % mod, vals)
return ret
# for i in range(n):
# ret = ret * val % mod
return ret
all = powmod(10, N, mod)
b = powmod(9, N, mod)
c = powmod(8, N, mod)
|
p02554
|
s040225198
|
Wrong Answer
|
n=int(input())
print((n*(n-1)*10**(n-2))%1000000007)
|
p02554
|
s804345310
|
Wrong Answer
|
n=int(input())
print((10**n-9**n*2+8**n)%10**9+7)
|
p02554
|
s257599940
|
Wrong Answer
|
MOD = 10**9+7
n = int(input())
print(pow(10, n, MOD)-2*pow(9, n, MOD)+pow(8, n, MOD))
|
p02554
|
s776253988
|
Wrong Answer
|
N=int(input())
MOD=10**9+7
MAX=N+1
def powermod(base,p):
powls=[0 for i in range(MAX)]
powls[0]=1
if powls[p]!=0:
return powls[p]
elif p%2==0:
return (powermod(base,p//2)**2)%MOD
else:
return (powermod(base,p-1)*base)%MOD
print(powermod(10,N)-2*powermod(9,N)+powermod(8,N))
|
p02554
|
s143554476
|
Wrong Answer
|
N=int(input())
MOD=10**9+7
MAX=N+1
def powermod(base,ind):
if ind==1:
return base
elif ind%2==0:
return (powermod(base,ind//2)**2)%MOD
else:
return ((powermod(base,ind//2)**2)*base)%MOD
print(powermod(10,N)-2*powermod(9,N)+powermod(8,N))
|
p02554
|
s164935226
|
Wrong Answer
|
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n = int(input())
mod = 10**9+7
print(pow(10,n,mod)-2*pow(9,n,mod)+pow(8,n,mod))
if __name__=='__main__':
main()
|
p02554
|
s639442293
|
Wrong Answer
|
N = int(input())
ans = (N*(N-1))*(10**(N-2))
ans = ans % (10**9+7)
print(int(ans))
|
p02554
|
s364306962
|
Wrong Answer
|
import math
n = int(input())
summ = 0
mod = 10 ** 9 + 7
sigma = 0
def comb_count(n, r, a):
return math.factorial(n) // \
(math.factorial(n - r) * math.factorial(a) * math.factorial(r - a))
for i in range(2, n + 1):
for t in range(1, i):
z = comb_count(n, i, t)
sigma += z
summ = summ + (sigma * 8 ** (n - i))
summ = summ % mod
print(summ)
|
p02554
|
s454854505
|
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
|
s590862020
|
Wrong Answer
|
N = int(input())
print(10**N-2*9**N+8**N)
|
p02554
|
s882941011
|
Wrong Answer
|
if __name__ == "__main__":
N=int(input())
a = N * (N-1) * 10 ** (N-2)
a = a % (10 ** 9 + 7)
print(a)
|
p02554
|
s254802725
|
Wrong Answer
|
M = 10**9 + 7
def main():
n = int(input())
a = 1
b = 1
c = 1
for i in range(n):
a *= 10
a %= M
b *= 9
b %= M
c *= 8
c %= M
print(a - b - b + c)
if __name__ == '__main__':
main()
|
p02554
|
s376213571
|
Wrong Answer
|
"""AtCoder Beginner Contest 178.
C
"""
import sys
def input() -> str: # noqa: A001
"""Input."""
return sys.stdin.readline()[:-1]
def main():
"""Run."""
mod = 1000000007
n = int(input())
ans = 0
if n <= 1:
ans = 0
elif n == 2:
ans = 2
else:
ans = 10**n
ans -= 8**n
ans -= 8**n
ans += 7**n
print(ans % mod)
main()
|
p02554
|
s445662609
|
Wrong Answer
|
m=10**9+7
n=int(input())
a=(8**n)%m
b=(9**n)%m
c=(10**n)%m
print((2*b-c+a)%m)
|
p02554
|
s419686026
|
Wrong Answer
|
n = int(input())
mod = 10**9+7
a = pow(10,n,mod)
a -= pow(9,n,mod)*2
a += pow(8,n,mod)
print(a)
|
p02554
|
s266319777
|
Wrong Answer
|
import math
n=int(input())
y=pow(10,n)-100*(pow(9,n-1))
y=y%(pow(10,9)+7)
print(y)
|
p02554
|
s692219055
|
Wrong Answer
|
n=int(input(''))
A=10**9+7
if n==1:
print(0)
elif n==2:
print(2)
elif n>=3:
e=1
for i in range(n):
e=e*10
if e>=A:
e=e%A
d=1
for i in range(n):
d=d*8
if e>=A:
e=e%A
r=e-d
if r<A:
r=r+A
print((r)%(10**9+7))
|
p02554
|
s835607372
|
Wrong Answer
|
import sys
input = sys.stdin.readline
def main():
n = int(input())
if n == 1:
ans = 0
else:
mod = pow(10, 9)+7
ans = pow(10, n, mod) + pow(8, n, mod) - 2*pow(9, n, mod)
print(ans)
if __name__ == "__main__":
main()
|
p02554
|
s948681725
|
Wrong Answer
|
n=int(input())
x=(10**n)%(10**9+7)
y=(9**n)%(10**9+7)
z=(8**n)%(10**9+7)
print(z-2*y+x)
|
p02554
|
s671688123
|
Wrong Answer
|
N = int(input())
print((10**N - 9 ** N - 9**N + 8**N) % (10**9 - 7))
|
p02554
|
s985424135
|
Wrong Answer
|
N = int(input())
MOD = 10**9 + 7
def f(x, y): return pow(x, y, MOD)
print(f(10, N) - f(9, N) - f(9, N) + f(8, N))
|
p02554
|
s189771758
|
Wrong Answer
|
n = int(input())
cur = 8
bot = n
t = 0
for i in range(1, n):
t += cur*(bot//i)
cur *= 8
bot *= n-i
print((10**n - 2*t - 8**n)%(10**9+7))
|
p02554
|
s288422254
|
Wrong Answer
|
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)
|
p02554
|
s187658973
|
Wrong Answer
|
import math
n = int(input())
ans = 20**(n-2) % (10**9 + 7)
print(math.floor(ans))
|
p02554
|
s895297394
|
Wrong Answer
|
import sys
#sys.exit()
#sorted( ,reverse=True)
N = int(input())
if N ==1:
print(0)
sys.exit()
#S,T = map(int, input().split())
#A = list(map(int, input().split()))
#A = [int(input()) for _ in range(N)]
c = 10**9+7
total = 10**N
#0と9のみ
a= 8**N
#0のみ、9のみ
b= 1
d = N
for i in range (N-1):
d = d*8
b += d
ans = total - a - b*2
ans2 = ans % c
#cnt = 0
#cnt += 1
print(ans2)
#print(N)
#print(S,T)
#print(A)
#print('Yes')
#print('No')
#print(cnt)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.