problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03324 | s743620110 | Accepted | D, N = map(int, input().split())
ans = N * 100 ** D
if N == 100:
ans += 100 ** D
print(ans) |
p03324 | s578562070 | Accepted | d,n=map(int,input().split())
print(n*100**d if n!=100 else 101*100**d) |
p03324 | s611177294 | Accepted | from itertools import count
def count_div_by_100(n: int) -> int:
for idx in range(4):
q, r = divmod(n, 100)
if r != 0:
return idx
n //= 100
return -1
D, N = map(int, input().split())
current = 0
current_idx = 0
for n in count(start=1):
if count_div_by_100(n) == D:
... |
p03324 | s638822228 | Accepted | d, n = map(int, input().split())
div = 100 ** d
if n < 100:
print(div * n)
exit(0)
else:
print(div * 101)
exit(0) |
p03324 | s582086069 | Accepted | D,N=map(int,input().split())
if N==100:
N+=1
print(N*(100**D)) |
p03324 | s645185334 | Accepted | D,N = map(int,input().split())
if N!=100:
ans = N*100**D
else:
ans = 101*100**D
print(ans)
|
p03324 | s891720907 | 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 | s306915222 | Accepted | from itertools import permutations
def mi():
return map(int, input().split())
def ii():
return int(input())
def main():
D, N = mi()
if N == 100:
print(100**D*101)
else:
print(100**D*N)
if __name__ == '__main__':
main() |
p03324 | s852483781 | Accepted | d, n = map(int, input().split())
if n == 100:
print(100 ** d * 101)
else:
print(100 ** d * n) |
p03324 | s135758952 | Accepted | D,N=map(int,input().split());print(100**D*[N,101][N>99]) |
p03324 | s890845148 | Accepted | d,n = map(int,input().split())
if n == 100:
print(101*(100**d))
else:
print(n*(100**d)) |
p03324 | s099497299 | Accepted | D, N = map(int, input().split())
if N == 100:
if D == 0:
print(101)
elif D == 1:
print(10100)
else:
print(1010000)
elif D == 0:
print(N)
elif D == 1:
print(100 * N)
else:
print(10000 * N) |
p03324 | s527943616 | Accepted | 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=n*100
else:
if n==100:
ans=1010000
else:
ans=n*10000
print(ans) |
p03324 | s249117255 | Accepted | def resolve():
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")
... |
p03324 | s525592765 | Accepted | A = []
B = []
C = []
for i in range(1,101):
t0 = i
t1 = i*100
t2 = i*100*100
A.append(t0)
B.append(t1)
C.append(t2)
d,n = map(int,input().split())
if d == 0:
if n == 100:
print(101)
else:
print(A[n-1])
elif d == 1:
if n == 100:
print(100*101)
else:
... |
p03324 | s917047774 | Accepted | D,N = list(map(int, input().split()))
if N == 100: N += 1
print(N*(100**D))
|
p03324 | s965985278 | Accepted | A,N=map(int, input().split())
if N<100:
print(N*100**A)
else:
print(101*100**A) |
p03324 | s803000309 | Accepted | d, n = map(int, input().split())
if n == 100:
print(100**d*101)
else:
print(100**d*n) |
p03324 | s385968846 | Accepted | D, N = map(int, input().split())
if N < 100:
ans = N * 100 ** D
else:
ans = N * 100 ** D + 100**D
print(ans)
|
p03324 | s060523531 | Accepted | D,N = map(int,(input().split()))
l = [[] for _ in range(3)]
for i in range(1,1010001):
c = 0
j = i
while j%100 == 0:
c += 1
j //= 100
if c < 3:
l[c].append(i)
print(l[D][N-1]) |
p03324 | s730647025 | Accepted | d,n = map(int,input().split())
if n == 100:
print(101 * 100**d)
else:
print(n * 100**d) |
p03324 | s545143163 | Accepted | D,N = [int(i) for i in input().split()]
print(N*100**D if N != 100 else (N+1)*100**D) |
p03324 | s068094718 | Accepted | D,N=map(int,input().split())
if N!=100:
print(N*(100**D))
else:
print((N+1)*(100**D)) |
p03324 | s706794003 | Accepted | d, n = [int(x) for x in input().split()]
x = 100 ** d
if n == 100:
n = 101
ans = n * x
print(ans) |
p03324 | s140439393 | Accepted | d,n = map(int,input().split())
ans = n * 100**d
if n == 100:
ans += 100**d
print(ans) |
p03324 | s847114137 | Accepted | D,N=map(int,input().split())
print(((100**D)*N) if N<100 else ((N+1)*(100**D))) |
p03324 | s647965998 | Accepted | def read_ints():
return[int(i) for i in input().split()]
def main():
d, n = read_ints()
print(101 * (100**d) if n == 100 else (100**d)*n)
if __name__ == '__main__':
main() |
p03324 | s953540500 | Accepted | d, n = map(int,input().split())
if n== 100:
n+=1
print(n*(100**d)) |
p03324 | s709853637 | 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)
elif d == 2:
if n < 100:
print(n*10000)
else:
print(n*10000+10000) |
p03324 | s215596835 | Accepted | def main():
d,n = map(int, input().split())
if n == 100:
print((100**d) * (n+1))
else:
print((100**d) * n)
if __name__ == '__main__':
main() |
p03324 | s392357651 | Accepted | D, N = map(int, input().split())
if D > 0:
if N < 100:
print( N * 100**D )
else:
print( 101 * 100**D )
if D == 0:
if N < 100:
print(N)
else:
print(101)
|
p03324 | s436377859 | Accepted | D,N = map(int,input().split())
if N == 100:
N += 1
print(N*(100**D)) |
p03324 | s129783512 | Accepted | d, n = map(int, input().split())
if n == 100:
print(max(100 ** d, 1) * n + 100**d)
else:
print(max(100 ** d, 1) * n) |
p03324 | s492018715 | Accepted | d, n = map(int, input().split())
if d == 0:
if n != 100:
print(n)
else:
print(n + 1)
elif d == 1:
if n != 100:
print(n * 100)
else:
print(n * 100 + 100)
else:
if n != 100:
print(n * 10000)
else:
print(n * 10000 + 10000)
|
p03324 | s986148292 | Accepted | d,n=map(int,input().split())
x=n*(100**d)
print(x if n%100!=0 else x+(100**d)) |
p03324 | s273948659 | Accepted | # -*- coding: utf-8 -*-
d, n = map(int,input().split())
if d == 0:
if n <= 99:
print(n)
else:
print(101)
if d == 1:
if n <= 99:
print(n * 100)
else:
print(10100)
if d == 2:
if n <= 99:
print(n * 10000)
else:
print(1010000)
|
p03324 | s333853476 | Accepted | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_upper... |
p03324 | s326671600 | Accepted | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
d, n = map(int, input().split())
if n != 100:
print((100 ** d) * n)
else:
print((100 ** d) * (n + 1))
|
p03324 | s738117968 | Accepted | [D,N] = list(map(int,input().split()))
if N!=100:
print(100**D*N)
else:
print(100**D*(N+1)) |
p03324 | s339619859 | Accepted | def main():
d, n = map(int, input().split())
answer = 100 ** d
if 0 < d:
while 0 < n:
if answer % (100 ** d) == 0 and answer % (100 ** (d + 1)) > 0:
n -= 1
answer += 100 ** d
answer -= 100 ** d
else:
answer = n if n < 100 else 101
print... |
p03324 | s610861444 | Accepted | d, n = map(int, input().split())
ans = (100**d)*n
if n == 100:
ans += 100**d
print(ans)
|
p03324 | s040000875 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
d,n=map(int, input().split())
if n!=100:
print(100**d*n)
elif n==100:
print(100**d*101)
resolve()
|
p03324 | s022297104 | Accepted | D, N = map(int, input().split())
if N != 100:
if D == 0:
print(N)
elif D == 1:
x = [100 * i for i in range(1, 101)]
print(x[N-1])
elif D == 2:
x = [10000 * i for i in range(1, 101)]
print(x[N-1])
else:
if D == 0:
print(101)
elif D == 1:
x = [100 * i for i in range(1, 101)]
prin... |
p03324 | s794078932 | Accepted | d, n = map(int, input().split())
if n == 100:
ans = (100**d)*(n+1)
else:
ans = (100**d)*n
print(ans) |
p03324 | s017924665 | Accepted | d,n = map(int,input().split())
if n == 100:
n += 1
print(100 ** d * n) |
p03324 | s965577264 | Accepted | D, N = map(int, input().split())
D = 100 ** D
if N<= 99:
print(D*N)
else:
print(D*101) |
p03324 | s653311473 | Accepted | d,n = map(int,input().split())
if n == 100:
print(100**d*(101))
else:
print(100**d*n) |
p03324 | s153351902 | 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)
elif d == 2:
if n != 100:
print(n*10000)
else:
print(1010000) |
p03324 | s525665123 | Accepted | d,n=map(int,input().split())
print(10**(2*d)*(n+n//100)) |
p03324 | s159436118 | Accepted | d, n = map(int, input().split())
cnt = 0
i = 0
while cnt < n:
i += 1
if i % 100**d == 0 and i % 100**(d+1) != 0:
cnt += 1
print(i)
|
p03324 | s418316069 | Accepted | D, N = map(int, input().split())
def calc(n):
count = 0
while n % 100 == 0:
count += 1
n /= 100
return count
count = 0
val = 0
while count < N:
val += 1
if calc(val) == D:
count += 1
print(val) |
p03324 | s732185839 | Accepted | d,n=map(int,input().split())
if n<100:
print(n*100**d)
else:
print(101*100**d) |
p03324 | s238260990 | Accepted | 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) + 100 ** D)
if __name__ == '__main__':
main() |
p03324 | s097849724 | Accepted | D,N=map(int,input().split())
A=100**D
ans=N*A
if N==100:
ans=101*A
print(ans) |
p03324 | s612011099 | Accepted | d, n = map(int, input().split())
if n < 100:
ans = n * 100**d
print(ans)
else:
ans = 101 * 100**d
print(ans) |
p03324 | s729142327 | Accepted | D, N = map(int,input().split())
if D == 0 and N != 100:
print(N)
if D == 0 and N == 100:
print(101)
if D == 1 and N != 100:
print(N*100)
if D == 1 and N == 100:
print(10100)
if D == 2 and N != 100:
print(N*10000)
if D == 2 and N == 100:
print(1010000)
|
p03324 | s783019036 | Accepted | A,B=map(int,input().split())
if B==100:
print((100**A)*101)
exit()
print((100**A)*B) |
p03324 | s952959586 | Accepted | d, n = map(int, input().split())
x = 100 ** d
y = x
cnt = 0
while cnt < n:
if y % 100**(d+1) != 0:
cnt += 1
y += x
print(y-x) |
p03324 | s540442895 | Accepted | D,N=map(int, input().split())
m=0
for i in range(1, 10**10):
c=0
n=i
while i%100==0:
i//=100
c+=1
if c==D:
m+=1
if m==N:
print(n)
exit() |
p03324 | s655294083 | Accepted | D, N = map(int, input().split())
if N != 100:
print(100**D * N)
else:
print(100**D * (N+1))
|
p03324 | s947162870 | Accepted | d,n=map(int,input().split())
if n==100:
if d==0:
print("101")
elif d==1:
print("10100")
else:
print("1010000")
else:
print(100**d*n)
|
p03324 | s550648377 | Accepted | # -*- coding: utf-8 -*-
# 標準入力を取得
D, N = list(map(int, input().split()))
# 求解処理
ans = (N + (N // 100)) * 100**D
# 結果出力
print(ans)
|
p03324 | s644376339 | Accepted | x, y = map(int, input().split())
if x == 0:
if y == 100:
print(101)
else:
print(y)
elif x == 1:
if y == 100:
print(10100)
else:
print(y*100)
else:
if y == 100:
print(1010000)
else:
print(y*10000)
|
p03324 | s611682653 | Accepted | d,n=map(int,input().split())
if n==100:n+=1
print(100**d*n) |
p03324 | s981443418 | Accepted | D,N = map(int,input().split())
if N == 100:
#need to skip 100 since 100 can be divided by 100 therefore D becomes D+1
N = 101
print(100**D*N)
|
p03324 | s382284229 | Accepted | n=list(map(int, input().split()))
if n[1]==100:
print((n[1]+1)*(100**n[0]))
else:
print(n[1]*(100**n[0])) |
p03324 | s802515821 | Accepted | D, N = map(int, input().split())
print(N*(100**D) if N != 100 else (N + 1)*(100**D))
|
p03324 | s357418495 | Accepted | D,N=map(int,input().split())
print(100**D * N if N !=100 else 100**D*101) |
p03324 | s053587585 | Accepted | A,B=map(int,input().split())
if B==100:
C=100**A*(B+1)
else:
C=100**A*B
print(C) |
p03324 | s682889842 | Accepted | d, n = map(int, input().split())
if n < 100:
print(n * 100**d)
else:
print(101 * 100**d) |
p03324 | s952698152 | Accepted | d,n = map(int,input().split())
ans = 0
if n != 100:
ans = 100**d * n
else:
ans = 100**d * 101
print(ans) |
p03324 | s314638265 | Accepted | D, N = map(int, input().split())
if N == 100:
print(101 * 100**D)
else:
print(N * 100**D)
|
p03324 | s992186092 | Accepted | D, N = map(int, input().split())
print((100 ** D) * 101 if N == 100 else (100 ** D) * N)
|
p03324 | s871798580 | Accepted | d,n = map(int,input().split())
if n != 100:
print(100**d * n)
else:
print(100**d * n + 100**d)
|
p03324 | s431394725 | Accepted | D,N=map(int,input().split())
print(100**D*N if N!=100 else 100**D*101) |
p03324 | s558551085 | Accepted | a,b= map(int,input().split())
if b !=100:
print((100 ** a)*b)
else:
print((100 ** a)*(b+1))
|
p03324 | s571295545 | Accepted | d, n = map(int,input().split())
print( (n+1)*100**d if n%100==0 else n*100**d)
|
p03324 | s482943834 | Accepted | d,n = map(int,input().split())
case = 100**d
if n < 100:
print(case*n)
else:
print(101*case) |
p03324 | s578469869 | Accepted | # -*- coding: utf-8 -*-
d, n = map(int,input().split())
if d == 0:
if n < 100:
print(n)
if n == 100:
print(101)
if d == 1:
if n < 100:
print(n * 100)
if n == 100:
print(10100)
if d == 2:
if n < 100:
print(n * 10000)
if n == 100:
print(1010000)
|
p03324 | s255053314 | Accepted | a, b = list(map(int, input().split()))
if b != 100:
ans = 100 ** a * b
else:
ans = 100 ** a * (b+1)
print(ans) |
p03324 | s826192402 | Accepted | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math ... |
p03324 | s664613077 | Accepted | D,N = map(int,input().split())
if N != 100:
print(N*pow(100,D))
else:
print(101*pow(100,D)) |
p03324 | s077407558 | Accepted | d,n = map(int,input().split())
if n != 100:
print(100**d*n)
else:
print(100**d*101) |
p03324 | s158431785 | Accepted | def main():
D, N = map(int, input().split())
h = 100
if N == 100:
print((100**D)*101)
else:
print((100 ** D)*N)
main() |
p03324 | s082221379 | Accepted | d, n = map(int, input().split())
print(n * (100 ** d) if n < 100 else (n + 1) * (100 ** d) ) |
p03324 | s718807503 | Accepted | D, N = map(int, input().split())
if N == 100:
ans = 100 ** D * (N+1)
else:
ans = 100 ** D * N
print(ans) |
p03324 | s349244895 | Accepted | d, n = map(int, input().split())
if n == 100:
n += 1
print((100**d)*n) |
p03324 | s660104185 | Accepted | D,N=map(int, input().split())
d = 1
for i in range(D):
d *= 100
if N==100:
N += 1
print(d*N)
|
p03324 | s076534692 | Accepted | D, N = map(int, input().split())
if N != 100:
print(100**D*N)
else:
print(100 ** D * 101)
|
p03324 | s587421994 | Accepted | a,b = map(int,input().split())
num = 100**a
ans = num*b
if b!= 100:
print(ans)
else:
print(ans+num)
|
p03324 | s367761285 | Accepted | D, N = map(int, input().split())
if N == 100:
N += 1
print(100**D * N) |
p03324 | s329379067 | Accepted | d,n=map(int,input().split())
ans=n*100**d
if n!=100:
print(ans)
else:
print(ans+1*100**d) |
p03324 | s527669626 | Accepted | D, N=map(int, input().split())
a=0
if N==100:
a=100**D
print((100**D)*N+a) |
p03324 | s676853189 | Accepted | d,n = map(int,input().split())
a = 100**d
if n != 100:
print(a*n)
else:
print(a*(n+1)) |
p03324 | s725691389 | Accepted | d,n=map(int,input().split())
minus=n//100
print((n+minus)*(100**d)) |
p03324 | s880440580 | Accepted | import sys
def resolve():
D, N = list(map(int, input().split(" ")))
if D == 0:
if N == 100:
print(101)
else:
print(N)
if D == 1:
if N == 100:
print(100*101)
else:
print(100*N)
if D == 2:
if N == 100:
pri... |
p03324 | s906846626 | Accepted | d,n = map(int, input().split())
print(100**d * (n+(n==100)) if d > 0 else (n + (n==100)))
|
p03324 | s839674957 | Accepted | n,m=map(int,input().split())
if(m<100):
print(100**n*m)
else:
print(100**n*101) |
p03324 | s535240088 | Accepted | d, n = map(int, input().split())
if n == 100:
print(101*100**d)
else:
print(100**d*n)
|
p03324 | s253881590 | Accepted | D, N = map(int, input().split())
count = 0
for i in range(1, 10 ** 7):
tmp = i
flag = True
div_count = 0
for j in range(3):
if tmp%100 == 0:
tmp = tmp // 100
div_count += 1
if div_count == D:
count += 1
if count == N:
print(i)
break |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.