problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03324 | s997668758 | Wrong Answer | L, R = map(int,input().split())
print((100**L)*R) |
p03324 | s522998751 | Wrong Answer | D,N=map(int,input().split())
print(N*(100**D)) |
p03324 | s219896583 | Wrong Answer | D, N = [int(v) for v in input().strip().split(" ")]
print(pow(100, D) * N) |
p03324 | s183382733 | Wrong Answer | import sys
D,N = map(int,input().split())
if D not in [0,1,2] or not (1 <= N < 100):
sys.exit()
print(N*(100**D)) |
p03324 | s451465738 | Wrong Answer | d, n = map(int, input().split())
if d == 0:
ans = n
elif d == 1:
ans = n * 100
else:
ans = n * 10000
print(ans)
|
p03324 | s394403759 | Wrong Answer | from math import floor
D, N = map(int, input().split())
if D == 0:
print(N)
else:
print((N-floor((N-1)/99))*100**D)
|
p03324 | s629467758 | Wrong Answer | d, n = map(int, input().split())
d = 100**d
aa = []
for i, num in enumerate(range(100)):
num *= d
if i==n:
print(num)
break |
p03324 | s598350765 | Wrong Answer | d,n = map(int,input().split())
ans = 100**d*n
print(ans) |
p03324 | s492433597 | Wrong Answer | n,d=map(int,input().split())
if n<=99:
print(100**n*d)
else:
print(100**n*101) |
p03324 | s333441668 | Wrong Answer | d, n = map(int, input().split())
c = pow(100, d)
a = c * n
print(a)
|
p03324 | s812407423 | Wrong Answer | a, b =map(int, input().split())
if a==0:
result = b
else:
result = a*100 * b
print(result) |
p03324 | s974470940 | Wrong Answer | d,n=map(int,input().split())
if d==0:
print(n)
elif d==1:
print(100*n)
elif d==2:
print((100**2)*n)
|
p03324 | s168356589 | Wrong Answer | d, n = map(int, input().split())
num = 1
num = num * 100**d
print(num * n) |
p03324 | s642667583 | Wrong Answer | d, n = map(int, input().split())
ten = [1, 100, 10000]
print(ten[d] * n) |
p03324 | s470188926 | Wrong Answer | D, N = [int(x) for x in input().split()]
div = 100 ** D
print(N * div)
|
p03324 | s815366039 | Wrong Answer | D,N = map(int,input().split())
#0 5
A = [int(i) for i in range(1,101)]
B = [int(i*100) for i in range(1,101)]
C = [int(i*10000) for i in range(1,101)]
if D == 0:
print(A[N-1])
elif D == 1:
print(B[N-1])
else:
print(C[N-1]) |
p03324 | s160834150 | Wrong Answer | import numpy as np
d,n = map(int, input().split())
if(not(n==100)):
if(d==0):
print(n)
elif(d==1):
print(100*d)
else:
print(10000*d)
else:
if(d==0):
print(101)
elif(d==1):
print(10100)
else:
print(1000000) |
p03324 | s596641476 | Wrong Answer | d, n = map(int, input().split())
div = 100 ** d
print(div * n) |
p03324 | s223823201 | Wrong Answer | d,n=map(int,input().split())
print(100**d*n) |
p03324 | s041566072 | Wrong Answer | d,n = map(int,input().split())
print(n*(100**d)) |
p03324 | s493363366 | Wrong Answer | def main(d, n):
ans = []
for i in range(n):
ans.append(100**d * (i + 1))
print(ans[-1])
if __name__ == "__main__":
d, n = map(int, input().split())
main(d, n)
|
p03324 | s296133002 | Wrong Answer | # -*- coding: utf-8 -*-
D, N = map(int, input().split())
if (100 ** D * N) / 100 != 100 ** D:
print(100 ** D * N)
else:
print((100 ** D * N) + 100 * D) |
p03324 | s951063392 | Wrong Answer | d, n = map(int, input().split())
ans = 100 ** d * n
print(ans) |
p03324 | s147928430 | Wrong Answer | d,n = map(int, input().split())
if d == 0:
print(n)
elif d == 1:
print(n*100)
elif d == 2:
print(n*10000) |
p03324 | s342563463 | Wrong Answer | def main():
d,n = map(int, input().split())
if d == 100:
print(((100**d) * n) + 1)
sys.exit()
print((100**d) * n)
if __name__ == '__main__':
main() |
p03324 | s469985816 | Wrong Answer | d,n = list(map(int,input().split()))
if d == 0:
if n == 100:
print(101)
else:
print(n)
elif d == 1:
if n == 100:
print(10001)
else:
print(100*n)
else:
if n == 100:
print(1000000)
else:
print(10000*n) |
p03324 | s554624864 | Wrong Answer | d,n = map(int, input().split())
if(d==0):
print(100*n)
elif(d==1):
print(n*100)
else:
print(n*10000) |
p03324 | s191801599 | Wrong Answer | d, k = list(map(int, input().split()))
print(k * (100**d))
|
p03324 | s671226504 | Wrong Answer | def formula(d,n ):
return n*(100**d)
d,n = map(int, input().split())
if(d==0):
print(n)
else:
print(formula(d, n)) |
p03324 | s779979933 | Wrong Answer | import sys
input = sys.stdin.readline
# B - Ringo's Favorite Numbers
D, N = map(int, input().split())
print(100 ** D * N) |
p03324 | s235603538 | Wrong Answer | d,n=map(int,input().split())
if d==0:
print(n)
elif d==1:
print(n*100)
else:
print(n*10000) |
p03324 | s303431685 | Wrong Answer | import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
d, n = nm()
print(100**d * n) |
p03324 | s495516894 | Wrong Answer | D, N = map(int, input().split())
print((10 ** D) * N) |
p03324 | s654099186 | Wrong Answer | d,n=map(int,input().split())
n=str(n)
if d==0:
print(n)
elif d==1:
print(n+"00")
elif d==2:
print(n+"0000") |
p03324 | s043205940 | Wrong Answer | d, n = list(map(int, input().split()))
cnt = 0
i = 1
while True:
if(i % (100 ** d) == 0):
cnt += 1
if(cnt == n):
print(i)
exit()
i += 1 |
p03324 | s661400705 | Wrong Answer | d, n=map(int, input().split())
k=100**d
print(k*n) |
p03324 | s990632053 | Wrong Answer | d, n = map(int, input().split())
s = 0
if d == 0:
print(n)
exit()
for i in range(100 ** d, 100 ** (d + 1), 100 ** d):
s += 1
if s == n:
print(i)
exit()
|
p03324 | s779344134 | Wrong Answer | D,N=map(int,input().split())
l=[int(pow(100,D)*i) for i in range(1,N+1)]
print(l[N-1]) |
p03324 | s971638704 | Wrong Answer | D,N=map(int,input().split())
if D==0:
print(N)
if D==1:
if N==100:
print(10100)
else:
print(100*N)
if D==2:
if N==100:
print(1010000)
else:
print(10000*(N+1)) |
p03324 | s105964197 | Wrong Answer | d,n=map(int,input().split())
moto=100**d
print(moto*n) |
p03324 | s201633692 | Wrong Answer | d, n = map(int, input().split())
if d == 0:
print(n)
exit()
x = 100 **d
print(x*n) |
p03324 | s395087422 | Wrong Answer | d,n=map(int,input().split())
ans=n*(100**d)
print(ans) |
p03324 | s306275633 | Wrong Answer | D, N = map(int, input().split())
if D==0:
print(N)
else:
print(N*(100**D)) |
p03324 | s998364076 | Wrong Answer | D, N = map(int, input().split())
if N != 100:
print(N*100**D)
else:
print(100**D+1)
|
p03324 | s966731119 | Wrong Answer | d,n = map(int,input().split())
print(n*(100**d)) |
p03324 | s194150037 | Wrong Answer | D, N = map(int, input().split())
print(N * 10**(2*D))
|
p03324 | s746149379 | Wrong Answer | d,n=map(int,input().split())
l=[]
for i in range(1,n+1):
l.append(i*100**d)
print(l[-1]) |
p03324 | s817532033 | Wrong Answer | a = input()
b = a.split()
d = int(b[0])
n = int(b[1])
if n==100:
print((100**d)*n+1)
else:
print((100**d)*n)
|
p03324 | s873583701 | Wrong Answer | d,n = map(int,input().split())
print(100**d*n) |
p03324 | s478302939 | Wrong Answer | D, N = map(int, input().split())
anslst = [i for i in range(1, 101)]
for i in range(N):
anslst[i] = anslst[i] * 100 ** D
print(anslst[N - 1]) |
p03324 | s326923468 | Wrong Answer | d,n = map(int,input().split())
if d == 0:
if n == 100:
ans = 101
else:
ans = n
elif d == 1:
if n == 100:
ans = 10100
else:
ans = 100 * n
elif d == 2:
if n == 100:
ans = 1000100
else:
ans = 10000 * n
print(ans)
|
p03324 | s366504426 | Wrong Answer | d, n = [int(i) for i in input().split()]
x = 100**d
print(x*n) |
p03324 | s596478780 | Wrong Answer | D, N = map(int, input().split())
if N < 99:
print(100**D*N)
elif N == 100:
print(100**D*101)
|
p03324 | s297152264 | Wrong Answer | D, N = map(int, input().split())
if D == 2:
print(N*10000)
elif D == 0:
if N == 100:
print(101)
else:
print(N)
else:
if N == 100:
print(10100)
else:
print(N*100) |
p03324 | s225844048 | 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 | s300951385 | Wrong Answer | D,N = map(int,input().split())
if D == 0: print(N)
else:
gen = 100**D
res = 0
count = 0
while (True):
res += gen
count2 = 0
x = res
while x >= 100:
x //= 100
count2 += 1
if count2 == D: count+=1
if count==N: break
print(res) |
p03324 | s422576346 | Wrong Answer | D, N = map(int, input().split())
if D == 0:
if N == 100:
print(101)
else:
print(N)
else:
print(100 ** D * N)
|
p03324 | s727575638 | Wrong Answer | d, n = map(int, input().split())
t = 100**d
print(t*n) |
p03324 | s910120555 | Wrong Answer | d, n = map(int,input().split())
print(int(str(n) + '00' * d)) |
p03324 | s119274695 | Wrong Answer | D,N = map(int, input().split())
ans = N*100**D
print(ans) |
p03324 | s473983088 | Wrong Answer | d,n = map(int,input().split())
ans = n * 100**d
print(ans) |
p03324 | s349419598 | Wrong Answer | d,n=map(int,input().split())
x = (100**d)*n
if d==0 and x%100==0:
print(x+1)
else:
print(x)
|
p03324 | s234355455 | Wrong Answer | d, n = map(int, input().split())
# print(100 ** 0)
# print(100 ** 1)
# print(100 ** 2)
start = 100 ** d
# step = 100 ** d
# end
# print(start * n)
value = start
count = 1
while True:
if n == count:
break
value += start
if d == 0:
if value % 100 != 0:
count += 1
elif d == 1:
if value % 10000 != 0:
count += 1
else:
count += 1
print(value) |
p03324 | s732130413 | Wrong Answer | A = [1, 100, 10000]
d, n = map(int, input().split())
ans = A[d] * n
print(ans if ans % 100 != 0 else ans + 1) |
p03324 | s250796930 | Wrong Answer | d, n = map(int, input().split())
num = 100 ** d
print(num * n)
|
p03324 | s234995460 | Wrong Answer | d,n = map(int, input().split())
print(100**d * n) |
p03324 | s259549135 | Wrong Answer | a,b = map(int,input().split())
print(100**a*b) |
p03324 | s318043446 | Wrong Answer | INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
a,b=INTM()
print((100**a)*b)
if __name__ == '__main__':
do() |
p03324 | s738577448 | Wrong Answer | d,n = map(int,input().split())
print(n*100**d) |
p03324 | s126892935 | Wrong Answer | D,N=map(int,input().split())
print(((100**D)*N) if N<100 else print((N+1)*(100**D))) |
p03324 | s746110318 | Wrong Answer | #!/usr/bin/env python3
d, n = map(int, input().split())
print(n, "00" * d, sep="")
|
p03324 | s036467972 | Wrong Answer | def solve():
D, N = map(int, input().split())
print(100 ** D * N)
if __name__ == "__main__":
solve() |
p03324 | s078137140 | Wrong Answer | x,y= map(int, input().split())
if x==0:
print(y)
elif x==1:
print(y*100)
elif x==2:
print(y*10000)
|
p03324 | s745860078 | Wrong Answer | def ringo(d , n):
return n * 100**d
def main():
d , n = map(int , input().split())
print(ringo(d , n))
if __name__ == '__main__':
main() |
p03324 | s710036499 | Wrong Answer | d,n = map(int,input().split())
print(100**d*n) |
p03324 | s429267023 | Wrong Answer | d, n = map(int, input().split())
ans = (100**d)*n
print(ans) |
p03324 | s018915729 | Wrong Answer | #n=int(input())
d,n=map(int,input().split())
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
add=100**d
total=0
for i in range(n):
total+=add
print(total) |
p03324 | s218904190 | Wrong Answer | D,N = map(int,input().split())
if D == 0:
if N==100:
print(N+1)
else:
print(N)
else:
print((100**D)*N)
|
p03324 | s116743735 | Wrong Answer | d,n = map(int, input().split())
#print(d,n)
if d == 0:
print(n)
elif d == 1:
print(100*n)
else:
print(10000*n)
|
p03324 | s789541130 | Wrong Answer | def main():
D, N = map(int, input().split())
if D == 0:
print(N)
elif D == 1:
print(100*N)
elif D == 2:
print(10000*N)
main() |
p03324 | s557647826 | Wrong Answer | D, N = map(int, input().split())
coef = 100**D
skip = N // 100**(D+1)
print(coef * (N+skip)) |
p03324 | s361173914 | Wrong Answer | d, n = map(int, input().split())
print(100 ** d * n)
|
p03324 | s598184854 | Wrong Answer | import sys
input = sys.stdin.readline
def main():
D, N = [int(x) for x in input().split()]
ans = 100 ** D * N
if N == 100:
print(ans + 1)
else:
print(ans)
if __name__ == '__main__':
main()
|
p03324 | s760899915 | Wrong Answer | d, k = list(map(int, input().split()))
x = 100 ** d
ans = 0
for i in range(0, (k + 1) * x, x):
ans = i
print(ans)
|
p03324 | s688346311 | Wrong Answer | D,N = map(int,input().split())
ans = (100**D)*N
if D==0:
ans = N
print(ans) |
p03324 | s494390540 | Wrong Answer | d,n=map(int,input().split())
print(100**d*n) |
p03324 | s885947453 | Wrong Answer | x = input()
print(x)
print("Hello World!") |
p03324 | s804073008 | Wrong Answer | d, n = map(int, input().split())
print(n*(100**d))
|
p03324 | s862824208 | Wrong Answer | d,n=map(int,input().split())
print(100**d*n) |
p03324 | s127176779 | Wrong Answer | d,n = map(int,input().split())
if d == 0:
if n == 100:
ans = 101
else:
ans = n
elif d == 1:
ans = 100 * n
elif d == 2:
ans = 10000 * n
print(ans)
|
p03324 | s743672875 | Wrong Answer | # coding: utf-8
import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
D, N = lr()
answer = 100 ** D * N
print(answer)
|
p03324 | s012832598 | Wrong Answer | from math import floor
D, N = map(int, input().split())
print((N-floor((N-1)/99))*100**D) |
p03324 | s575151298 | Wrong Answer | D,N = map(int,input().split())
print((100^D)*N) |
p03324 | s524982281 | Wrong Answer | d,n=list(map(int,input().split()))
if d==0:
print(n)
else:
print(n*(pow(100,d))) |
p03324 | s869752623 | Wrong Answer | d,n=map(int,input().split())
print(100**d*n)
|
p03324 | s154710915 | Wrong Answer | d, n = map(int, input().split())
cnt = 0
ans = 0
if(d == 0):
for i in range(1, 101):
if(i % 100 != 0):
cnt += 1
if(cnt == n):
ans = i
print(ans)
break
else:
for j in range(1, 101):
ans = 100**d*j
cnt += 1
if(cnt == n):
print(ans)
break |
p03324 | s899265792 | Wrong Answer | a, b = list(map(int, input().split()))
ans = 100 ** a * b
print(ans) |
p03324 | s161631864 | Wrong Answer | D,N = map(int,input().split())
if D == 0:
print(N)
else:
lis = ["{}".format(N)]
for i in range(1,2*D+1):
lis.append("0")
print(int("".join(lis))) |
p03324 | s117841634 | Wrong Answer | d,n=map(int,input().split())
if d==0:
print(n)
elif d==1:
print(n*100)
else:
print(n*10000) |
p03324 | s037129297 | Wrong Answer | def read_ints():
return[int(i) for i in input().split()]
def main():
d, n = read_ints()
print(100 * (100**d) + 1 if n == 100 else (100**d)*n)
if __name__ == '__main__':
main() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.