problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03324 | s804525076 | Wrong Answer | d, n = map(int, input().split())
s = 0
if d == 0:
print(n)
exit()
for i in range(100 ** d, 100 ** (d * 2) + 1, 100 ** d):
s += 1
if s == n:
print(i)
exit()
|
p03324 | s732735504 | Wrong Answer | d, k = map(int, input().split())
if d == 0:
print(k)
elif d == 1:
print(k * 100)
else:
print(k * 100 ** 2) |
p03324 | s184519109 | Wrong Answer | d,n = map(int,input().split())
print(100**d*n) |
p03324 | s195276889 | Wrong Answer | D, N = map(int, input().split())
if D == 0:
print(N)
elif D == 1:
print(N * 100)
else:
print(N * 10000) |
p03324 | s226658670 | 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 | s316631858 | Wrong Answer | #abc100 b
d,n=map(int,input().split())
ans=n*100**d
print(ans) |
p03324 | s126925494 | Wrong Answer | D, N = map(int, input().split())
list = []
i = 1
while len(list) < N:
if D == 2:
list.append(10000 * i)
i += 1
elif D == 1:
list.append(100 * i)
i += 1
else:
list.append(i)
i += 1
print(list[-1])
|
p03324 | s647414271 | Wrong Answer | D,N = list(map(int, input().split()))
if D == 0: d = 1
elif D == 1 : d = 100
else: d = 10000
print(N*d) |
p03324 | s776751237 | Wrong Answer | D, N = map(int,input().split())
z = 0
x = 1
y = 0
if D == 0:
while z == 0:
if x % 100 != 0:
y += 1
if y == N:
print(x)
z += 1
x += 1
exit()
while z == 0:
if x % (100 ** D) == 0:
y += 1
if y == N:
print(x)
z += 1
x += 1
|
p03324 | s703448260 | Wrong Answer | d, n = map(int, input().split())
if d == 0 and n == 100:
print(101)
exit()
print(100**d * n) |
p03324 | s168684872 | Wrong Answer | d,n = map(int,input().split())
ans = 100**d * n
print(ans) |
p03324 | s338290779 | Wrong Answer | D, N = map(int, input().split())
print(N * 100 ** D)
|
p03324 | s451575042 | Wrong Answer | D, N = map(int, input().split())
ans = 0
if(D == 0):
print(N)
else:
ans = N
ans = ans * 10 ** (D+2)
print(ans) |
p03324 | s475989540 | Wrong Answer | n,d=map(int,input().split())
if n<=99:
print(100**n*d)
else:
print(10**n*101) |
p03324 | s692650896 | Wrong Answer | d, n = map(int,input().split())
if n == 100:
print(1010000)
else:
print(100 ** d * n) |
p03324 | s276862852 | Wrong Answer | d,n=map(int,input().split())
print((100**d)*n) |
p03324 | s945083449 | Wrong Answer | a,b=map(int,input().split())
res = 0
if a == 0:
res = b
elif a == 1:
res =100*b
elif a == 2:
res =10000*b
print(res) |
p03324 | s440945449 | Wrong Answer | D,N=map(int,input().split())
print(100**D*N) |
p03324 | s012640258 | Wrong Answer |
def main():
D, N = map(int, readline().split())
if N!=100:
ans = 100**D * N
else:
ans = 100**D*(N+1)
print(ans) |
p03324 | s246808218 | Wrong Answer | d, n = map(int, input().split())
print((1000 ** d) * n ) |
p03324 | s778942603 | Wrong Answer | d,n = map(int,input().split())
print(100**d * n) |
p03324 | s882748152 | Wrong Answer | d,n = map(int,input().split())
if n !=100:
if d !=0:
print((100**d)*n)
else:
print(n)
else:
print(101*(100*d)) |
p03324 | s780278255 | Wrong Answer | D, N = map(int, input().split())
ans = []
jo = 0
for i in range(1, 1000):
tmp = (100 ** D) * i
if tmp // 100 == 100 ** D:
continue
else:
ans.append(tmp)
print(ans[N-1]) |
p03324 | s009338331 | Wrong Answer | d, n = map(int, input().split())
l = []
if d != 0:
for i in range(1, 102):
a = 100**d
l.append(a*i)
l.sort()
print(l[n-1])
else :
print(n)
|
p03324 | s820921061 | Wrong Answer | d, n = map(int, input().split())
count = 0
i = 1
while True:
if i%100*d==0 and i//(100**d) < 100**d:
count += 1
if count == n:
print(i)
break
i += 1 |
p03324 | s702173695 | Wrong Answer | #--------------------------------------------
#ライブラリ呼び出し
import sys
import math
#--------------------------------------------
D, N = map(int, input().split())
if D ==100:
D=101
a=100**D
print(a*N) |
p03324 | s907092763 | Wrong Answer | D,N=map(int,input().split())
ans=N*(100**D)
if N==100:
ans+=1
print(ans) |
p03324 | s032086605 | Wrong Answer | def main():
D, N = map(int, input().split())
if D == 0:
print(N)
if D == 1:
print(100 * N)
if D == 2:
print(10000 * N)
if __name__ == '__main__':
main()
|
p03324 | s317327208 | Wrong Answer | def main():
D, N = map(int, input().split())
print(pow(100, D) * N)
if __name__ == '__main__':
main()
|
p03324 | s399314979 | Wrong Answer | D, N = map(int, input().split())
if D == 0:
print(N)
elif D == 1:
print(N * 100)
else:
print(N*10000) |
p03324 | s435996305 | Wrong Answer | D,N=map(int,input().split())
if N==100:
print(N*(100**(D-1)))
else:
print(N*(100**D)) |
p03324 | s029155875 | Wrong Answer | D, N = map(int, input().split())
print(100**D * N) |
p03324 | s775108351 | Wrong Answer | D,N=map(int,input().split())
if D==0: print(N)
elif D==1: print(100*N)
else: print(10000*N) |
p03324 | s511336935 | Wrong Answer | D, N = map(int, input().split())
li = [i * 100 ** D for i in range(1, N + 1)]
print(li.pop())
|
p03324 | s199378854 | Wrong Answer |
def myAnswer(D:int, N:int) -> int:
return 100**D * (N - (N - 1)//99)
def modelAnswer():
tmp=1
def main():
D,N =map(int,input().split())
print(myAnswer(D,N))
if __name__ == '__main__':
main() |
p03324 | s949579478 | Wrong Answer | D,N=map(int,input().split())
if N!=100:
if D==0:
print(N)
elif D==1:
print(100*N)
else:
print(10000*N)
else:
if D==0:
print(101)
elif D==1:
print(100001)
else:
print(1000001)
|
p03324 | s582896009 | Wrong Answer | D, N = map(int, input().split())
if D == 0:
print(N)
elif D == 1:
print(N * 100)
elif D == 2:
print(N * 100 ** 2) |
p03324 | s860854095 | Wrong Answer | d, n = map(int, input().split())
print(100**d+n) |
p03324 | s237569861 | Wrong Answer | d, n = map(int,input().split())
print(100**d * n) |
p03324 | s600018902 | Wrong Answer | #template
def inputlist(): return [int(j) for j in input().split()]
from collections import Counter
#template
#issueから始める
D,N = inputlist()
print(str(N)+'0'*2*D) |
p03324 | s629209986 | Wrong Answer | D, N = map(int, input().split())
print(100**D*N) |
p03324 | s914830317 | Wrong Answer | d,n=map(int,input().split())
print(100**d*n) |
p03324 | s745574599 | Wrong Answer | d, n = map(int, input().split())
print(str(n) + str(100**d).replace("1", "")) |
p03324 | s330060075 | Wrong Answer | D, N = map(int, input().split())
print(N*(10**D)) |
p03324 | s360998667 | Wrong Answer | d, n = map(int, input().split())
print((100**d)*n) |
p03324 | s571281599 | Wrong Answer | d,n = map(int,input().split())
array = []
for i in range(n):
array.append((100**d)*(i+1))
print(array[-1])
|
p03324 | s049765841 | Wrong Answer | D,N=map(int,input().split())
if D==0: print(N)
elif D==1: print(100*N)
else: print(200*N) |
p03324 | s310122350 | Wrong Answer | def solve(D, N):
ans = 100**D * N
return ans
if __name__ == "__main__":
D, N = map(int, input().split())
print(solve(D, N))
|
p03324 | s684058153 | Wrong Answer | d, n = map(int, input().split())
ans = 0
if d == 0:
ans = n
if d == 1:
ans = n*100
if d == 2:
ans = n*10000
print(ans)
|
p03324 | s050692949 | Wrong Answer | D,N=map(int,input().split())
print(N*100**D) |
p03324 | s460991356 | 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(101)
elif D == 2 and N < 100:
print(N * 100 * 100)
elif D == 2 and N == 100:
print(101) |
p03324 | s312292644 | Wrong Answer | # coding: utf-8
# Your code here!
d,n=map(int,input().split())
print(100**d*n) |
p03324 | s997509308 | Wrong Answer | n,d=map(int,input().split())
print(d*10**n) |
p03324 | s882624785 | Wrong Answer | d, n = map(int, input().split())
print((100 ** d) * n ) |
p03324 | s936611654 | 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 | s462602326 | Wrong Answer | d, n = map(int, input().split())
if d == 0:
if n == 100:
print(101)
else:
print(n)
elif d == 1:
if n == 100:
print(10100)
else:
print(n*100)
else:
if n == 100:
print(1001000)
print(n*10000)
|
p03324 | s581140515 | Wrong Answer | def main():
d, n = map(int, input().split())
ans = 100 ** d * n
if n == 100:
ans += 100
print(ans)
if __name__ == "__main__":
main()
|
p03324 | s382920840 | Wrong Answer | D, N = [int(x) for x in input().split()]
div = 100 ** D
print(div)
print(N * div)
|
p03324 | s486390838 | Wrong Answer | D,N = map(int, input().split())
print(N*100**D) |
p03324 | s488594155 | Wrong Answer | def main():
d, n = map(int, input().split())
div = 100**d
ans = div*n
if n == 100:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p03324 | s229681007 | Wrong Answer | D,N = map(int, input().split())
if N == 100:
print(N*(100**D))
else:
print(101*(100**D)) |
p03324 | s661209191 | Wrong Answer | D_kai, N_ban = map(int, input().split())
begin = 100 ** D_kai
ctr = 0
for i in range(1, 10000):
if (i % 100 != 0):
ctr += 1
if (ctr == N_ban):
ans = begin * ctr
break
print(ans) |
p03324 | s029164451 | Wrong Answer | a,b=(int(i) for i in input().strip().split(" "))
print(b*(100**a)) |
p03324 | s842745077 | Wrong Answer | d, n = map(int, input().split())
print(n * 100 ** d) |
p03324 | s073405525 | Wrong Answer | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
D, N = map(int, input().split())
print((100**D) * N)
if __name__ == "__main__":
main()
|
p03324 | s381763934 | Wrong Answer | import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
D, N = map(int, input().split())
print(100 ** D * N) |
p03324 | s369895969 | Wrong Answer | D,N=map(int,input().split())
if D==0 :
print(N)
else :
print(100**D*N) |
p03324 | s150600574 | Wrong Answer | D, N = map(int, input().split())
li = [i * 100 ** D for i in range(100)]
print(li[N]) if N != 100 else print(li[N - 1]) |
p03324 | s454681271 | Wrong Answer | d, n = map(int, input().split())
if d == 0:
print(n)
else:
print(n * (100 ** d)) |
p03324 | s551279959 | Wrong Answer | a,b = map(int,input().split())
c = 100 ** a
print(c * b)
|
p03324 | s083680256 | Wrong Answer | d, n = map(int, input().split())
ans = (100 ** d) * n
print(ans) |
p03324 | s719960771 | Wrong Answer | d,n=map(int,input().split())
if d==0:
print(1*n)
elif d==1:
print(100*n)
else:
print(10000*n) |
p03324 | s700054415 | Wrong Answer | D, N = map(int, input().split())
if D == 0:
print(N)
elif D == 1:
print(100 * N)
else:
print(10000 * N) |
p03324 | s597556558 | Wrong Answer | import sys
input = sys.stdin.readline
d, n= map(int, input().split())
if n == 100:
print(101**d)
exit(0)
print(100**d*n)
|
p03324 | s387196331 | Wrong Answer | d, n = map(int, input().split())
if d == 0:
print(n)
elif d == 1:
print(100*n)
elif d == 2:
print(10000*n) |
p03324 | s978339305 | Wrong Answer | D, N = map(int, input().split())
ans = 100**D * N
print(ans) |
p03324 | s822933738 | Wrong Answer | d,n=input().split()
ans=n+"00"*int(d)
print(ans) |
p03324 | s592961055 | Wrong Answer | d, n = map(int,input().split())
result = 0
for i in range(1,n+1):
if i // 100 == 0:
result = i*(100**d)
else:
result = i*(100**d)+1
print(result)
|
p03324 | s492048683 | Wrong Answer | a,b=map(int,input().split())
print((100**a)*b) |
p03324 | s790979481 | Wrong Answer | a=input().split(" ")
d=100**int(a[0])
k=int(a[1])
ans=d*k
print(ans) |
p03324 | s083228962 | Wrong Answer | #!/usr/bin/env python3
d, n = list(map(int, input().split()))
if n == 100:
if d == 0:
print(100+1)
elif d == 1:
print(100*100+1)
else:
print(100*1000+1)
else:
if d == 0:
print(n)
else:
print((100**d)*n)
|
p03324 | s047510896 | Wrong Answer | D,N = (int(X) for X in input().split())
print(N*pow(100,D)) |
p03324 | s308913078 | Wrong Answer | D, N = [int(i) for i in input().split()]
hundreds = [i for i in range(1, 10001) if i % 100 == 0]
tenthousands = [i for i in range(1, 1000001) if i % 10000 == 0]
if D == 0:
print(N)
elif D == 1:
print(hundreds[N-1])
else :
print(tenthousands[N-1]) |
p03324 | s085306735 | Wrong Answer | d, n = map(int,input().split())
print(str(n)+'00'*d)
|
p03324 | s595263879 | Wrong Answer | D, N = map(int, input().split())
print((100**D)*N) |
p03324 | s947760057 | Wrong Answer | d,n = map(int,input().split())
if d==0:
print(n)
elif d==1:
print(n*100)
else:
print(n*10000) |
p03324 | s489047110 | Wrong Answer | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
d, n = map(int, input().split())
print((100 ** d) * n)
|
p03324 | s571599794 | Wrong Answer | D , N = map(int, input().split())
C = []
if D == 0 :
for i in range(1,N+5):
if i%100 != 0 :
C.append(i)
print(C[N-1])
if D == 1:
print(100*N)
if D == 2:
print(10000*N) |
p03324 | s344603900 | Wrong Answer | d,n=map(int,input().split())
print(100**d*n) |
p03324 | s867238386 | Wrong Answer | d,n = map(int, input().split())
print(1+(100**d)*n if n==100 else (100**d)*n) |
p03324 | s955621160 | Wrong Answer | D, N = map(int, input().split())
ans=N * (100**D)
print(ans) |
p03324 | s375344916 | Wrong Answer | d,n = map(int, input().split())
if d == 100:
print(int(100**d*100+(100**d)))
else:
print(int((100**d*n))) |
p03324 | s159007843 | Wrong Answer | p,q= input().split()
a,b =(int(p), int(q))
print(100**a*b) |
p03324 | s395888923 | Wrong Answer | D, N = map(int, input().split())
if N == 100:
print(100 ** (D+1) + 1)
else:
print(100 ** D * N) |
p03324 | s713754629 | Wrong Answer | import sys
sys.setrecursionlimit(10**6)
d,n=map(int,input().split())
if d==0:
print(n)
else:
print(n*100**d)
|
p03324 | s537611349 | Wrong Answer | D,N = map(int,input().split())
ans = []
jo = 0
for i in range(1,N+1):
tmp = (100**D)*i
if tmp // 100 == 100**D:
jo += 1
else:
ans.append(tmp)
print(ans[N-1-jo]) |
p03324 | s962493964 | Wrong Answer | n,k=map(int,input().split())
print(pow(100,n)*k) |
p03324 | s806032261 | Wrong Answer | D, N = map(int, input().split())
print(100**D*N) |
p03324 | s139653103 | Wrong Answer | import math
def main():
d,n = list(map(int,input().split()))
print(pow(100,d)*n)
main()
|
p03324 | s384119773 | Wrong Answer | d, n = map(int, input().split())
if d==0:
print(n)
elif d==1:
if n<100:
print(n*100)
else:
print(10100)
elif d==2:
if n<100:
print(n*10000)
else:
print(n*10000+10000) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.