problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03324 | s542421877 | Wrong Answer | D, N = map(int, input().split())
print(100 ** D * N) |
p03324 | s244888782 | Wrong Answer | d,n = map(int,input().split())
if d == 0:
print(n)
else:
print(n * 100**d ) |
p03324 | s436072983 | Wrong Answer | d,n=map(int,input().split());print(((n==100)*(d<2)+n)*100**d) |
p03324 | s736429378 | Wrong Answer | D, N = map(int, input().split())
print(100**D*N)
|
p03324 | s424100499 | Wrong Answer | D,N = map(int, input().split())
print(N * 100**D) |
p03324 | s784275365 | Wrong Answer | d,n = map(int,input().split())
print(n*100**d) |
p03324 | s531894275 | Wrong Answer | d,n=map(int,input().split());print((100**d)*n) |
p03324 | s547196661 | Wrong Answer | d, n = map(int, input().split())
print(n * (100 ** d))
|
p03324 | s900184544 | Wrong Answer | N, m = map(int, input().split())
ans = m*100**N
|
p03324 | s766982056 | Wrong Answer | d,n =map(int,input().split())
if n%100 != 0:
ans = 10**d*n
else:
ans = 10**d*n+1
print(ans) |
p03324 | s456499858 | Wrong Answer | # 問題文の意味はわからんけど（ちょうど1回、ちょうど2回割り切れる？？？？は？？？？？？？？）サンプルを適当に読む
d, n = map(int, input().split())
if d == 0:
if n == 100:
print(101)
else:
print(n)
elif d == 1:
print(n * 100)
else:
print(n * 10000)
|
p03324 | s469820576 | Wrong Answer | d, n = map(int, input().split())
if d == 0:
print(n)
elif d == 1:
if n == 100:
print((n+1)*100)
else:
print(n*100)
elif d == 2:
print(n*10000)
|
p03324 | s314547089 | Wrong Answer | D,N = map(int,input().split())
if D == 0:
print(N)
else:
print(100**D*N) |
p03324 | s324817471 | Wrong Answer | D, N = map(int, input().split())
if D == 0 or D % 100 != 0:
ans = 100 ** D * N
else:
ans = 100 ** D * (N+1)
print(ans) |
p03324 | s715980050 | Wrong Answer | def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
d,n = iim()
num = 0
for i in range(n):
num += 100**d
print(num) |
p03324 | s274432900 | Wrong Answer | # -*- coding: utf-8 -*-
D,N = list(map(int, input().rstrip().split()))
#-----
if D==0:
ans = 1 * N
else:
ans = (100**D) * ( N + N//100 )
print(ans)
|
p03324 | s572473662 | Wrong Answer | D,N=map(int, input().split())
base=10**(2*D)
print(N*base) |
p03324 | s921980484 | Wrong Answer | D,N=map(int,input().split())
print(N*100**D) |
p03324 | s011642043 | Wrong Answer | #!/usr/bin/env python3
import sys
def main():
D, N = map(int, input().split())
print((100**D)*N)
return
if __name__ == '__main__':
main()
|
p03324 | s816448145 | Wrong Answer | d, n = map(int, input().split())
print(100**d*n) |
p03324 | s687413522 | Wrong Answer | d, n = list(map(int,input().split()))
print((100**d)*n) |
p03324 | s285912260 | Wrong Answer | D,N = map(int, input().split())
cnt = 0
num = 1
while True:
tmp = num
flag = True
for _ in range(D):
if tmp % 100 == 0:
tmp //= 100
else:
flag = False
if flag:
cnt += 1
if cnt == N:
break
num += 1
print(num) |
p03324 | s707009925 | Wrong Answer | d,n = map(int, raw_input().split())
print n * (100 ** d) |
p03324 | s952745935 | Wrong Answer | def solve():
D, N = [int(i) for i in input().split()]
print(f"{N}{'00' * D}")
if __name__ == "__main__":
solve()
|
p03324 | s408477839 | Wrong Answer | D, N = map(int, input().split())
print(100**D*N) |
p03324 | s366764358 | Wrong Answer | d, n = map(int, input().split())
print(n*100**d) |
p03324 | s126884185 | Wrong Answer | d,n = map(int,input().split())
print(100**d*n) |
p03324 | s219244325 | Wrong Answer | a,b = map(int,input().split())
n = 100**a
print(n*b) |
p03324 | s741135274 | Wrong Answer | import numpy as np
D, N = [int(i) for i in input().split()]
ans = (N+1)*10**(2*D)
print(ans) |
p03324 | s966488336 | Wrong Answer | def resolve():
d, n = map(int, input().split())
print(100**d*n+n//100)
resolve() |
p03324 | s267464427 | Wrong Answer | n,d = list(map(int,input().split()))
print(100**n * d) |
p03324 | s630753593 | Wrong Answer | D, N = map(int, input().split())
print((100 ** D) * N)
|
p03324 | s460757073 | Wrong Answer | D, N = map(int, input().split())
if D == 0:
if N == 100:
print(101)
else:
print(N)
elif D == 1:
print(N * 100)
elif D == 2:
print(N * 10000) |
p03324 | s232369501 | Wrong Answer | d,n=map(int,input().split())
print(n*(100**d)) |
p03324 | s423887901 | Wrong Answer | D, N = map(int, input().split())
print((100**D) * N) |
p03324 | s111455214 | Wrong Answer | d,n = map(int,input().split())
print(n*(100**d))
|
p03324 | s836713907 | Wrong Answer | i = list(map(int,input().split()))
num = 100 ** i[0]
print(num * i[1]) |
p03324 | s400180720 | Wrong Answer | D,N = map(int,input().split())
if D == 0:
if N != 100:
print(N)
else:
print(101)
exit()
if D == 1:
if N != 100:
print(N*100)
else:
print(10100)
exit()
if N != 100:
print(N*10000)
else:
print(100010000) |
p03324 | s968771761 | Wrong Answer | d, n = map(int,input().split())
print(100 ** d * n) |
p03324 | s145354947 | Wrong Answer | d, n = map(int, input().split())
cnt = 0
for i in range(1, 10**7+1):
if i%(100**d) == 0:
cnt += 1
if cnt == n:
print(i)
exit() |
p03324 | s633636554 | Wrong Answer | d, n = map(int, input().split())
print(int(100**d *n)) |
p03324 | s451515393 | Wrong Answer | d,n=map(int,input().split())
if d==0:
print(n if n<=100 else n+1)
else:
print(100**d * n if n<=100 else 100**d * (n+1)) |
p03324 | s218846215 | Wrong Answer | d, n = map(int, input().split())
r = 100**d
print(r*n) |
p03324 | s559593652 | Wrong Answer | D,N = map(int,input().split())
print(N*100**D) |
p03324 | s956518335 | Wrong Answer | D,N=map(int,input().split())
print(N*100**D) |
p03324 | s534679582 | Wrong Answer | D,N = map(int,input().split())
if D == 0:
print(N)
else:
print((100**D)*N) |
p03324 | s245969842 | Wrong Answer | d,n =map(int,input().split())
if n%100 != 0:
ans = 10**d*n
else:
ans = 10**d*101
print(ans) |
p03324 | s775973104 | Wrong Answer | D, N = map(int, input().split())
list = []
i = 1
while len(list) < N:
if D != 0:
list.append(i * 100 ** D)
i += 1
else:
if i != 100:
list.append(i)
i += 1
else:
i += 1
print(list[-1])
|
p03324 | s958369447 | Wrong Answer | D,N = map(int,input().split())
if D == 0:
print(N)
else:
q = (N-1)&99
print((N-q)*(100**D)) |
p03324 | s657015475 | Wrong Answer | d,n=map(int,input().split())
if d==0:
print(n)
else:
print((100**d)*n)
|
p03324 | s915799047 | Wrong Answer | D,N=map(int,input().split())
if D==0:
print(N)
elif D==1:
print(100*N)
else:
print(10000*N) |
p03324 | s590690462 | Wrong Answer | d,n = map(int,input().split())
if d == 0:
print(n)
elif d == 1:
print(100*n)
else:
print(1000*n) |
p03324 | s065128681 | Wrong Answer | s = input().split()
d = int(s[0])
n = int(s[1])
answer = 0
if d == 0:
if n == 100:
answer = 101
else:
answer = n
elif d == 1:
answer = 100 * n
elif d == 2:
answer = 10000 * n
print(answer) |
p03324 | s217614621 | Wrong Answer | def main():
d, n = map(int, input().split())
div = 100**d
ans = div*n
print(ans)
if __name__ == "__main__":
main()
|
p03324 | s838369408 | Wrong Answer | d,n = map(int,input().split())
print(n*100**d) |
p03324 | s084379456 | Wrong Answer | d,n=map(int,input().split())
print(n*(100**d)) |
p03324 | s510445881 | Wrong Answer | N,C = map(int,input().split(' '))
print((100 ** N) * C)
|
p03324 | s298366355 | Wrong Answer | D, N = map(int, input().split())
if D == 0 and N < 100:
print(N)
elif D == 0 and N == 100:
print(101)
elif D == 1 and N < 100:
print(N * 100)
elif D == 1 and N == 100:
print(N)
elif D == 2 and N < 100:
print(N * 100 * 100)
elif D == 2 and N == 100:
print(N) |
p03324 | s822116370 | Wrong Answer | d,n = map(int,input().split())
ans = 0
if d == 0:
ans = n
elif d == 1:
ans = 100 * n
else:
ans = 10000 * n
if n == 100:
ans += n
print(ans) |
p03324 | s734961346 | Wrong Answer | from math import floor
D, N = map(int, input().split())
print((N-floor((N-1)/99))*100**D)
|
p03324 | s197202944 | Wrong Answer | d, n = map(int, input().split())
print(int(str(n) + str(100**d).replace("1", ""))) |
p03324 | s534520894 | Wrong Answer | d, n = map(int, input().split())
print(n*(10**(2*d))) |
p03324 | s444814886 | Wrong Answer | # import math
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque
# import numpy as np
# import scipy as scp
# 入力の受け取り
d,n = map(int,input().split())
if d ==0:
if n <=99:
ans = n
elif n==100:
ans = 101
elif d == 1:
if n <=99:
ans = n*100
elif n==100:
ans = 100*100+1
else:
if n <=99:
ans = n*100**2
elif n==100:
ans = 100*100**2+1
print(ans) |
p03324 | s149589514 | Wrong Answer | d,n=map(int,input().split())
print(100**d*n) |
p03324 | s206158015 | Wrong Answer | def main():
import sys
input = sys.stdin.readline
D, N = map(int, input().split())
if N != 100:
print(N, end="")
for i in range(D):
print("00", end="")
print("")
else:
print(100 ** (D+1) + 1)
if __name__ == '__main__':
main() |
p03324 | s529822115 | Wrong Answer | def main():
d,n=map(int,input().split())
print(100**d*(n))
if __name__ == "__main__":
main() |
p03324 | s702218031 | Wrong Answer | L, R = map(int,input().split())
print((100**L)*int((R-1)/99)+R) |
p03324 | s259342196 | Wrong Answer | d,n = map(int,input().split())
print((100)**d*n) |
p03324 | s701642001 | Wrong Answer | d, n = map(int, input().split())
if n == 100:
print(99 * 100 ** d)
else:
print(n * 100 ** d)
|
p03324 | s478559116 | Wrong Answer | # AtCoder Beginner Contest 100
# B - Ringo's Favorite Numbers
D,N=map(int,input().split())
L=[]
for i in range (1,105):
n=i*100**D
L.append(n)
print(L[N-1]) |
p03324 | s910265044 | Wrong Answer | d,n=map(int,input().split())
print(n*(100**d))
|
p03324 | s987522254 | Wrong Answer | # import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product
def resolve():
d,n=map(int,input().split())
val=100**d
if d==0 and n==100:
print(101)
elif d==1 and n==100:
print(10100)
elif d == 2 and n == 100:
print(10010000)
else:
print(val*n)
resolve() |
p03324 | s884684698 | Wrong Answer | d,n=map(int,input().split())
if d == 0:
print(n if n!=100 else "101")
elif d == 1:
print(n*100 if n!=100 else 10100)
else:
print(n*10000 if n!=100 else 1000100) |
p03324 | s919084298 | Wrong Answer | D, N = map(int, input().split())
print(N * (100**D))
|
p03324 | s119224082 | Wrong Answer | def resolve():
D, N = [int(i) for i in input().split()]
if D == 0:
print(N + (N) // 100)
return
print(100**D * N)
resolve()
|
p03324 | s521818445 | Wrong Answer | d, n = map(int, input().split())
ans = 100**d * (n)
if n==100:
ans+=1
print(ans) |
p03324 | s777526346 | Wrong Answer | d,n = map(int,input().split())
if d == 0:
num = 1 * n
print(num)
if d == 1:
num = 100 * n
print(num)
if d == 2:
num = 10000 * n
print(num) |
p03324 | s473411013 | Wrong Answer | d, n = map(int, input().split())
print(100 ** d * n)
|
p03324 | s231943489 | Wrong Answer | d, n = map(int, input().split())
div = 100 ** d
print(div * n) |
p03324 | s099483354 | Wrong Answer | D, N = map(int,input().split())
if N != 100:
print(str(N)+"0"*(D*2))
else:
print(int(str(N)+"0"*(D*2))+1)
|
p03324 | s948497841 | Wrong Answer | d, n = map(int, input().split())
if (d == 0 or d == 1) and n == 100:
print(100 ** d * 101)
else:
print(100 ** d ** n) |
p03324 | s485886466 | Wrong Answer | d, n = map(int, input().split())
count = 0
i = 1
if d==0:
print(5)
exit()
while True:
if i%100*d==0 and i//(100**d) < 100**d:
count += 1
if count == n:
print(i)
break
i += 1 |
p03324 | s493571583 | Wrong Answer | # max 2 100 -> 1000000 (intで表現可能)
# list[1]の数にlist[1]回100をかければよいはず
list = [int(i) for i in input().split(" ")]
for i in range(list[0]):
list[1] = list[1] * 100
print(list[1])
|
p03324 | s064458912 | Wrong Answer | D, N = list(map(int, input().split()))
print(N*100**D) |
p03324 | s380770693 | Wrong Answer | D, N = map(int, input().split())
if D == 0:
print(N)
elif D == 1:
print(100 * N)
else:
print(10000 * N) |
p03324 | s272413451 | Wrong Answer | n, k = map(int, input().split())
print((100**n)*k)
|
p03324 | s572720541 | Wrong Answer | # AtCoder Beginner Contest 100
# B - Ringo's Favorite Numbers
D,N=map(int,input().split())
if N==100:
print(N*101**D)
else:
print(N*100**D) |
p03324 | s221050018 | Wrong Answer | A = [1, 100, 10000]
d, n = map(int, input().split())
print(A[d] * n) |
p03324 | s251261641 | Wrong Answer | d,x=map(int,input().split())
print(x*100**d+(x==100)) |
p03324 | s844061040 | Wrong Answer | D,N = map(int, input().split())
if N == 100:
n = 2
else:
n = 0
print(N*(100**(D-n))) |
p03324 | s893495856 | Wrong Answer | a, b = map(int, input().split())
if a == 0:
if b == 100:
print(b + 1)
else:
print(b)
else:
cand = 100 **a
if b == 100**2 or 100**3:
print(cand * b + 1)
else:
print(cand * b) |
p03324 | s155052653 | Wrong Answer | import sys
input = sys.stdin.readline
D, N = map(int, input().rstrip().split())
if D == 0:
print(N)
else:
print(100 ** D * N)
|
p03324 | s326271607 | Wrong Answer | D, N = map(int, input().split())
print(int(str(N) + '00' * D) if N != 100 else int(str(N) + '00' * D) + 1)
|
p03324 | s245575982 | Wrong Answer | D, N = map(int, input().split())
ans = N * 100 ** D
print(ans)
|
p03324 | s404184201 | Wrong Answer | d, n = map(int,input().split())
i = 0
count = 0
while not count == n:
i += 1
if i % 100 == 0:
continue
else:
count += 1
print(i) |
p03324 | s218444628 | Wrong Answer | D,N = map(int,input().split())
if D==0 and N ==100:
ans = 100**D*N+1
else:
ans = 100**D*N
print(ans)
|
p03324 | s000322098 | Wrong Answer | D, N = map(int, input().split())
print(N*100**D) |
p03324 | s096638290 | Wrong Answer | D, N = map(int, input().split())
if N < 100:
ans = N * 100 ** D
else:
ans = N * 100 ** D + 1
print(ans)
|
p03324 | s053388854 | Wrong Answer | A,N=map(int, input().split())
print(N*10^A) |
p03324 | s418906580 | Wrong Answer | D, N = map(int, input().split())
d = 100 ** D * N
if d % 100 ** D == 0:
d += 1
print(d)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.