problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03324 | s863226694 | Accepted | d,n = map(int,input().split())
if n<100:
print(100**d*n)
else:
print(100**d*101) |
p03324 | s948617500 | Accepted | d, n = map(int, input().split())
if n == 100:
n += 1
if d == 0:
print(1 * n)
elif d == 1:
print(100 * n)
else:
print(10000 * n) |
p03324 | s778594911 | Accepted | d, n = map(int, input().strip().split())
def judge(num):
count = 0
while True:
if count == d:
return num % 100 != 0
if num % 100 == 0:
count += 1
num //= 100
else:
return False
found = 0
num = 1
while True:
if judge(num):
found += 1
if found == n:
print(num)
break
num += 1
|
p03324 | s718343567 | Accepted | d, n = map(int, input().split())
if n != 100:
print((100**d)*n)
else:
print((100**d)*(n+1)) |
p03324 | s214925263 | Accepted | d,n=map(int,input().split())
num=100**d
mnum=n*num
if n==100:
mnum+=num
print(mnum)
|
p03324 | s959600921 | Accepted | import numpy as np
D, N = [int(i) for i in input().split()]
if N != 100:
ans = (N)*10**(2*D)
else:
ans = (N+1)*10**(2*D)
print(ans) |
p03324 | s800141077 | Accepted | d,n = map(int,input().split())
print(n*100**d if n != 100 else 101*100**d) |
p03324 | s328354769 | Accepted | d,n=map(int,input().split())
moto=100**d
if (n==100 and d==0):
print(101)
elif (d==1 and n==100):
print(10100)
elif (d==2 and n==100):
print(1010000)
else:
print(moto*n) |
p03324 | s830112051 | Accepted | d,x=map(int,input().split())
print((x+(x==100))*100**d) |
p03324 | s074248662 | Accepted | d,n = map(int, input().split())
if n == 100:
print(101 * (100**d))
else:
print(n * (100**d)) |
p03324 | s463315204 | Accepted | D, N = [int(i) for i in input().split()]
print((100**D) * (N + (N // 100))) |
p03324 | s012458775 | Accepted | D, N = map(int,input().split())
ans = N * 100 ** D if N != 100 else 101 * 100 ** D
print(ans) |
p03324 | s200749280 | Accepted | d, n = map(int, input().split())
if n < 100:
print(100 ** d * n)
else:
print(100 ** d * 101) |
p03324 | s402456631 | Accepted | D, N = map(int, input().split())
if N==100:
print(100**D*(N+1))
else:
print(100**D*N) |
p03324 | s082662590 | Accepted | # coding: utf-8
# Your code here!
d,n=map(int,input().split())
if n!=100:
print(100**d*n)
else:
print(100**d*(n+1)) |
p03324 | s487618860 | Accepted | D, N = map(int, input().split())
print(100**D*(N+N//100)) |
p03324 | s970575977 | Accepted | a=input();print(int(int(a[2:])*1.01)*100**int(a[0])) |
p03324 | s572991126 | Accepted | D, N = map(int, input().split())
ans = 100 ** D
if N // 100 > 0: N += 1
print(ans * N) |
p03324 | s300997179 | Accepted | d,n = map(int,input().split())
ans = n*100**d
if n == 100:
ans = 101*100**d
print(ans) |
p03324 | s376495810 | Accepted | d, n = map(int, input().split())
if n < 100:
print(n * 100 ** d)
else:
print(101 * 100 ** d) |
p03324 | s543058302 | Accepted | d, n = map(int, input().split())
if n == 100:
n += 1
print(n * 100**d)
|
p03324 | s438557795 | Accepted | def main():
D, N = map(int, input().split())
if D == 0:
if N != 100:
print(N)
else:
print(101)
elif D == 1:
if N != 100:
print(100*N)
else:
print(10100)
elif D == 2:
if N != 100:
print(10000*N)
else:
print(1010000)
main() |
p03324 | s086005580 | Accepted | d,n=map(int,input().split())
a=[]
for i in range(1,102):
if i==100:continue
t=100**d
a.append(i*t)
print(a[n-1])
|
p03324 | s769698820 | Accepted | d, n = map(int, input().split())
if d == 0:
if n != 100:
print(n)
else:
print(101)
elif d == 1:
if n != 100:
print(n * 100)
else:
print(10100)
else:
if n != 100:
print(n * 10000)
else:
print(1010000) |
p03324 | s192159433 | Accepted | d,n = map(int,input().split())
if n!=100:
print(n*(100**d))
else:
print(101*(100**d)) |
p03324 | s249454841 | 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(101*100)
else:
print(N*100)
elif D==2:
if N==100:
print(101*100*100)
else:
print(N*100*100) |
p03324 | s681268474 | Accepted | d, n = map(int, input().split())
print((100 ** d) * (n if n < 100 else n + 1))
|
p03324 | s887470034 | Accepted | n, k = map(int, input().split())
if k == 100:
print(101*(100**n))
else:
print((100**n)*k)
|
p03324 | s598712424 | Accepted | d,n=[int(i) for i in input().split()]
a=[101,10100,1010000]
if n!=100:
if d==0:
print(n)
elif d==1:
print(n*100)
else:
print(n*10000)
else:
print(a[d]) |
p03324 | s489320895 | Accepted | D , N = map(int, input().split())
if N == 100:
N += 1
print(N*100**D) |
p03324 | s515546476 | Accepted | D,N=map(int,input().split())
ans=0
if N!=100:
ans=N*100**D
else:
ans=101*100**D
print(ans) |
p03324 | s656744024 | Accepted | d,n = map(int, input().split())
if n != 100:
print(100**d * n)
else:
print(100**d * (101))
|
p03324 | s004786493 | Accepted | d,n = map(int,input().split())
A = [i*100**d for i in range(1,n+1)]
if n != 100:
print(A[-1])
else:
print(101*100**d) |
p03324 | s401401103 | Accepted | d,n = map(int,input().split())
li = []
for i in range(1,102):
if i != 100:
li.append(i*100**d)
print(li[n-1]) |
p03324 | s144939925 | Accepted | d,n = map(int,input().split())
if n==100:
print(100**d*(n+1))
else:
print(100**d*n) |
p03324 | s546444146 | Accepted | d,n = map(int, input().split())
print(100**d+(100**d)*n if n==100 else (100**d)*n) |
p03324 | s190568536 | Accepted | d,n = map(int, input().split())
print(100**d*n if n!=100 else 100**d*(n+1)) |
p03324 | s213568746 | Accepted | d,n = map(int,input().split())
res = n * 100 ** d
if n == 100:
res += 100 ** d
print(res) |
p03324 | s039174975 | Accepted | d,n=map(int,input().split())
if n!=100:
print(n*(100)**d)
else:
print((n+1)*(100)**d)
|
p03324 | s285920289 | Accepted |
def main():
D, N = map(int, input().split())
if D == 0:
if N <= 99:
print(N)
else:
print(N+1)
elif D == 1:
if N <= 99:
print(100*N)
else:
print(101*N)
else:
if N <= 99:
print(10000*N)
else:
print(10100*N)
if __name__ == "__main__":
main()
|
p03324 | s952363502 | Accepted | d,n=map(int,input().split())
print(100**d*(n+1) if n==100 else 100**d*n) |
p03324 | s660162241 | Accepted | D,N = map(int, input().split())
cnt = 0
for n in range(1, 10 ** 7):
can, tmp = 0, n
while tmp % 100 == 0:
tmp //= 100
can += 1
if can == D:
cnt += 1
if cnt == N:
print(n)
exit() |
p03324 | s475284239 | Accepted | d,n = map(int, input().split())
if n == 100:
print(100**d * n + (100**d))
else:
print(100**d * n) |
p03324 | s025207967 | Accepted | def main():
D, N = map(int, input().split())
if N == 100:
print(pow(100, D) * (N + 1))
else:
print(pow(100, D) * N)
if __name__ == '__main__':
main()
|
p03324 | s195504848 | Accepted | d, n = map(int, input().split())
ans = (100 ** d) * (n if n != 100 else n + 1)
print(ans)
|
p03324 | s143837576 | Accepted | D,N = map(int,input().split())
if N==100:
N += 1
print(N * 100**D) |
p03324 | s167432819 | Accepted | import sys
stdin = sys.stdin
mod = 1000000007
inf = 1 << 60
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()
nas = lambda: stdin.readline().split()
d, n = na()
def f(x):
res = 0
while x % 100 == 0:
x //= 100
res += 1
return res
cnt = 0
m = 0
while cnt < n:
m += 1
if f(m) == d:
cnt += 1
print(m) |
p03324 | s847895901 | Accepted | d,n=map(int,input().split())
if n==100:
n+=1
print((100**d)*n) |
p03324 | s215198862 | Accepted | d,n = map(int,input().split())
print((n+1)*(100**d)) if n == 100 else print(n*(100**d)) |
p03324 | s265052516 | Accepted | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
d,n = map(int,input().split())
if n != 100:
print(n*100**d)
else:
print(101*100**d) |
p03324 | s842539837 | Accepted | D, N = map(int, input().split())
if N == 100:
print((N+1)*(100**D))
else:
print(N*(100**D))
|
p03324 | s521499347 | Accepted | # 1:46
d, n = map(int, input().split())
if n != 100:
print(100**d * n)
else:
print(100**d * (n + 1))
|
p03324 | s647120870 | Accepted | D, N = map(int, input().split())
base = 100 ** D
cnt = 0
i = 1
while True:
if i % 100 != 0:
cnt += 1
#
if cnt == N: break
i += 1
ans = i * base
print(ans) |
p03324 | s609454055 | Accepted | N,C = map(int,input().split(' '))
if C == 100:
print(100 ** N * 101)
else:
print(100 ** N * C)
|
p03324 | s664716223 | Accepted | d, n = [int(x) for x in input().split()]
print(100 ** d * n if n < 100 else 100 ** d * 101) |
p03324 | s924383423 | Accepted | d, n = map(int, input().split())
if n % 100 == 0:
print(101 * 100 ** d)
else:
print(n * 100 ** d)
|
p03324 | s523382736 | Accepted | d,n=map(int,input().split())
if n!=100:
print(n*100**d)
else:
print(101*100**d)
|
p03324 | s089975407 | Accepted | # solution
import io
nim,mike=map(int,input().split())
if mike!=100:
print(mike*(100**nim))
else:
print(101*(100**nim)) |
p03324 | s815139423 | Accepted | D,N=map(int,input().split())
ans=N*(100**D)
if N==100:
ans*=1.01
print(int(ans)) |
p03324 | s795878038 | Accepted | def solve():
D, N = map(int, input().split())
if N == 100:
print(100 ** D * 101)
else:
print(100 ** D * N)
if __name__ == "__main__":
solve() |
p03324 | s885121984 | Accepted | D,N=map(int,input().split())
if N<100:
print(100**D*N)
exit()
print(100**D*101) |
p03324 | s465867746 | Accepted | d, n = map(int, input().split())
if n < 100:
print(n * (100 ** d))
else:
print(101 * (100 ** d))
|
p03324 | s767648569 | Accepted | D, N = map(int, input().split())
count = 1
num = 100 ** D
while count != N:
num += 100 ** D
if num % (100 ** (D + 1)) == 0:
continue
else:
count += 1
print(num) |
p03324 | s871897849 | Accepted | D_kai, N_ban = map(int, input().split())
begin = 100 ** D_kai
if (N_ban == 100):
ans = begin * 101
else:
ans = begin * N_ban
print(ans) |
p03324 | s254322015 | Accepted | D,N = map(int,input().split())
if N==100:
N += 1
print(N* 100**D) |
p03324 | s403264639 | Accepted | D, N = map(int, input().split())
if N == 100:
print(100**D*101)
else:
print(100**D*N) |
p03324 | s395837636 | Accepted | #!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
d,n = map(int,input().split())
if n != 100: print((100**d)*n)
else: print((100**d)*(1+n)) |
p03324 | s517577990 | 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 | s928828661 | Accepted | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
d,n = inpl()
res = n*100**(d)
if n == 100:
res += 100**(d)
print(res) |
p03324 | s303660410 | Accepted | d, n = map(int, input().split())
print(100 ** d * n if n != 100 else 100 ** d * 101)
|
p03324 | s403131669 | Accepted | d, n = map(int, input().split())
if n % 100 != 0:
print((100 ** d) * n)
if n % 100 == 0:
print((100 ** d) * (n+1)) |
p03324 | s601315123 | Accepted | import sys
s = input().split(' ')
d, n = int(s[0]), int(s[1])
if (n % 100 != 0):
print (n * (100 ** d))
else :
print ((n + 1) * (100 ** d)) |
p03324 | s466112232 | Accepted | d, n = map(int, input().split())
if n < 100: print(100 ** d * n)
else: print(100**d*n + 100**d) |
p03324 | s650443981 | Accepted | d,n=map(int,input().split())
if(n<100):
print(n*(100**d))
else:
print(n*(100**d)+(100**d)) |
p03324 | s872804000 | Accepted | d,n = map(int,input().split())
if d == 0:
if n!= 100:
print(n)
else:
print(101)
elif d == 1:
if n != 100:
print(100*n)
else:
print(101*100)
else:
if n != 100:
print(10000*n)
else:
print(101*10000) |
p03324 | s443468059 | Accepted | d,n = map(int, input().split())
n += n // 100
print(str(n) + "00"*d)
|
p03324 | s540678948 | Accepted | import sys
input = sys.stdin.readline
D, N = map(int, input().rstrip().split())
if N != 100:
print(100 ** D * N)
else:
print(100 ** D * (N+1))
|
p03324 | s551555506 | Accepted | d ,n= map(int,input().split())
D = 100**d
if n == 100:
print(101*D)
else:
print(n*D) |
p03324 | s691901139 | Accepted | d,n = map(int, raw_input().split())
print (n + (1 if n == 100 else 0)) * (100 ** d)
|
p03324 | s004151856 | Accepted | d, n=map(int, input().split())
if n==100:
print((100**d)*101)
else:
print((100**d)*n) |
p03324 | s815463225 | Accepted | D,N=map(int,input().split())
if N==100:
print(101*(100**D))
else:
print(N*(100**D))
|
p03324 | s105560425 | Accepted | a,b,c = 1,100,10000
d,n = map(int, input().split())
if (n == 100):
n += 1
print(n*(100**d))
|
p03324 | s383384037 | Accepted | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
D, N = map(int, input().split())
print((100**D) * (N + (N // 100)))
if __name__ == "__main__":
main()
|
p03324 | s847006442 | Accepted | d, n = map(int, input().split())
if n == 100:
n += 1
res = 100 ** d * n
print(res)
|
p03324 | s982195161 | Accepted | import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
d, n = list(map(int, sys.stdin.buffer.readline().split()))
if n == 100:
n += 1
ans = 100 ** d * n
print(ans)
|
p03324 | s236003654 | Accepted | d,n = map(int,input().split())
ans = n
if d != 0:
ans *= 100**d
if n == 100:
ans += 100**d
print(ans) |
p03324 | s027914901 | Accepted | #ABC100
d,n = map(int,input().split())
print(n * (100 ** d)) if n != 100 else print(101 * (100 ** d)) |
p03324 | s833984326 | Accepted | n,k=map(int,input().split())
if k==100:
k+=1
print(pow(100,n)*k)
|
p03324 | s841167477 | Accepted | D,N = map(int, input().split())
if N==100:
N=101
if D==0:
print(N*1)
exit()
if D==1:
print(N*100)
exit()
if D==2:
print(N*10000)
exit()
|
p03324 | s759784426 | Accepted | d, n = map(int, input().split())
if n == 100:
print(100**d*101)
else:
print(100**d*n) |
p03324 | s401737383 | Accepted | class Solution:
def solve(self, D: int, N: int) -> int:
if N == 100:
return (N+1) * (100**D)
else:
return N * (100**D)
if __name__ == '__main__':
# standard input
D, N = map(int, input().split())
# solve
solution = Solution()
print(solution.solve(D, N))
|
p03324 | s029696164 | Accepted | d, n = map(int, input().split())
ans = 100 ** d * n
if n == 100:
ans += 100 ** d
print(ans) |
p03324 | s329420890 | Accepted | d, n = [int(x) for x in input().split()]
print(100 ** d * (n + [0, 1][n == 100])) |
p03324 | s429336064 | Accepted | D,N = map(int,input().split())
if D==0:
if N == 100:
print(101)
else:
print(N)
if D==1:
if N == 100:
print(10100)
else:
print(N*100)
if D == 2:
if N == 100:
print(1010000)
else:
print(N*10000)
|
p03324 | s348353812 | Accepted | D,N=map(int,input().split())
if N!=100:
print(100**D*N)
else:
print(100**D*(N+1)) |
p03324 | s460817474 | Accepted | D, N = map(int, input().split())
if D == 0:
if N < 100:
print(N)
else:
print(101)
elif D == 1:
if N < 100:
print(100 * N)
else:
print(10100)
else:
if N < 100:
print(10000 * N)
else:
print(1010000) |
p03324 | s008142400 | Accepted | d,n=map(int,input().split())
if n==100:
n=101
if d==0:
print(n)
else:
print(n*100**d) |
p03324 | s734126636 | Accepted | l = list(map(int, input().split()))
D = l[0]
N = l[1]
if N != 100:
answer = (100**D)*N
else:
answer = (100**D)*(N+1)
print(answer)
|
p03324 | s348326645 | Accepted | D, N = map(int, input().split())
print(100 ** D * (N + N // 100))
|
p03324 | s723633532 | Accepted | # numが100で何回割れるか
def getDevide100Count(num: int):
n = 0
while num % 100 == 0:
num = num / 100
n += 1
return n
d, n = map(int, input().split())
count = 0
i = 0
while count != n:
i += 1
if getDevide100Count(i) == d:
count += 1
print(i) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.