problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02554 | s916721149 | 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 | s863853978 | 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 | s307141443 | Wrong Answer | N = int(input())
output1 = (10 ** N) % 1000000007
output2 = (2 * (9 ** N)) % 1000000007
output3 = (8 ** N) % 1000000007
output = output1 - output2 + output3
ouput = output % 1000000007
print(output) |
p02554 | s410049959 | Wrong Answer | def pow_k(x, n):
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
K = K * x
x = x ** 2
n = (n - 1) // 2
else:
x = x ** 2
n = n // 2
return K * x
n = int(input())
ans = n*(n-1)
ans *= pow_k(10,n-2)
if n>2:ans -= n*(n-1)//2
print(ans%1000000007) |
p02554 | s121249534 | Wrong Answer | n = int(input())
print(n*(n-1)*pow(9,n-2,10**9+7)%(10**9+7)) |
p02554 | s056105167 | Wrong Answer | n = int(input())
tmp = n
res=1
ans=0
mod = 10**9+7
for i in range(1,n):
res*=tmp
tmp-=1
ans+=res
ans%=mod
print(ans) |
p02554 | s679673576 | Wrong Answer | mod=1000000007
n=int(input())
print(0 if n==1 else pow(10,n,mod)-1) |
p02554 | s533394070 | Wrong Answer | n=int(input())
if n==1:
print(0)
else:
num=0
k=2
l=8**(n-1)
for i in range(2,n+1):
k*=2
l//=8
num+=(k-2)*l
num%=(10**9+7)
print(num%(10**9+7)) |
p02554 | s348947922 | 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) |
p02554 | s333370242 | Wrong Answer | MOD = int(1e9+7)
N = int(input())
answer = pow(10, N, MOD)
answer -= pow(9, N, MOD) * 2
answer += pow(8, N, MOD)
print(answer)
|
p02554 | s666371009 | Wrong Answer | n=int(input())
mod=10**9+7
print(pow(10,n,mod)-2*pow(9,n,mod)+pow(8,n,mod)) |
p02554 | s661873401 | Wrong Answer | import math
MOD = 100000007
n = int(input())
ans = (10 ** (n - 2))
for i in range(n, 0, -1):
ans *= i
ans -= n * (n - 1) * (n - 2) * (n - 3)
ans %= MOD
print(ans) |
p02554 | s465889087 | Wrong Answer | n=int(input())
if n==1:
print(0)
else:
print((10**n-(8*10**(n-1))-2*(9**(n-1)))%(10**9+7)) |
p02554 | s577282089 | Wrong Answer | n = int(input())
a = 10**9 +7
b = pow(10,n,a) + pow(8,n,a) - 2 * pow(9,n,a)
if b >= 0:
print(b)
else:
print(b+a) |
p02554 | s748258848 | Wrong Answer | 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) |
p02554 | s311729880 | Wrong Answer | #ABC178C
N = int(input())
def Caculation(N):
combination = 4 * (9**(N-2))
ans = combination % (10**9 + 7)
print(ans)
if N <= 1:
print(0)
else:
Caculation(N) |
p02554 | s443292903 | Wrong Answer | n=int(input())
c=10**9+7
def pow_c(x,n,c):
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
K= (K%c)*(x%c)%c
x = ((x%c)**2)%c
n //= 2
return (K%c) * (x%c) %c
k10=pow_c(10,n,c)
k9=pow_c(9,n,c)
k8=pow_c(8,n,c)
ans=(k10-2*k9+k8)%c |
p02554 | s864204247 | Wrong Answer | N = int(input())
mod = 10**9+7
ans = pow(10, N, mod) - pow(9,N, mod)*2 + pow(8,N, mod)
print(ans)
|
p02554 | s392109987 | Wrong Answer | mod=10**9 + 7
n=int(input())
print(pow(10,n,mod)-pow(8,n,mod)) |
p02554 | s840812327 | Wrong Answer | N = int(input())
MOD = 1e9+7
def powmod(x, y):
res = 1
for p in range(y):
res = res*x%MOD
return res
ans = powmod(10,N)-powmod(9,N)-powmod(9,N)+powmod(8,N)
print(int(ans))
|
p02554 | s214214632 | Wrong Answer | N=int(input())
#Ai=0を含まない...9^N
#Ai=9を含まない...9^N
#Ai=0,Ai=9を含まない...8^N
#全てで10^N通り
#Ai=0,Ai=9の少なくとも一方が存在しない 9^N+9^N-8^N
#答は10^N-9^N-9^N+8^N
A=10**N
B=9**N
C=8**N
A=A%(10**9+7)
B=B%(10**9+7)
C=C%(10**9+7)
print(A-B*2+C)
|
p02554 | s631733312 | Wrong Answer | import sys
N= int(input())
if N==1:
print(0)
sys.exit()
if N>=2:
a=10
b=9
c=8
for i in range(N-1):
a=a*10%(10**9+7)
b=b*9%(10**9+7)
c=c*8%(10**9+7)
print(int(a-2*b+c)) |
p02554 | s887517913 | Wrong Answer | import math
def permutations_count(n, r):
return math.factorial(n) // math.factorial(n - r)
N = int(input())
if N < 2:
print(0)
exit()
elif N == 2:
print(2)
exit()
p = permutations_count(N, 2)
ans = (p * (10 ** (N-2)) - p) % (10**9 + 7)
print(ans)
|
p02554 | s318758223 | Wrong Answer | n = int(input())
if(n==1):
print("0")
exit()
kekka = (pow(10,n-1)-2*pow(9,n-1))%1000000007
print(kekka) |
p02554 | s667298970 | Wrong Answer | n=int(input())
mod=10**9+7
ans=0
ans=(2**n)%mod
ans-=2
if n>2:
ans2=(8**(n-2))%mod
ans2*=n*(n-1)
ans2%=mod
ans+=ans2
print(ans%mod)
|
p02554 | s771936813 | Wrong Answer | import math
n=int(input())
print((pow(2,n)-2)%1000000007)
|
p02554 | s225980193 | Wrong Answer | N = int(input())
MOD = 10**9+7
ans = 10**N%MOD - 9**N%MOD*2%MOD + 8**N%MOD
print(ans) |
p02554 | s121961306 | 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)
|
p02554 | s945860457 | Wrong Answer | N =input()
N = int(N)
x = 9 ** N
y = 8 ** N
z = 10 ** N - 2 * x + y
print(z) |
p02554 | s040358084 | Wrong Answer | n = int(input())
if n == 1:
print(0)
elif n == 2:
print(2)
else:
x = (10 ** 9) + 7
a = (10 ** n) % x
b = (9 ** n) % x
c = (8 ** n) % x
y = a - b * 2 + c
if y < 0:
y += x
print(y) |
p02554 | s446386165 | Wrong Answer | n = int(input())
mod = 10**9 + 7
ans = pow(10,n,mod) - pow(9,n,mod)*2 + pow(8,n,mod)
print(ans) |
p02554 | s588461983 | Wrong Answer | n = int(input())
if n == 2:
print(2)
else:
if n < 2:
print(0)
else:
dp = [0, 1, 1, 2]
for i in range(3, n + 1):
dp.append(dp[i]*i)
print(dp[n+1]%(pow(10, 9) + 7))
|
p02554 | s994808704 | Wrong Answer | n=int(input())
p=1
q=1
r=1
for i in range(n):
p=p*10
q=q*9
r=r*8
if p>=10**9+7:
p=p%(10**9+7)
if q>=10**9+7:
q=q%(10**9+7)
if r>=10**9+7:
r=r%(10**9+7)
an = p-2*q+r
if an >=10**9+7:
print(an%(10**9+7))
else:
print(an) |
p02554 | s673660115 | Wrong Answer | n=int(input())
mod=(1e+9)+7
x=1
if n>=2:
ans=1
else:
ans=0
for i in range(n):
x*=10
ans*=8
ans%=mod
x%=mod
nin=1
for i in range(n):
nin*=9
nin%=mod
x+=ans
x%=mod
x-=(nin*2)%mod
if x<0:
x+=mod
print(int(x%mod)) |
p02554 | s175669449 | Wrong Answer | mod =10**9 + 7
N=int(input())
a=10**(N-2)
print(int((2*a)%mod)) |
p02554 | s814638864 | Wrong Answer | n = int( input() )
#print( n )
x = 1
y = 1
z = 1000000007
for i in range( n-1 ):
x = ( x * 10 ) % z
y = ( y * 8 ) % z
ans = x - y
print( ans )
|
p02554 | s804956445 | Wrong Answer | N = int(input())
a = 2*(10^N-9^N)-(10^N-8^N)
ans = a % (10^9+7)
print(ans) |
p02554 | s389895322 | Wrong Answer | MOD = 10**9 + 7
import sys
input = sys.stdin.readline
N = int(input())
ans = pow(10,N,MOD)
ans -= 2*pow(9,N,MOD)
ans += pow(8,N,MOD)
print(ans)
|
p02554 | s754965389 | Wrong Answer | n = int( input() )
#print( n )
x = 1
y = 1
z = 1000000007
for i in range( n-1 ):
x = ( x * 10 ) % z
y = ( y * 8 ) % z
ans = x - y
print( ans )
|
p02554 | s586072030 | Wrong Answer | n=int(input())
s=0
for i in range(n-1):
p=10**i*9**(n-i-2)
s+=p%1000000007
print(int(2*s)) |
p02554 | s331728780 | Wrong Answer | N = int(input())
print((10 ** N - 8 ** N) % (10 ** 9 + 7))
|
p02554 | s889425797 | 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)
ans = 10 ** (N - 2) * C % MOD
print(int(ans))
|
p02554 | s052078848 | Wrong Answer | def bigmod(v, n10, m):
"""
>>> bigmod(1, 2, 9)
1
>>> bigmod(2343413, 10, 100005)
1
"""
# print((v*10.**n10) % m)
v %= m
while n10>0:
v *= 10
n10 -= 1
v %= m
return v
def main():
n = int(input())
m = int(10**9+7)
a = bigmod(n*(n-1), n-2, m)
print(a)
main() |
p02554 | s682883058 | Wrong Answer |
def resolve():
MOD = 10 ** 9 + 7
N = int(input())
ans = pow(10, N, MOD)
ans -= pow(9, N, MOD)
ans -= pow(9, N, MOD)
ans += pow(8, N, MOD)
print(ans)
if __name__ == "__main__":
resolve() |
p02554 | s216495331 | Wrong Answer | N = int(input())
res = N*(N-1)*(10**(N-2))
ress = res % ((10**9)+7)
print(ress) |
p02554 | s494184112 | Wrong Answer | N = int(input())
mod = 10**9 + 7
print(pow(10, N, mod) - 2*pow(9, N, mod) + pow(8, N, mod)) |
p02554 | s630725122 | Wrong Answer | N = int(input())
a = 1
b = 1
c = 1
for i in range(N):
a = (a * 10) % (10**9 + 7)
b = (b * 9) % (10**9 + 7)
c = (c * 8) % (10**9 + 7)
print(a + c - (2 * b) )
|
p02554 | s891566780 | Wrong Answer | n = int(input())
res = pow(10, n-2)*n*(n-1)
print(res%1000000007) |
p02554 | s416581304 | Wrong Answer | n = int(input())
mod = 10**9 + 7
if n == 1:
print(0)
exit()
ans = pow(10,n,mod) - pow(9,n,mod)*2 + pow(8,n,mod)
print(ans) |
p02554 | s251020461 | Wrong Answer | N = int(input())
M = 7 + 10 ** 9
A = 0
def fac_mod(a, b):
x = 1
for i in range(1, b+1):
x = (x*a) % M
return x
A = fac_mod(10, N) - fac_mod(9, N) * 2 + fac_mod(8, N) % M
if A < 0:
A = M - A
print(A) |
p02554 | s975692852 | Wrong Answer | N = int(input())
mod = 10 ** 9 + 7
nn = 10 ** N%mod % mod
nm = 2 * (9 ** N) % mod - (8 ** N) % mod
print(nn - nm)
|
p02554 | s875725229 | Wrong Answer | n=int(input())
mod=1000000007
ten=1
nine=1
eight=1
for _ in range(n):
nine *= 9
ten *= 10
eight *= 8
nine %= mod
eight%=mod
print(ten+eight-nine-nine) |
p02554 | s113132961 | Wrong Answer | #!/usr/bin/env python3
import sys
MOD = 1000000007 # type: int
def solve(N: int):
return print((10**N - 2*9**N + 8**N))
# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
solve(N)
if __name__ == '__main__':
main() |
p02554 | s096024274 | 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 | s281441981 | Wrong Answer | import math
def use(a,n,x):
if n==0:
return 1
if n%2!=0:
hold=use(a,n//2,x)
return (a*hold*hold)%(x)
else:
hold=use(a,n//2,x)
return (hold*hold)%(x)
n=int(input())
if n<2:
print(0)
else:
x=(10**9 +7)
ans=use(10,n,x)
s=2*use(9,n,x)
y=use(8,n,x)
print(int(ans+y-s))
|
p02554 | s969496933 | 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)
|
p02554 | s869720671 | Wrong Answer | N = int(input())
a = (10**N-8**N)%(10**9+7)
print(a) |
p02554 | s043697776 | Wrong Answer | N = int(input())
print(((N*(N-1))*(10**(N-2))-(6**(N-2)))%1000000007) |
p02554 | s474852033 | Wrong Answer | n = int(input())
res = 0
mod = (10**9+7)
from scipy.special import perm
from scipy.special import comb
# a = comb(n, r)
a = perm(n,2)
b = 10**(n-2) % mod
res = int(((a * b) % mod))
# res = a + b - c
print(res) |
p02554 | s570307673 | Wrong Answer | from math import comb
if __name__=="__main__":
N=int(input())
if N<2:
print(0)
else:
print(comb(N,2)%(10**9+7))
|
p02554 | s250831522 | Wrong Answer | import math
N = int(input())
answer = 0
rest = 10 ** 9 + 7
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
if N == 1:
answer = 0
else:
answer = (combinations_count(N, 2) * 2) * math.factorial(N-2)
print(answer % rest)
|
p02554 | s293172208 | 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 | s084518954 | Wrong Answer | n=int(input())
m=1
s=1000000007
for i in range(1,n+1):
if m<s:
m=m*i
else:
m=(m%s)*i
k=1
for i in range(1,n-1):
if k<s:
k=k*8
else:
k=(k%s)*8
p=(m*k)%s
print(p) |
p02554 | s735558186 | 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 | s118996171 | Wrong Answer | import itertools
n = int(input())
a = ["0","9","x"]
if n == 1:
print(0)
elif n == 2:
print(2)
else:
count = 0
for v in itertools.product(a, repeat=n):
l = list(v)
if "0" in l and "9" in l and "x" in l:
count += 9**l.count("x")
print(count%(10**9+7)) |
p02554 | s435271063 | Wrong Answer | N = int(input())
MOD = 10**9 + 7
if N==1:
print(0)
elif N==2:
print(2)
else:
ans = pow(10,N,MOD) - 2*pow(9,N,MOD) + pow(8,N,MOD)
print(ans) |
p02554 | s267461608 | Wrong Answer | n=int(input())
mod=int(1e9+7)
if n==1:
print(0)
else:
print(2*pow(10,n-2,mod)%mod) |
p02554 | s691906888 | Wrong Answer | n = int(input())
mod = 10**9+7
ans = pow(10,n)
ans += pow(9,n)*2
ans -= pow(8,n)
print(ans%mod) |
p02554 | s520127208 | Wrong Answer | import math
n = int(input())
if n == 1:
print(0)
else:
print(10**(n-2)*(math.factorial(n))%(10**9+7)) |
p02554 | s183167582 | 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
r = 1
print(cmb(n, r, p))
|
p02554 | s996171814 | Wrong Answer | """
int(input())
map(int, input().split())
list(map(int, input().split()))
input()
input().split()
"""
n = int(input())
mod = 1000000007
tmp = (10**n)%mod
diff = 2*(9**n)%mod
eight = (8**n)%mod
ans = tmp - diff + eight
print(ans) |
p02554 | s465865567 | Wrong Answer | x=int(input())
y=10^x- 9^x -9^x-8^x
print(y)
|
p02554 | s726475890 | Wrong Answer | n = int(input())
if n <= 1:
print(0)
else:
mod = 10 ** 9 + 7
print(pow(10, n, mod) - 2 * pow(9, n, mod) + pow(8, n, mod)) |
p02554 | s351222152 | 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) # 全て
ans = c-2*b+a
if ans < 0:
ans += mod
print(ans)
|
p02554 | s813067401 | Wrong Answer | from sys import stdin
readline = stdin.buffer.readline
read = stdin.buffer.read
def i_input(): return int(input().rstrip())
def i_map(): return map(int, input().rstrip().split())
def i_list(): return list(i_map())
MOD = 10 ** 9 + 7
def main():
N = i_input()
print(pow(10, N, MOD) - pow(9, N, MOD) * 2 + pow(8, N, MOD))
if __name__ == "__main__":
main()
|
p02554 | s025051730 | Wrong Answer | import sys
N = int(input())
if N == 1:
print(0)
sys.exit(0)
if N == 2:
print(1)
sys.exit(0)
# out = (N * (N - 1) * (10 ** (N - 2))) % ((10 ** 9) + 7)
out = ((10 ** N) - ((9 ** N) * 2 - (8 ** N))) % ((10 ** 9) + 7)
print(out)
|
p02554 | s957356033 | Wrong Answer | n = 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
if n == 1:
print(0)
else:
mod = 10**9+7
print(power_func(10, n, mod)-(power_func(9, n, mod)*2-power_func(8, n, mod))) |
p02554 | s149040790 | Wrong Answer | N = int(input())
a = (10**N*+8**N-2*(9**N))%((10**9)+7)
print(a) |
p02554 | s500353853 | Wrong Answer | n = int(input())
mod = 10**9+7
ans = pow(10,n,mod)-pow(9,n,mod)*2+pow(8,n,mod)
print(ans) |
p02554 | s559814101 | Wrong Answer | N = int(input())
m = 10**9 +7
result = pow(10,N,m) - 2*pow(9,N,m) + pow(8,N,m)
print(result) |
p02554 | s776633852 | Wrong Answer | N = int(input())
mod = 10**9+7
print(10**N%mod - 2*9**N%mod + 8**N%mod) |
p02554 | s466780672 | Wrong Answer | N = int(input())
W = 0
V = 2
for i in range(1, N):
W, V = 10 * W + V, 7 * V + 2 * 10 ** i
print(W % (10 ** 9 + 7)) |
p02554 | s568219197 | Wrong Answer | N = int(input())
mod = 10**9 + 7
comb = N * (N - 1) // 2
comb0and9 = comb * 2 * (10**(N-2))
ans = comb0and9 % mod
print(ans)
|
p02554 | s288796013 | Wrong Answer | N=int(input()) #標準入力
zero_nine=N*(N-1) #N個の中からどれを0と9に選出するか？
other_numbers=10**(N-2) #0と9以外の要素の選び方は？
if other_numbers<=1:
answer=zero_nine
else:
answer = zero_nine*other_numbers
warukazu=10**9+7
print(int(answer%warukazu)) |
p02554 | s387048072 | Wrong Answer | import math
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
N = int(input())
answer = 0
rest = 10 ** 9 + 7
if N == 1:
answer = 0
else:
answer = cmb(N, 2) * 2 * (10 ** (N - 2))
print(answer % rest)
|
p02554 | s035287166 | Wrong Answer | n = int(input())
mod = 10**9 + 7
print((10**n % mod - (2*(9**n)) % mod + (8**n) % mod) ) |
p02554 | s906797729 | Wrong Answer | n = int(input())
if n == 1:
print(0)
if n == 2:
print(2)
else:
print((10**n-(2*9**n-8**n))%(10**9+7)) |
p02554 | s686593714 | Wrong Answer | n = int(input())
print( ( (10 ** (n - 2) % (10 ** 9 + 7)) * ((n * (n-1) // 2) % (10 ** 9 + 7)) * 2) % (10 ** 9 + 7) ) |
p02554 | s731508527 | Wrong Answer | N=869121
if N<2:
print(0)
else:
without=10**(N-2)
considered=(without+2)*(without+1)
considered=considered%(1000000007)
print(considered)
|
p02554 | s887699576 | Wrong Answer | n = int(input())
MOD = 10 ** 9 + 7
print(pow(10, n, MOD) - 2 * pow(9, n, MOD) + pow(8, n, MOD)) |
p02554 | s211269698 | Wrong Answer | k = int(input())
if k < 2:
print(0)
else:
num = 2*(k*2-3)
num2 = num*10 - num
# print(num2)
waru = 10**9+7
# print(waru)
print(num2 % waru) |
p02554 | s507546541 | Wrong Answer | import sys
N= int(input())
if N==1:
print(0)
sys.exit()
if N>=2:
a=10
b=9
c=8
for i in range(N-1):
a=a*10%(10**9+7)
b=b*9%(10**9+7)
c=c*8%(10**9+7)
print(a-2*b+c) |
p02554 | s303264298 | Wrong Answer | n = int(raw_input())
mod = (10 ** 9 )+ 7
def f(a,n):
mod = (10 ** 9 )+ 7
if n == 0:
return 1
t = f(a,n/2) % mod
return ((t ** 2) * (a if n%2 else 1)) %mod
print (f(9,n) + f(9,n) - f(8,n)) %mod
|
p02554 | s872251667 | Wrong Answer | #import math
import itertools
n = int(input())
l = list(range(0, n, 1))
#print(l)
def permutations_count(n, r):
return math.factorial(n) // math.factorial(n - r)
#print(len(list(itertools.permutations(l, 2))))
#%(10^9 + 7)した答えを出力
mas = n-2 # 0と9は必ず使う
if mas == 0:
print(2)
elif n == 0:
print(1)
else:
#res = (permutations_count(n, 2) * 10^mas)%(10^9 + 7)
res = (len(list(itertools.permutations(l, 2)))%(10^9 + 7)) * (10^mas%(10^9 + 7))
print(res) |
p02554 | s196469840 | Wrong Answer | def fact(n):
ans = 1
for i in range(1, n+1):
ans *= i
return ans
def comb(a, b):
if a < b:
a, b = b, a
return fact(a)/(fact(a-b)*fact(b))
x = int(input())
a = comb(x, 2)
b = 10*(x-2)
print(a*b) |
p02554 | s945259505 | Wrong Answer | n = int(input())
m = 10**9 + 7
if n==1:
print(0)
exit()
s = 0
a = (8**(n-2))*10
a2 = (a//10)*8
sa = (4*a*5**(n-1))//(4**(n-1))-4*a
sb = a2*(n-1)
print((sa-sb)%m) |
p02554 | s352698005 | Wrong Answer | n=int(input())
modd=1000000007
if(n==1):
ans=1
elif n==2:
ans=2
else:
ans=(pow(10,n,modd)-pow(9,n,modd)*2+pow(8,n,modd))%modd
print(ans) |
p02554 | s450522463 | Wrong Answer | n=int(input())
a=1
b=1
for i in range(n):
a*=10
a = a % (10**9 + 7)
b*=8
b=b%(10**9+7)
ans=(a-b)%(10**9+7)
print(ans) |
p02554 | s270862304 | Wrong Answer | import math
N = int(input())
def permutations_count(n, r):
return math.factorial(n) //( math.factorial(n - r) * math.factorial(r))
ans = 0
if N == 1:
ans = 0
elif N == 2:
ans = 2
else:
for r in range(1,N,1):
ans += permutations_count(N, r) % (10**9 + 7)
print(ans) |
p02554 | s889849574 | 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) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.