problem_id
stringclasses 100
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 6
806
|
|---|---|---|---|
p02554
|
s033698858
|
Wrong Answer
|
# coding: utf-8
#a, b, c, d = map(int,input().split())
n=int(input())
ans=1
MOD=10**9+7
a=1
b=1
c=1
for i in range(n):
a*=10
a%=MOD
c*=8
c%=MOD
for i in range(n):
b*=9
b%=MOD
print(a-b*2+c)
|
p02554
|
s165615120
|
Wrong Answer
|
N = int(input())
mod = 10**9+7
print(10**N%mod-(2*9**N%mod-8**N%mod))
|
p02554
|
s780799287
|
Wrong Answer
|
n = int(input())
mod = 10 ** 9 + 7
print((10 ** n) - (2 * (9 ** n)) + (8 ** n) % mod)
|
p02554
|
s827268585
|
Wrong Answer
|
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
mod = 1000000007
N = I()
if N == 2:
print(2)
elif N == 1:
print(0)
else:
comb = ((N *(N-1)))
ans = comb * 10 ** (N - 2) % mod
print(int(ans))
|
p02554
|
s249853774
|
Wrong Answer
|
N = input()
x = int(N)
y = x*(x-1)*(10**(x-2))
z = y % (10^9+7)
print(z)
|
p02554
|
s795308910
|
Wrong Answer
|
inf = pow(10,9)+ 7
n=int(input())
if n==1:
print(0)
elif n==2:
print(1)
else:
f=pow(10,n,inf) - 2*pow(9,n,inf) + pow(8,n,inf)
print(f%inf)
|
p02554
|
s181353691
|
Wrong Answer
|
N = int(input())
a=10**N -2*(9**N) + 8**N
print(a)
|
p02554
|
s794052849
|
Wrong Answer
|
S=lambda:input()
I=lambda:int(input())
L=lambda:list(map(int,input().split()))
LS=lambda:list(map(str,input().split()))
n=I()
mod=10**9+7
nP2=n*(n-1)
eights=pow(8,n-2,mod)
ans=(nP2*eights)%mod
print(ans)
|
p02554
|
s499804738
|
Wrong Answer
|
n = int(input())
ans = ((2 << n - 1) - 2) % 1000000007
print(ans)
|
p02554
|
s532451991
|
Wrong Answer
|
MOD = 10**9 + 7
n = int(input())
ans = pow(10, n, MOD) - pow(9, n, MOD) * 2 + pow(8, n, MOD)
print(ans)
|
p02554
|
s216701480
|
Wrong Answer
|
n = int(input())
ans1 = 10 ** (n-2)
ans2 = n * (n-1)
mod = 10**9 + 7
final_answer = int(ans1 * ans2 % mod)
print(final_answer)
|
p02554
|
s776883615
|
Wrong Answer
|
N = int(input())
d = 10**9 + 7
print(pow(10, N, d) - pow(9, N, d)*2 + pow(8, N, d))
|
p02554
|
s668433054
|
Wrong Answer
|
def pf(a,n,p):
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())
mod=10**9+7
ans=pf(10,N,mod)-pf(9,N,mod)*2+pf(8,N,mod)
print(ans)
|
p02554
|
s205414025
|
Wrong Answer
|
from math import comb
t = int(input())
mod = 10**9 + 7
ans = 0
for i in range(1, t):
ans = (ans + comb(t,i)%mod)%mod
print(ans)
|
p02554
|
s092530093
|
Wrong Answer
|
n = int(input())
if n == 1:
ans = 0
else:
ans = ((10 ** (n - 1) + (10 ** (n - 2) * 9)) * 2 - (10 ** n - 8 ** 2)) % (10 ** 9 + 7)
print(ans)
|
p02554
|
s658835718
|
Wrong Answer
|
N = int(input())
mod = 10 ** 9 + 7
nn = (10 ** N) % mod
nm = 2 * (9 ** N) % mod - (8 ** N) % mod
print(nn - nm)
|
p02554
|
s577547636
|
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
print(answer)
|
p02554
|
s524297406
|
Wrong Answer
|
n = int(input())
if (n == 1)or(n==0):
print(0)
else:
if n==2:
print(2)
else:
ans = (10**(n-3))*54
print(ans)
|
p02554
|
s095001169
|
Wrong Answer
|
N = input()
N = int(N)
if N == 0 or N == 1:
print(0)
else:
print(((10 ** (N-2)) * (N * (N-1))) % (10**9+7))
|
p02554
|
s253817695
|
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
|
s573611409
|
Wrong Answer
|
N=int(input())
mod=10**9+7
print(pow(10,N,mod)-pow(9,N,mod)*2+pow(8,N,mod))
|
p02554
|
s157891641
|
Wrong Answer
|
N=869121
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
|
s138152428
|
Wrong Answer
|
import numpy as np
N = int(input())
MOD = 1000000007
if N==1 or N==0:
ans=0
elif N==2:
ans =2
else:
ans = ( ( N*(N-1) ) %MOD ) * ( ( 10**(N-2) - (N-2)*(N-3) )%MOD)
ans = ans % MOD
print(ans)
|
p02554
|
s674223884
|
Wrong Answer
|
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
def main():
N = int(input())
if N == 1:
print(0)
return
ans = cmb(N, 2) * 2 * (10 ** (N-2))
ans = ans % (10 ** 9 + 7)
#print(10 ** 9 + 7)
#print(cmb(N, 2) * 2)
print(ans)
return
main()
|
p02554
|
s082324598
|
Wrong Answer
|
n = int(input())
mod = 10**9 + 7
ans = 0
ans += 10**n % mod
ans -= 2*9**n % mod
ans += 8**n % mod
print(ans)
|
p02554
|
s097950303
|
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
|
s139319840
|
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
|
s914052877
|
Wrong Answer
|
n=int(input())
m=10**9+7
if n==1:
print(0)
else:
print(((2**(n-1)-2)*10+2)%m)
|
p02554
|
s265849704
|
Wrong Answer
|
def main():
n = int(input())
mod = 10**9+7
print((pow(10,n,mod)-2 * pow(9,n,mod) + pow(8,n,mod)%mod))
if __name__ == "__main__":
main()
|
p02554
|
s067805587
|
Wrong Answer
|
n = int(input())
if n==1:
print(0)
elif n==2:
print(2)
else:
com = (n-1)*(n)*((8)**(n-2))
res = (com)
mod = (10**9) + 7
answer = res % mod
print(answer)
|
p02554
|
s186469472
|
Wrong Answer
|
N=int(input())
if N<2:
print(0)
else:
without=10*(N-2)
considered=(without+2)*(without+1)
print(considered%(10**9+7))
|
p02554
|
s423834300
|
Wrong Answer
|
import math
n = int(input())
if n==1:
print(0)
else:
m = math.factorial(n) // (math.factorial(n - 2) * math.factorial(2))
if m == 1:
print(2)
else:
print((m-2)*10 % 1000000007)
|
p02554
|
s481012570
|
Wrong Answer
|
mod = 10**9+7
N = int(input())
a,b,c = 1, 1, 1
for _ in range(N):
a *= 10
b *= 9
c *= 8
a %= mod
b %= mod
c %= mod
ans = a - b - b + c
if ans < 0:
ans += mod
print(ans)
|
p02554
|
s361574079
|
Wrong Answer
|
N = int(input())
x = (2**N-2)%(10**9+7)
print(x)
|
p02554
|
s458374907
|
Wrong Answer
|
N = int(input())
mod = 10**9+7
a = pow(10,N,mod)
b = pow(8,N,mod)
c = pow(9,N,mod)
ans = a-2*c+b
if ans<0:
ans += mod
else:
ans %= mod
print(ans)
|
p02554
|
s456494909
|
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
|
s188485554
|
Wrong Answer
|
n=int(input())
M=10**9+7
print((pow(10,n,M)-pow(8,n,M))%M)
|
p02554
|
s974153149
|
Wrong Answer
|
N = int(input())
_or = 9**N
_and = 8**N
wa = (9**N) * 2 - 8**N
ans = 10**N - wa
print(ans)
|
p02554
|
s412662476
|
Wrong Answer
|
mod = 10**9 + 7
n = int(input())
total = 0
for x in range(n):
total += x
ans = int((total * 2) * (pow(10, (n-2))))
print(ans % mod)
|
p02554
|
s107656176
|
Wrong Answer
|
N = int(input())
divisor = 10**9 + 7
if N == 1:
print(0)
exit(0)
from math import comb
ans = (10**(N) - 9**N) % divisor
print(ans)
|
p02554
|
s320751934
|
Wrong Answer
|
n=int(input())
if n<2:
print(0)
else:
mod=10**9+7
init=(n*(n-1))%mod
more=pow(10,n-2,mod)
print((init*more*2)%mod)
|
p02554
|
s519546699
|
Wrong Answer
|
N = int(input())
mod = 10 ** 9 + 7
res = (10 ** N) % mod
res -= (9 ** N) % mod # no 9
res -= (9 ** N) % mod # no 0
res += (8 ** N) % mod # no 9 and no 0
print(res)
|
p02554
|
s975116379
|
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%MOD)
|
p02554
|
s823690080
|
Wrong Answer
|
N = int(input())
mod = 10 ** 9 +7
x = (10**N)%mod
y = (2*(9**N))%mod
z = 8**N%mod
print(x-y+z)
|
p02554
|
s076256547
|
Wrong Answer
|
N = int(input())
mod = 10**9+7
if N == 1:
print(0)
elif N == 2:
print(1)
else:
tmp = (2*(pow(10,N,mod)-pow(9,N,mod))-(pow(10,N,mod)-pow(8,N,mod)))
print(tmp)
|
p02554
|
s957346740
|
Wrong Answer
|
N=int(input())
mod=10**9+7
l=[1]*3
for _ in range(N):
l[0]=(l[0]*10)%mod
l[1]=(l[1]*9)%mod
l[2]=(l[2]*8)%mod
ans=l[0]+l[2]-2*l[1]
print(ans)
|
p02554
|
s019103458
|
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
|
s730368782
|
Wrong Answer
|
N = int(input())
MOD = 1000000007
A = pow(10, N, MOD)
B = pow(9, N, MOD)
C = pow(8, N, MOD)
X = A - 2 * B + C
print(X)
|
p02554
|
s686599382
|
Wrong Answer
|
n = int(input())
mod=10**9+7
ans = pow(10,n,mod)
ans =- pow(2*9,n,mod)
ans =+ pow(8,n,mod)
print(ans%mod)
|
p02554
|
s674899916
|
Wrong Answer
|
N = int(input())
print(((N*(N-1))*(10**(N-2)))%1000000007)
|
p02554
|
s860494718
|
Wrong Answer
|
# -*- coding: utf-8 -*-
from scipy.special import comb
a = int(input())
mod = 10**9 + 7
x = comb(a, 2, exact=True)
if a <= 1:
print(0)
exit(0)
elif a == 2:
print(2)
exit(0)
else:
s = x*2 * (10**(a-2)) % mod
print(s)
|
p02554
|
s600363959
|
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
|
s933779379
|
Wrong Answer
|
n = int(input())
val1 = 10
val2 = 9
val3 = 8
for i in range(n-1):
val1 = (val1*10)%(10**9+7)
val2 = (val2*9)%(10**9+7)
val3 = (val3*8)%(10**9+7)
print(val1-2*val2+val3)
|
p02554
|
s137257780
|
Wrong Answer
|
import itertools
n = int(input())
nums = ["0", "9"]
if n == 1:
print(0)
elif n == 2:
print(2)
else:
for i in range(n-len(nums)):
nums.append("x")
count = 0
for v in itertools.permutations(nums, len(nums)):
check = list(v)
count += 9**check.count("x")
print(count%(10**9+7))
|
p02554
|
s863616116
|
Wrong Answer
|
mod=1000000007
n=int(input())
def pow_by_iter(a, x, p):
acc = a
for i in range(1, x):
acc = (acc * a) % p
return acc
if n>2:
print(((n%mod)*((n-1)%mod)*(10**(n-2)))%mod)
else:
print(n*(n-1))
|
p02554
|
s972696065
|
Wrong Answer
|
n = int(input())
ans_max = 1
for i in range(n):
ans_max = ans_max * 10 % 1000000007
ans_mid = 1
for i in range(n):
ans_mid = ans_mid * 9 % 1000000007
ans_mid = ans_mid * 2 % 1000000007
ans_min = 1
for i in range(n):
ans_min = ans_min * 8 % 1000000007
print(ans_max - (ans_mid - ans_min))
|
p02554
|
s264600370
|
Wrong Answer
|
N = int(input())
mod = 10**9 + 7
ans = pow(10,N,mod)
ans -= pow(9,N,mod)
ans -= pow(9,N,mod)
ans += pow(8,N,mod)
print(ans)
|
p02554
|
s690492617
|
Wrong Answer
|
import math
def con(n):
return math.factorial(n) // (math.factorial(n-2)*2)
n = int(input())
if n ==1:
print("0")
elif n == 2:
print('2')
elif n>2:
a=con(n)
x=2*pow(8,(n-2))*a
y=pow(2, (n-2))*a
z=x+y
b=pow(10,9)+7
ans = z%b
print(ans)
|
p02554
|
s840816873
|
Wrong Answer
|
#!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
n = int(input())
mod = pow(10,9) + 7
ans = pow(10,n,mod)
ans -= pow(9,n,mod)*2
ans += pow(8,n,mod)
print(ans)
if __name__ == '__main__':
main()
|
p02554
|
s328090657
|
Wrong Answer
|
import math
mod=10**9+7
N=int(input())
if(N==1):
print(0)
else:
if(N-2>10):
a=10**(N-2)%mod
b=math.factorial(N) // math.factorial(N-2)
c1=b*a%mod
print(c1)
else:
a=10**(N-2)
b=math.factorial(N) // math.factorial(N-2)
c=b*a
print(c)
|
p02554
|
s212418241
|
Wrong Answer
|
mod=1000000007
n=int(input())
def pow_by_iter(a, x, p):
acc = a
for i in range(1, x):
acc = (acc * a) % p
return acc
print(pow_by_iter(10, n, mod)+pow_by_iter(8, n, mod)-pow_by_iter(9, n, mod)-pow_by_iter(9, n, mod))
|
p02554
|
s955812720
|
Wrong Answer
|
N = int(input())
mod = 10 ** 9 + 7
nn = 10 ** N % mod
nm = 2 * (9 ** N) % mod - (8 ** N) % mod
print(nn - nm)
|
p02554
|
s194658120
|
Wrong Answer
|
def modpow(a, n, mod):
res = 1
while n:
if n % 2:
res = res * a % mod
a = a * a % mod
n >>= 1
return res
MOD = 1000000007
n = int(input())
ans = modpow(10, n, MOD) - 2 * modpow(9, n, MOD) + modpow(8, n, MOD)
print(ans)
|
p02554
|
s563265640
|
Wrong Answer
|
N = int(input())
MOD = 10 ** 9 + 7
if N == 1:
print(0)
exit()
a = pow(10, N, MOD)
b = pow(9, N, MOD)
c = pow(8, N, MOD)
ans = a - (2 * b) + c
if ans < 0:
ans += MOD
print(ans)
|
p02554
|
s996992468
|
Wrong Answer
|
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
N = int(input())
mod = 10**9+7
if N==1:
print(0)
else:
temp =modpow(10,N-2,mod)
print (temp*N*(N-1)%mod)
|
p02554
|
s512497101
|
Wrong Answer
|
p = 10 ** 9 + 7
N = int(input())
fact = [1, 1]
factinv = [1, 1]
inv = [0, 1]
for i in range(2, N + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((factinv[-1] * inv[-1]) % p)
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
n = N
b = 0
for a in range (1,N):
b = b + cmb(n, a, p)
print(b%p)
|
p02554
|
s851233245
|
Wrong Answer
|
n=int(input())
if n==1:
print(0)
else:
print((10**n-(8*9**(n-1))-2*(9**(n-1)))%(10**9+7))
#print(8*10**(n-1))
#print(2*(9**(n-1)))
|
p02554
|
s806958407
|
Wrong Answer
|
n = int(input())
p = 10 ** 9 + 7
def pow(a):
ans = 1
for i in range(n):
ans = (ans * a) % p
return ans
x = pow(10) - pow(9) * 2 + pow(8)
print(x)
|
p02554
|
s208503809
|
Wrong Answer
|
mod = 1000000007
def f(a, b):
ans = 1
while b:
ans = ans * a % mod
b >>= 1
a = a * a % mod
return ans
n=int(input())
print(((f(10,n)-2*f(9,n)+f(8,n))%mod+mod)%mod)
|
p02554
|
s792738134
|
Wrong Answer
|
mod = 7 + 10e9
n = int(input())
if n == 1:
print(0)
elif n == 2:
print(2)
else:
ans = pow(10,n-2)
print(ans%n)
|
p02554
|
s542040223
|
Wrong Answer
|
N=2
if N<2:
print(0)
elif N==2:
print(2)
else:
without=10**(N-2)
each=N*(N-1)
final=without*each
considered=final%(10**9+7)
print(considered)
|
p02554
|
s529436716
|
Wrong Answer
|
n = int(input())
print(10**n-2*9**n+8**n)
|
p02554
|
s612756978
|
Wrong Answer
|
N = int(input().rstrip())
answer = 0
for i in range(2, N + 1):
a = N - i
answer += i * (i - 1) * ((10 ** a) % 1000000007)* (8 ** (i - 2) % 1000000007)
#式が間違っている
print(answer % 1000000007)
|
p02554
|
s747547819
|
Wrong Answer
|
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))
|
p02554
|
s508124306
|
Wrong Answer
|
import math
n = int(input())
mod = 10**9 + 7
kaijou = math.factorial(n)
tmp = 10**(n-2)
if n == 1:
print('0')
elif n == 2:
print('2')
else:
ans = kaijou * tmp % mod
print(ans)
|
p02554
|
s618107065
|
Wrong Answer
|
N = int(input())
p = N*(N-1) #0,9の並べ方総数
a = p*(10**(N-2))
b = 10**9 + 7
ans = a % b
print(ans)
|
p02554
|
s935455588
|
Wrong Answer
|
N=int(input())
print(10**N-2*9**N+8**N)
|
p02554
|
s246843392
|
Wrong Answer
|
N = int(input())
MOD = 10 ** 9 + 7
if N == 1:
print(0)
exit()
a = 1
b = 1
c = 1
for i in range(N):
a = a * 10 % MOD
b = b * 9 % MOD
c = c * 8 % MOD
ans = a - 2 * b + c
if ans < 0:
ans += MOD
print(ans)
|
p02554
|
s866845455
|
Wrong Answer
|
n = int(input())
mod = 10 ** 9 + 7
print((10 ** n - 2 * (9 ** n) - 8 ** n) % mod)
|
p02554
|
s563734441
|
Wrong Answer
|
N = int(input())
mod = 10 ** 9 + 7
nn = 10 ** N % mod
nm = (9 ** N) % mod + (9 ** N) % mod - (8 ** N) % mod
print(nn - nm)
|
p02554
|
s020402210
|
Wrong Answer
|
n = int(input())
mod = 10 ** 9 + 7
print((10 ** n) % mod - (9 ** n) % mod * 2 + 8 ** n % mod)
|
p02554
|
s721715883
|
Wrong Answer
|
# -*- coding: utf-8 -*-
# a, b, c, d = map(int,input().split())
n = int(input())
ret = ((8 ** (n - 2)) * 2) * ((n * (n - 1)) // 2)
print(ret % ((10 ** 9) + 7))
|
p02554
|
s833416629
|
Wrong Answer
|
N = int(input())
mod = 1000000007
ans = N * (N-1) * (10**(N-2))
if ans <= 0:
ans = 0
if N == 2:
ans = 2
print(ans % mod )
|
p02554
|
s582634686
|
Wrong Answer
|
n = int(input())
print(((10**n)%1000000007)-((9**n)%1000000007)-((9**n)%1000000007)+((8**n)%1000000007))
|
p02554
|
s962183013
|
Wrong Answer
|
N = int(input())
Num = N * (N-1) * 10 **(N-2)
Answer = Num %(1000000007)
print(Answer)
|
p02554
|
s977968472
|
Wrong Answer
|
# -*- coding: utf-8 -*-
"""
Created on Sun Sep 13 21:20:10 2020
@author: naoki
"""
N = int(input())
if N>=2:
print(abs(10**N%(10**9+7) - ((9**N *2)%(10**9+7) - (8**N)%(10**9+7))))
else:
print(0)
|
p02554
|
s680565009
|
Wrong Answer
|
n = int(input())
mod = 10**9 + 7
print(pow(10, n, mod) - 2*pow(9, n, mod) - pow(9, n, mod))
|
p02554
|
s486039406
|
Wrong Answer
|
print(2**int(input())-2)
|
p02554
|
s746076180
|
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
print(x)
|
p02554
|
s668929116
|
Wrong Answer
|
import math
N=int(input())
if(N==1):
print(0)
else:
a=10**(N-2)
b=math.factorial(N)*2 // (math.factorial(2) * math.factorial(N-2))
c=b*a
if(c>10**9+7):
c1=c%10**9+7
print(c1)
else:
print(c)
|
p02554
|
s997225370
|
Wrong Answer
|
N = input()
N = int(N)
if N == 0 or N == 1:
print(0)
else:
print(((10 ** (N-2)) * (N * (N-1))) % (10 ** 9 + 7))
|
p02554
|
s907364153
|
Wrong Answer
|
n = int(input())
num1 = 10**n % (10**9 + 7)
num2 = 9**n % (10**9 + 7)
num3 = 8**n % (10**9 + 7)
print(num1 - num2 * 2 + num3)
|
p02554
|
s862095003
|
Wrong Answer
|
#C - Ubiquity
import math
N = int(input())
a = 10**9+7
ans = (10**N)-9**N - 8**N
# def combinations_count(n, r):
# return math.factorial(n)%a // (math.factorial(n - r)%a * math.factorial(r))%a
#
# ans =(10**(N-2))%a*(combinations_count(N, 2)*2)%a-combinations_count(N, 2)%a
print(ans%a)
|
p02554
|
s894533594
|
Wrong Answer
|
N = int(input())
mod = 10**9+7
print(10**N%mod-(9**N%mod+9**N%mod-8**N%mod))
|
p02554
|
s930825186
|
Wrong Answer
|
n=int(input())
y=(2**n)-2
x=y*9**(y-2)%(10**9+7)
if x<10**10:print(x)
else:print('ERROR')
|
p02554
|
s463360906
|
Wrong Answer
|
N = int(input())
MOD = 10 ** 9 + 7
if N == 1:
print(0)
exit()
a = 1
b = 1
c = 1
for i in range(N):
a = a * 10 % MOD
b = b * 9 % MOD
c = c * 8 % MOD
ans = a - (2 * b) + c
if ans < 0:
ans += MOD
print(ans)
|
p02554
|
s045872495
|
Wrong Answer
|
n = int(input())
mod = 10 ** 9 + 7
ans = 10 ** n
print(max(0, ans - 10 * (8 ** (n - 1)) % mod - (9 ** (n - 1) * 2) % mod ) % mod)
|
p02554
|
s565578311
|
Wrong Answer
|
N=int(input())
if N==1 or N==0:
print(0)
exit()
elif N==2:
print(2)
exit()
print(N*(N-1)*10**(N-2)%(10**9+7))
|
p02554
|
s255459231
|
Wrong Answer
|
n = int(input())
mod = 10**9+7
def pow(n, num):
s = num
for i in range(1,num):
s = s*num%mod
return s
print((pow(n,10) - 2*pow(n,9) + pow(n,8))%mod)
|
p02554
|
s740548470
|
Wrong Answer
|
n = int(input())
b = 0
a = 1
if n == 1:
print(0)
exit()
elif n == 2:
print(2)
exit()
for i in range(n-1):
b += a
a += 1
print((b*20) % (10**9 + 7))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.