Datasets:
peterverebics
/
CodeNet_Python_118

Dataset card Data Studio Files
xet
 Community
1
problem_id
stringclasses
100 values
submission_id
stringlengths
10
10
status
stringclasses
2 values
code
stringlengths
6
806
p02554
s778860097
Wrong Answer
N = int(input()) num = N*(N-1)*(10**(N-2)) % (10**9 +7) print(num)
p02554
s849186109
Wrong Answer
N = int(input()) M = 10**9+7 print(pow(10, N, M)-pow(9, N, M)*2+pow(8, N, M))
p02554
s272699860
Wrong Answer
n = int(input()) print((8 * n * (n - 1)) % (10 ** 9 + 7))
p02554
s538903184
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 print(ans)
p02554
s580643643
Wrong Answer
N = int(input()) print(pow(10, N, mod=1000000007) - pow(9, N, mod=1000000007) - pow(9, N, mod=1000000007) + pow(8, N, mod=1000000007))
p02554
s535823578
Wrong Answer
n = int(input()) mod = 10**9+7 def pow(n, num): s = num for i in range(1,num): s = s*n%mod return s print((pow(n,10) - 2*pow(n,9) + pow(n,8))%mod)
p02554
s061134849
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)) % MOD) if __name__ == "__main__": main()
p02554
s544419180
Wrong Answer
N = int(input()) mod = 10**9+7 print(pow(10, N, mod) - ((pow(9, N, mod) * 2 % mod) - pow(8, N, mod)))
p02554
s463998557
Wrong Answer
N = int(input()) p = 10**9+7 ans = pow(10,N,p) + pow(8,N,p)-2*pow(9,N,p) print(ans)
p02554
s120852870
Wrong Answer
# -*- coding: utf-8 -*- MOD=1000000007 x = int(input()) n1 = (10**x)%MOD n2 = 2*9**x%MOD n3 = 8**x%MOD n = n1-n2+n3 print(int(n))
p02554
s044509232
Wrong Answer
n=int(input()) print((10**n-(9**n+9**n-8**n)%(10**9+7)))
p02554
s211362938
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)
p02554
s701061998
Wrong Answer
n = int(input()) mod = 1000000007 ans = pow(10,n,mod) - 2*pow(9,n,mod) + pow(8,n,mod) print(ans)
p02554
s714699817
Wrong Answer
N = int(input()) MOD = 10**9 + 7 ans = pow(10, N, MOD) ans -= 2 * pow(9, N, MOD) ans += pow(8, N, MOD) print(ans)
p02554
s332716764
Wrong Answer
N = int(input()) mod = 1000000007 print((10**N)%mod - (2*(9**N))%mod + (8**N)%mod)
p02554
s519799086
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: print(ans+mod) else: print(ans)
p02554
s299852292
Wrong Answer
n=int(input()) a=(10**n-8**n)//(10**9+7) print(a)
p02554
s734394353
Wrong Answer
N = int(input()) print(-2*pow(9, N, 1000000007)+pow(8, N, 1000000007)+pow(10, N, 1000000007))
p02554
s866169264
Wrong Answer
N = input() x = int(N) a = x-1 b = 10**(x-2) y = x*a*b z = y % (10^9+7) print(z)
p02554
s687160234
Wrong Answer
N = int(input()) ans = (10**N % (10**9+7)) - (2 * 9**N % (10**9+7)) + (8**N % (10**9+7)) print(ans)
p02554
s950636369
Wrong Answer
n = int(input()) print((10**n - 9**n - 9**n ) + 8**n)
p02554
s023168590
Wrong Answer
n = int(input()) print(10**n-2*(9**n)-8**n)
p02554
s908627859
Wrong Answer
N = int(input()) Mod = 10**9+7 print(pow(10,N,Mod)-2*pow(9,N,Mod)+pow(8,N,Mod))
p02554
s829243689
Wrong Answer
n = int(input()) mod = 10**9+7 a = pow(10,n,mod) b = pow(9,n,mod) c = pow(9,n,mod) d = pow(8,n,mod) print(a-b-c+d)
p02554
s477734444
Wrong Answer
N = int(input()) print(10**N-2*9**N+8**N)
p02554
s754812124
Wrong Answer
n = int(input()) if n <= 1: print(0) exit() print((2**n - 2) % (10**9 + 7))
p02554
s086454215
Wrong Answer
N = int(input()) ans = 10**N - 9**N - 9**N + 8**N print(ans)
p02554
s902528782
Wrong Answer
N=int(input()) Ans=10**N%(10**9+7)-2*(9**N%(10**9+7))+8**N%(10**9+7) print(Ans)
p02554
s587947208
Wrong Answer
N = int(input()) base = 10**(N-2) res = base*N*(N-1) mod = int(res % (10**9 + 7)) print(mod)
p02554
s815844010
Wrong Answer
N = int(input()) print(10**N-(9**N+9**N-8**N))
p02554
s448355758
Wrong Answer
def main(): import sys def input(): return sys.stdin.readline()[:-1] N=int(input()) mod=1000000007 def aaa(a,b,p): if b==0: return 1 elif b%2==0: d=aaa(a,b/2,p) return (d*d)%p else: return (a*aaa(a,b-1,p))%p print(aaa(10,N,mod)-2*aaa(9,N,mod)+aaa(8,N,mod)) if __name__ == '__main__': main()
p02554
s056631395
Wrong Answer
N = int(input()) print('{}'.format((2**N-2)%(10**9+7)))
p02554
s007210870
Wrong Answer
import math n = int(input()) a = pow(10, n, 10**9+7) b = pow(9, n, 10**9+7) c = pow(9, n, 10**9+7) d = pow(8, n, 10**9+7) print((a-b-c+d) % 10**9+7)
p02554
s402649872
Wrong Answer
ii = lambda : int(input()) mi = lambda : map(int,input().split()) li = lambda : list(map(int,input().split())) mod = 10**9+7 # m**n def modpow(m,n,mod=1000000007): res = 1 while n>0: if n&1: res = res * m % mod m = m * m % mod n >>= 1 return res n = ii() b = modpow(10,n) s = modpow(8,n) m = modpow(9,n) ans = b - s - 2*(m-s) print(ans)
p02554
s620698939
Wrong Answer
n = int(input()) mod = 10**9+7 a = pow(10, n, mod) b = pow(9, n, mod) c = pow(8,n,mod) ans = a-2*b+c print(ans)
p02554
s287575492
Wrong Answer
N = int(input()) n10 = 1 n8 = 1 n9 = 1 beki = N while beki>4: n10 = (n10*(10**5))%(10**9+7) beki -= 5 n10 = (n10*(10**beki))%(10**9+7) beki = N while beki>4: n8 = (n8*(8**5))%(10**9+7) beki -= 5 n8 = (n8*(8**beki))%(10**9+7) beki = N while beki>4: n9 = (n9*(9**5))%(10**9+7) beki -= 5 n9 = (n9*(9**beki))%(10**9+7) print(n10-2*n9+n8)
p02554
s241286784
Wrong Answer
N = int(input()) ans = 0 if N == 1: ans = 0 elif N>=2: ans = 2**N - 2 print(ans%(10**9+7))
p02554
s630005092
Wrong Answer
N = int(input()) mod = 10**9 + 7 def powmod(val, n, mod): ret = 1 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) ans = all - (2*b - c) ans = powmod(10, N, mod) - (powmod(9, N, mod) + powmod(9, N, mod) - powmod(8, N, mod)) print(ans)
p02554
s368099000
Wrong Answer
print(lambda x=input():x%(10**9+7) )
p02554
s241580360
Wrong Answer
n=int(input()) #ans=(n*(n-1))//2*pow(8,n-2) #ans=(pow(10,n)-pow(8,n))%1000000007 ans=(10**n-8**n)%1000000007 print(ans%1000000007)
p02554
s415427852
Wrong Answer
n=int(input()) ans=0 mod=10**9+7 if n>=2: ans+=pow(10,n,mod) ans-=pow(9,n,mod) ans-=pow(9,n,mod) ans+=pow(8,n,mod) print(ans)
p02554
s651056261
Wrong Answer
n = int(input()) mod = 1000000007 a = 1 b = 1 w = 1 for i in range(n): a *= 9 a %= mod b *= 8 b %= mod w *= 10 w %= mod ans = w - (a * 2 - b) if ans < 0: ans += mod print(ans)
p02554
s558613017
Wrong Answer
N = int(input()) out = (10**N % (10**9+7) - 2*9**N % (10**9+7) + 8**N % (10**9+7)) print(out)
p02554
s662163184
Wrong Answer
n = int(input()) print(10 ^ n + 8 ^ n - 9 ^ n -9 ^ n)
p02554
s016719502
Wrong Answer
N = int(input()) result = N * (N-1) print(result % 1000000007)
p02554
s926751214
Wrong Answer
def power_func(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()) answer = power_func(10,N,pow(10,9) + 7) + power_func(8,N,pow(10,9) + 7) - 2 * power_func(9,N,pow(10,9) + 7) print(answer)
p02554
s783189758
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() ans = (permutations_count(N, 2) * (10 ** (N-2)) - permutations_count(N, 2)) % (10**9 + 7) print(ans)
p02554
s447178365
Wrong Answer
n = int(input()) x = n*(n-1)*2*(10**(n-2)) print(x%(10**9 + 7))
p02554
s041652198
Wrong Answer
n = int(input()) def count_row(n): a = n * (n-1) * 10 ** (n-2) a %= 10 ** 9 + 7 return a print(count_row(n))
p02554
s172416731
Wrong Answer
n = int(input()) if n <= 1: ans = 0 else: ans = (n*(n - 1)*(10 ** (n - 2))) % 1000000007 print(ans)
p02554
s698885305
Wrong Answer
n = int(input()) mod= 10 ** 9 + 7 ans = (2*(10**n-9**n))-(10**n-8**n)%mod print(ans)
p02554
s606475252
Wrong Answer
#!/usr/bin/env python3 import math def main(): n = int(input()) mod = 10**9 + 7 if n == 1: ans = 0 else: ans = (math.factorial(n) * (10 ** (n - 2))) % mod print(ans) if __name__ == "__main__": main()
p02554
s985030687
Wrong Answer
n = int(input()) mod = 10**9+7 def pow(x, n): res = 1 while n > 0: if n & 1 == 1: res *= x x *= x n >>= 1 return res print((pow(10, n)%mod -2*pow(9, n)%mod + pow(8, n)%mod))
p02554
s791924544
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 - 2*b +c if ans < 0: ans += mod print(ans)
p02554
s541253598
Wrong Answer
n = int(input()) c = 1 ans =1 for i in range(n) : ans = ans * (pow(8,i+1)%1000000007) % 1000000007 print(ans)
p02554
s053807026
Wrong Answer
n = int(input()) c = 10 ** 9 + 7 g_1 = 1 g_2 = 19 f_1 = 0 f_2 = 2 ans = 0 if n == 1: print(0) elif n == 2: print(2) else: prev_f = f_2 prev_g = g_2 for i in range(3, n + 1): g = 10 ** (i-2) + 9 * prev_g f1 = (2 * g) % c f2 = (8 * prev_f) % c f = (f1 + f2) % c ans += (f % c) prev_f = f prev_g = g print(ans)
p02554
s562338856
Wrong Answer
n = int(input()) if n == 1: print(0) mod = 10 ** 9 + 7 ans = pow(10, n, mod) - 2 * pow(9, n, mod) + pow(8, n, mod) ans %= mod print(ans)
p02554
s271320538
Wrong Answer
def resolve(): from itertools import permutations n = int(input()) RES = 10 ** 9 + 1 ans = 0 ls = list(permutations(list(range(10)), n)) for l in ls: if 0 in l and 9 in l: ans += 1 ans = ans % RES print(ans) resolve()
p02554
s438771263
Wrong Answer
n = int(input()) mod = 10**9+7 print(pow(10,n,mod)-pow(9,n,mod)*2%mod+pow(8,n,mod))
p02554
s393116906
Wrong Answer
N = int(input()) mod = 10** + 7 if N == 1: print(0) else: ans = N*10**(N-2) print(ans%mod)
p02554
s702991908
Wrong Answer
s = int(input()) ans = (s * (s - 1)) % 1000000007 print(ans)
p02554
s256336290
Wrong Answer
n = int(input('')) mod = 1000000007 cnt_all= 10**n cnt_90=8**n cnt_9=9**n cnt_0=9**n cnt=cnt_all + cnt_90 - cnt_9 - cnt_0 #print("{} - {} - {} + {} = {}".format(cnt_all,cnt_9,cnt_0,cnt_90,cnt)) print(cnt)
p02554
s939025426
Wrong Answer
n = int(input()) if n == 2: print(2) else: if n < 2: print(0) else: print(2*pow(9, n - 2))
p02554
s030069547
Wrong Answer
import math n = int(input()) x = (math.factorial(n)*10**(n-2))%(10**9+7) print(x)
p02554
s631818472
Wrong Answer
import sys import itertools N = int(input()) a = N * (N-1) # a %= 10 ** 9 + 7 a *= (10**(N-2)) a %= 10 ** 9 + 7 print(a)
p02554
s341791915
Wrong Answer
N = int(input()) MOD = 10**9 + 7 if N<=1: print(0) else: all_num = pow(10, N, MOD) ans = all_num - 2 * pow(9, N, MOD) + pow(8, N, MOD) print(ans)
p02554
s992929762
Wrong Answer
N = int(input()) s = (10**9)+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 #ans = N*(N-1)*(10**(N-2)) #print(ans) # #ans2 = ans % s #print(ans2) ans3 = N*(N-1)*power_func(10,N-2,s) print(ans3 % s) #ans = 10**N - (N*(10**(N-1))*2)+N*(N-1)*(10**(N-2)) #print(ans)
p02554
s044423269
Wrong Answer
def main(): n = int(input()) # a, b, c, d = map(int, input().split()) # l = list(map(int, input().split())) # s = input() print((10**n - 9**n) * 2 % (10**9 + 7) - (10**n-8**n) % (10**9 + 7)) if __name__ == '__main__': main()
p02554
s490364899
Wrong Answer
N = int(input()) print(((N*(N-1))*(10**(N-1))-(6**(N-2)))%1000000007)
p02554
s812540188
Wrong Answer
N=int(input()) print(int((N*(N-1)*10**(N-2))%((10**9)+7)))
p02554
s927766398
Wrong Answer
n = int(input()) x = n*(n-1)%1000000007 y = 10**(n-2)%1000000007 print((x*y)%1000000007)
p02554
s567639714
Wrong Answer
import math N = int(input()) if N == 1: print(0) elif N == 2: print(2) else: print(int((2*(10**N-9**N))-((10**N-8**N)) %(10**9+7)))
p02554
s277026004
Wrong Answer
#!/usr/bin/env python n = int(input()) mod = 10**9+7 tot = 10**n inc0 = (tot - 9**n)%mod inc9 = (tot - 9**n)%mod inc0or9 = (tot - 8**n)%mod ans = inc0+inc9-inc0or9 print(ans)
p02554
s130919374
Wrong Answer
n = int(input()) mod = 1000000007 if n < 2: print(0) else: print(pow(10, n, mod) - 2 * pow(9, n, mod) + pow(8, n, mod))
p02554
s153047754
Wrong Answer
N = int(input()) MOD = 10 ** 9 + 7 answer = pow(10, N, MOD) + pow(8, N, MOD) - 2 * pow(9, N, MOD) print(answer + MOD if answer < 0 else answer % MOD)
p02554
s452544632
Wrong Answer
N =int(input()) if ( N==1): print(0) if(N>=2): print((10**N-8**N-(8**(N-1))*N*2-2)%(10**9+7))
p02554
s367028531
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
s293329910
Wrong Answer
N=int(input()) if N==1: print(0) exit() elif N==2: print(2) exit() ans=(10^(N-2)+(10^(N-1)-9^(N-1))+(10^N-9^N))*2 print(ans%(10^9+7))
p02554
s876569607
Wrong Answer
N = int(input()) if N==1: print(0) elif N==2: print(2) else: from scipy.special import comb a = comb(N, 2, exact=True) print((10**(N-2)*a*2)%(10**9+7))
p02554
s700676854
Wrong Answer
import sys #a^n mod p を求める 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 input = sys.stdin.readline n = int(input()) p = 1000000007 n_10 = power_func(10,n,p) n_9 = power_func(9,n,p) * 2 % p n_8 = power_func(8,n,p) print(n_10 - n_9 + n_8)
p02554
s733820340
Wrong Answer
import math a = int(input()) ans = math.factorial(a) new_ans = ans // (10 ** 9 + 7) print(new_ans)
p02554
s635176658
Wrong Answer
MOD = int(1e9 + 7) n=int(input()) print(10 ** n % MOD - 9 ** n % MOD - 9 ** n % MOD + 8 ** n % MOD)
p02554
s869318431
Wrong Answer
n = int(input()) mod = 10 ** 9 + 7 print((pow(10, n, mod) - 2 * pow(9, n, mod) + pow(8, n, mod)))
p02554
s484345952
Wrong Answer
p=10**9+7 def pow(x, n): res = 1 while n > 0: if n & 1 == 1: res *= x x *= x res = res%p n >>= 1 return res n=int(input()) print(pow(10,n)-2*pow(9,n)+pow(8,n))
p02554
s472598860
Wrong Answer
N = int(input()) print(10**N - 9**N - 9**N + 8**N)
p02554
s203319119
Wrong Answer
n = int(input()) inf = 1000000000 + 7 a=1; d=4 num = int(2*n*(n-1)) % inf if n==2: ans=2 elif n==1: ans=0 elif n>2: for i in range(n-2): a = int(int(8*a) % inf) d = int(int(2*d) % inf) a = int(a%inf)*int(num%inf) ans = int(int(a%inf) + int(d%inf))%inf print(int(ans))
p02554
s446197336
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
s325552082
Wrong Answer
import math n=int(input()) print((math.factorial(n) * (10 ** (n - 2) - 1)) % ((10 ** 9) + 7))
p02554
s336000237
Wrong Answer
MAX=10**9 + 7 n = int(input()) print(pow(10,n,MAX) - (pow(9,n,MAX)*2)%MAX + pow(8,n,MAX))
p02554
s325976227
Wrong Answer
#!/usr/bin/env python3 import sys MOD = 1000000007 # type: int def solve(N: int): return N*10**(N-2)%MOD # 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
s288985473
Wrong Answer
N=int(input()) if N<2: print(0) else: without=10**(N-2) each=N*(N-1) final=without*each considered=final%(10**9+7) print(considered)
p02554
s210192318
Wrong Answer
n = int(input()) if n == 1: print(0) else: total = 1 _0or9 = 1 _0and9 = 1 for i in range(n): total *= 10 total %= 10**9 + 7 _0or9 *= 9 _0or9 %= 10**9 + 7 _0and9 *= 8 _0and9 %= 10**9 + 7 print(total - 2*_0or9 + _0and9)
p02554
s144666200
Wrong Answer
n = int(input()) val1 = 10 val2 = 9 val3 = 8 if n == 1: print(0) else: for i in range(n-1): val1 = (val1*10)%(10**9+7) val2 = (val2*9)%(10**9+7) val3 = (val3*8)%(10**9+7) ans = int(val1-2*val2+val3) if ans<0: print(ans+1000000007) else: print(ans)
p02554
s660915337
Wrong Answer
N = int(input()) MOD = 1000000007 ans = 0 ans = pow(10, N, MOD) - 2 * pow(9, N, MOD) + pow(8, N, MOD) print(ans)
p02554
s647015454
Wrong Answer
# 整数の入力 N = int(input()) print( (8**(N-2) * N * (N-1) - (N * (N-1))) % (10**9 + 7))
p02554
s320413965
Wrong Answer
import math def combinations_count(n, r): return math.factorial(n) // (math.factorial(n - r) * math.factorial(r)) N = int(input()) ans = 0 if N == 1: ans = 0 elif N == 2: ans = 2 else: for i in range(N): ans *= 10 % 1000000007 ans *= combinations_count(N, 2) ans = ans % 1000000007 print(ans)
p02554
s748678058
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
s256060253
Wrong Answer
#C n = int(input()) mod = 10**9+7 ans = (10**n%mod-9**n%mod)*2%mod-(10**n%mod-8**n%mod) print(ans)
p02554
s239578398
Wrong Answer
import math n = int(input()) if n == 1 : print(0) else : ans = (math.factorial(n)*pow(10, n-2))%(pow(10, 9)+7) print(ans)
p02554
s357574513
Wrong Answer
import itertools as it n = int(input()) if n == 1: ans = 0 r = n-2 if n != 1: combo0 = list(map(list,it.combinations_with_replacement([0,1,2,3,4,5,6,7,8,9], r))) l = len(combo0) for i in range(l): combo0[i].append(0) combo0[i].append(9) x = 0 for j in range(l): y = len(list(map(list, it.permutations(combo0[j])))) x = x + y z = 10**9 + 7 ans = x % z print(ans)