problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03324 | s991251349 | Accepted | a=input();print(int(eval(a[2:])*1.01)*100**int(a[0])) |
p03324 | s595303112 | Accepted | D, N = map(int, input().split())
print(100 ** D * (N + N // 100)) |
p03324 | s242483213 | Accepted | d,n=map(int,input().split())
num=100**d
if n==100:
print(num*101)
else:
print(num*n) |
p03324 | s123082501 | Accepted | a,b = map(int,input().split())
if b == 100:
print((100**a)*101)
exit()
print((100**a)*b) |
p03324 | s070349839 | Accepted | N, D = map(int,input().split())
print(pow(100,N)*D if D != 100 else pow(100,N)*(D+1)) |
p03324 | s991181851 | Accepted | d, n = map(int, input().split())
if n == 100:
print(100**d*(n+1))
else:
print(100**d*n) |
p03324 | s833767855 | Accepted | d, n = map(int, input().split())
if n < 100:
print(n * 100 ** d)
else:
print((n + 1) * 100 ** d) |
p03324 | s904109679 | Accepted | D, N = map(int, input().split())
if N < 100:
print(100**D*N)
elif N == 100:
print(100**D*101)
|
p03324 | s877136304 | Accepted | d,n=input().split()
if n=="100":
n="101"
d=int(d)
for i in range(d):
n+="00"
print(n) |
p03324 | s666960917 | Accepted | a,b=map(int, input().split())
if b == 100:
b += 1
print(b*100**a)
|
p03324 | s146138934 | Accepted | a,b = map(int,input().split())
if b==100:
b+=1
ans = b*100**a
print(ans)
|
p03324 | s953291819 | Accepted | d,n=map(int, input().split())
print(n*(100**d) if n<100 else 101*(100**d))
|
p03324 | s854625213 | Accepted | d, n = map(int, input().split())
if n == 100:
n += 1
print(100 ** d * n)
|
p03324 | s682615452 | Accepted | d,n = map(int,input().split())
if n!= 100:
print(n*(100**d))
else:
print((n+1)*(100**d)) |
p03324 | s510307510 | Accepted | d,n=map(int,input().split())
if n==100:
print(100**d*(n+1))
else:
print(100**d*n) |
p03324 | s511915535 | Accepted | D, N = list(map(lambda x : int(x), input().split(" ")))
print((N + int(N/100)) * (100 ** D)) |
p03324 | s520772367 | Accepted | d, n = map(int, input().split())
ans = (100 ** d) * n if n != 100 else (100 ** d) * 101
print(ans) |
p03324 | s291105945 | Accepted | d,n=map(int,input().split())
a=[100**d*i for i in range(n+1)]
if d==0 and n==100:
print(101)
elif d==1 and n==100:
print(10100)
elif d==2 and n==100:
print(1010000)
else:
print(a[-1]) |
p03324 | s889924090 | Accepted | D, N = map(int, input().split())
if N == 100:
print('101'+D*'00')
else:
print(str(N)+D*'00')
|
p03324 | s102705296 | Accepted | D, N = map(int, input().split())
'''
q = (N-1)//99
print((100*q + N - 99*q)* 100**D)
'''
if N == 100:
print(100**D*(N+1))
else:
print(100**D*N) |
p03324 | s446885229 | Accepted | D, N = map(int, input().split())
if N == 100:
ans = 101 * 100**D
else:
ans = N * 100**D
print(ans) |
p03324 | s309566924 | Accepted | d, n = list(map(int, input().split()))
if n == 100:
n += 1
print(100**d * n)
|
p03324 | s757694846 | Accepted | # abc100_b.py
D,N = map(int,input().split())
if N ==100:
print(100**D * (N+1))
else:
print(100**D * N)
|
p03324 | s395812848 | Accepted | D,N=map(int,input().split())
if N==100:
X=(100**D)*(N+1)
else:
X = (100**D)*N
print(X) |
p03324 | s350651321 | Accepted | a, b = map(int, input().split())
dst = str(b) + str(100 ** a)[1:] if a != 0 else str(b)
if b == 100: dst = str(int(dst) + 100 ** a) if a != 0 else str(int(dst) + 1)
print(dst)
|
p03324 | s213145110 | Accepted | a=input();print(int(eval(a[2:5])*1.01)*100**int(a[0])) |
p03324 | s028603520 | Accepted | D, N = map(int, input().split())
if N <= 99:
print(N, end = "")
for _ in range(D):
print("00", end = "")
print("")
else:
if D == 0:
print(101)
elif D == 1:
print(10100)
else:
print(1010000) |
p03324 | s199714645 | Accepted | d,n =map(int,input().split())
if n%100 != 0:
ans = 100**d*n
else:
ans = 100**d*101
print(ans) |
p03324 | s467423258 | Accepted | import numpy as np
D, N = map(int, input().split())
def cnt(n):
tmp = 0
n = n*1.0
while n.is_integer():
if (n/100.0).is_integer():
tmp += 1
n = n / 100.0
else:
break
return tmp
coef = 100**D
whole = np.array([i*coef for i in range(1, 150)])
result = np.array(list(map(cnt, whole)))
print(whole[np.where(result==D)][N-1]) |
p03324 | s612764238 | Accepted | 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(100*n)
else:
if n==100:
print("1010000")
else:
print(10000*n) |
p03324 | s640706403 | Accepted | import sys
input = sys.stdin.readline
def main():
D, N = [int(x) for x in input().split()]
if N == 100:
N += 1
ans = 100 ** D * N
print(ans)
if __name__ == '__main__':
main()
|
p03324 | s337440360 | Accepted | d,n = map(int,input().split())
if n != 100:
print(100**d*n)
else:
print(100**d*(n+1)) |
p03324 | s144788974 | Accepted | D, N = map(int, input().split(" "))
print(((100**D)*(N+(N//100))))
|
p03324 | s339328679 | Accepted | def solv(t):
c = 0
while t % 100 == 0:
t /= 100
c += 1
return c
D, N = map(int, input().split())
t = 1
c = 0
while c < N:
n = solv(t)
if n == D:
c += 1
t += 1
print(t -1) |
p03324 | s902574094 | Accepted | d,n = map(int,input().split())
if n == 100:n+=1
print(n*(100**d))
|
p03324 | s890133706 | Accepted | D,N = map(int, input().split())
a = 0
if N==100: N=101
print(N*pow(100,D) + a) |
p03324 | s865427393 | Accepted | d, n = map(int, input().split())
ans = (100**d)*n
if n == 100:
ans += 100**d
print(ans) |
p03324 | s263996107 | Accepted | import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial
from bisect import bisect_left #bisect_left(list, value)
#from fractions import gcd
sys.setrecursionlimit(10**7)
enu = enumerate
MOD = 10**9+7
def input(): return sys.stdin.readline()[:-1]
def pri(x): print('\n'.join(map(str, x)))
D, N = map(int, input().split())
val = 100**D
if N<100:
print(val*N)
else:
print(val*N + val)
|
p03324 | s356915870 | Accepted | a,b=map(int,input().split())
if b<100:print((100**a)*b)
if b==100:print((100**a)*(b+1)) |
p03324 | s141787106 | Accepted | d, n = [int(x) for x in input().split()]
gap = 100 ** d
gap_check = gap * 100
count = 0
ans = 0
while True:
ans += gap
if ans % gap_check != 0:
count += 1
if count >= n:
break
print(ans) |
p03324 | s348217772 | Accepted | d,n=map(int,input().split())
if n == 100: n = 101
print(n*10**(2*d)) |
p03324 | s254866573 | Accepted | D, N = map(int, input().split())
if N == 100:
N += 1
print(N * 100**D) |
p03324 | s191116019 | Accepted | d, n = map(int, input().split())
ans = 100 ** d * n
if n == 100:
ans += 100 ** d
print(ans) |
p03324 | s424594570 | Accepted | d, n = map(int, input().split())
def division(x):
if x % 100 != 0:
return 0
else:
return division(x//100) +1
count= 0
for i in range(1, 1010001):
if division(i) == d:
count +=1
if count == n:
print(i)
break |
p03324 | s109226018 | Accepted | d,n = map(int,input().split())
if n==100: n+=1
if d==0: print(n)
elif d==1: print(100*n)
else: print(10000*n) |
p03324 | s250269780 | Accepted | d,n=map(int,input().split())
print(n*(100**d) if n<100 else (n+1)*(100**d)) |
p03324 | s529790944 | Accepted | d, n = map(int, input().split())
if n == 100:
n += 1
print(100**d*n) |
p03324 | s999096254 | Accepted | d, n = (int(i) for i in input().split())
ans = 100**d
add = ans
for i in range(n-1):
ans += add
if ans / (100**d) % 100 == 0:
ans += add
print(ans)
|
p03324 | s776962451 | Accepted | def calc(x):
ret = 0
while x % 100 ==0:
x /= 100
ret += 1
return ret
D, N = map(int, input().split())
cnt = 0
val = 0
while cnt < N:
val += 1
if calc(val) == D:
cnt += 1
print(val)
|
p03324 | s010722485 | Accepted | D, N = map(int,input().split())
if D == 2:
if N < 100:
print(N*10000)
else:
print(1010000)
elif D == 1:
if N < 100:
print(N*100)
else:
print(10100)
else:
if N < 100:
print(N)
else:
print(101) |
p03324 | s620244601 | Accepted | d,n = map(int,input().split())
if n == 100:
print(101*100**d)
else:
print(n*100**d) |
p03324 | s050845033 | Accepted | d,n = map(int,input().split())
if d == 0:
if n == 100:
print(101)
else:
print(n)
else:
tmp = 100**d
if n == 100:
print(101*tmp)
else:
print(tmp*n) |
p03324 | s644224746 | Accepted | d, k = list(map(int, input().split()))
if k == 100:
print(101 * (100**d))
else:
print(k * (100**d))
|
p03324 | s090581508 | Accepted | x, y = map(int,input().split())
if x == 0:
if y == 100:
print(101)
else:
print(y)
if x == 1:
if y == 100:
print(10100)
else:
print(y*100)
if x == 2:
if y == 100:
print(1010000)
else:
print(y*10000) |
p03324 | s837056918 | Accepted | d,n=map(int,input().split())
if n==100:
print(100**(d+1)+100**d)
else:
print(100**d*n) |
p03324 | s336358856 | Accepted | 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()
if b==100:
b=101
print((100**a)*b)
if __name__ == '__main__':
do() |
p03324 | s499208902 | Accepted | D, N = map(int, input().split())
anslst = [i for i in range(1, 100)]
anslst.append(101)
for i in range(N):
anslst[i] = anslst[i] * 100 ** D
print(anslst[N - 1]) |
p03324 | s231096997 | Accepted | # coding: utf-8
# Your code here!
d,n=map(int,input().split())
if n==100:
print(100**d*(n+1))
else:
print(100**d*n) |
p03324 | s417631692 | Accepted | d, n = map(int, input().split())
if n != 100:
print(100**d*n)
else:
print(100**d*(n+1)) |
p03324 | s410801443 | Accepted | D, N = map(int, input().split())
if N // 100 > 0: N += 1
print(N * 100 ** D) |
p03324 | s534710698 | Accepted | d, n = list(map(int, input().split()))
print(100**d * n) if n != 100 else print(100**d *(n+1))
|
p03324 | s472237657 | Accepted | D, N = map(int, input().split())
N = N if N != 100 else 101
print(N*(100**D))
|
p03324 | s722179041 | Accepted | D, N = map(int, input().split())
e = 100 ** D
p = 1
while N > 0:
if p != 100:
a = e * p
N -= 1
p += 1
print(a)
|
p03324 | s347678734 | Accepted | n,d=map(int,input().split())
print((d+d//100)*100**n)
|
p03324 | s544963098 | Accepted | d, n = map(int, input().split())
li = []
for i in range(n):
if i+1 == 100:
li.append(100**d*(i+2))
else:
li.append(100**d*(i+1))
print(li[-1]) |
p03324 | s081877300 | Accepted | d, n = map(int, input().split())
if d == 0:
if n <= 99:
print(n)
else:
print(101)
elif d == 1:
if n <= 99:
print(n*100)
else:
print(10100)
elif d == 2:
if n <= 99:
print(n*10000)
else:
print(1010000) |
p03324 | s156336053 | Accepted | D, N = map(int, input().split())
if N != 100:
Ans = N*(100**D)
else:
Ans = 101*(100**D)
print(Ans) |
p03324 | s933115293 | Accepted | def main():
D, N = (int(i) for i in input().split())
if N == 100:
N += 1
print(N * 100**D)
if __name__ == '__main__':
main()
|
p03324 | s554948726 | Accepted | 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(1010000)
else:
print(n * 10000) |
p03324 | s810042903 | Accepted | d, n = map(int, input().split())
if n == 100:
n = 101
ans = 100 ** d * n
print(ans) |
p03324 | s915348656 | Accepted | D,N=map(int,input().split())
if N==100 :
print(100**D*101)
else :
print(100**D*N) |
p03324 | s806219664 | Accepted | D, N = map(int, input().split())
if N == 100:
print(101*(100**D))
else:
print(N*(100**D))
|
p03324 | s466865168 | Accepted | d, n = map(int, input().split())
if n != 100:
print(n*100**d)
else:
print(101*100**d) |
p03324 | s342809871 | Accepted | D, N = map(int, input().split())
if N < 100:
print(N * 100 ** D)
else:
print(101 * 100 ** D) |
p03324 | s772128478 | Accepted | d, n = map(int, input().split())
if n == 100:
print((100 ** d) * 101)
else:
print((100 ** d) * n)
|
p03324 | s861239939 | Accepted | d,n = map(int, input().split())
if n == 100:
print(str(n+1) + "00"*d)
else:
print(str(n) + "00"*d)
|
p03324 | s838347446 | Accepted | 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 | s698895096 | Accepted | d,n = map(int,input().split())
if n == 100:
n += 1
print(n * 100 ** d) |
p03324 | s078580282 | Accepted | d, n = map(int, input().split())
start = 100 ** d
counter = 0
while True:
if start % (100 ** d) == 0 and start % (100 ** (d + 1)) != 0:
counter += 1
if counter == n:
print(start)
break
start += 1
|
p03324 | s554011156 | Accepted | d,n=map(int,input().split())
print(n*100**d if n!=100 else 100**(d+1)+100**d) |
p03324 | s459338443 | Accepted | import sys
input = sys.stdin.readline
D,N = [int(i) for i in input().split()]
ans = (100 ** D) * N
if N == 100 :
ans +=100 ** D
print(ans) |
p03324 | s007183431 | Accepted | D, N = map(int, input().split())
if N != 100:
print(N*(100**D))
else:
print((N+1)*(100**D))
|
p03324 | s163651913 | Accepted | d,n = map(int,input().split())
if n == 100:
num = 100 ** d * (n+1)
else:
num = 100 ** d * n
print(num) |
p03324 | s755079211 | Accepted | d, n = map(int, input().split())
for i in range(1, 100000000):
if i % (100 ** d) == 0 and i % (100 * 100 ** d) != 0:
n -= 1
if n == 0:
print(i)
exit()
|
p03324 | s232368335 | Accepted | D,N = input().split()
D = int(D)
N = int(N)
# D 割る回数
# N 小さい順からN番目
i = 0
count = 0
while(True):
i = i + 100**D
if i % 100**D == 0 and i % 100**(D+1) != 0:
count = count + 1
if count >= N:
break
print(i) |
p03324 | s780995658 | Accepted | 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(100*n)
else:
if n==100:
print(1010000)
else:
print(10000*n) |
p03324 | s294848727 | Accepted | l = list(map(int, input().split()))
if l[1] != 100:
print(l[1]*100**l[0])
else:
print(101*100**l[0])
|
p03324 | s401642746 | Accepted | D,N=map(int, input().split())
base=10**(2*D)
if N!=100:
print(N*base)
else:
print((N+1)*base) |
p03324 | s067586737 | Accepted | D,N = map(int,input().split())
D = 100**D
if N == 100:
print(N*D+D)
else:
print(N*D)
|
p03324 | s312856822 | Accepted | import sys
lines = [s.rstrip("\n") for s in sys.stdin.readlines()]
d, n = [int(num) for num in lines.pop(0).split(" ")]
if n == 100:
n += 1
ans = (100 ** d) * n
print(ans)
|
p03324 | s198189524 | Accepted | d, n = map(int, input().split())
if n == 100:
n = 101
print(n*(100**d)) |
p03324 | s483368979 | Accepted | D, N = map(int, input().split())
print(N*100**D) if N!=100 else print((N+1)*100**D) |
p03324 | s280262166 | Accepted | d,n = map(int,input().split())
if n != 100:
print(n*(100**d))
else:
print((n+1)*(100**d)) |
p03324 | s538780542 | Accepted | d, n = map(int, input().split())
if n != 100:
print((100 ** d)*n)
else:
print((100 ** d)*101)
|
p03324 | s983111573 | Accepted | 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(10100)
else:
print(1010000)
|
p03324 | s173693835 | Accepted | d, n = list(map(int, input().split()))
if n < 100:
print(pow(100, d) * n)
else:
print(pow(100, d) * 101) |
p03324 | s878134916 | Accepted | a,b = map(int,input().split())
if b == 100:
b = 101
print(100 ** a * b) |
p03324 | s177817596 | Accepted | a=input();print(int(int(a[2:])*1.01)*100**int(a[0])) |
p03324 | s194854452 | Accepted | D, N = map(int, input().split())
def func(x):
cnt = 0
while x > 0:
if x % 100 == 0:
cnt += 1
x = x // 100
return cnt
i = 0
cnt = 0
while True:
i += 100 ** D
if func(i) == D:
cnt += 1
if cnt == N:
print(i)
break
|
p03324 | s568030797 | Accepted | d,n = map(int,input().split())
if n == 100:
num = 100 ** d * (n+1)
else:
num = 100 ** d * n
print(num) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.