problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03324 | s015282488 | 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 | s824306641 | Accepted | D, N = map(int, input().split())
if N == 100:
N = 101
if D == 0:
print(N)
elif D == 1:
print(N*100)
else:
print(N*10000) |
p03324 | s884579445 | Accepted | D,N=map(int, input().split())
print((N+int(N/100))*100**D) |
p03324 | s833314810 | Accepted | def main():
D, N = map(int, input().split(" "))
answer = 100 ** D * N
i = 1
flag = True
while flag:
if not answer % 100 ** (D + i):
answer += 100 ** D
else:
flag = False
print(answer)
if __name__ == '__main__':
main() |
p03324 | s245167433 | Accepted | D, N = map(int, input().split())
d = 100 ** D
if N == 100:
N = 101
print(d * N)
|
p03324 | s971853659 | Accepted | d, n = map(int, input().split())
if(d == 0):
print(n if n < 100 else n+1)
else:
print(100**d * n if n < 100 else 100**d * (n+1)) |
p03324 | s389155608 | Accepted | d,n=map(int,input().split())
if(n!=100):
print(100**d*n)
if(n==100):
print(100**d*(n+1))
|
p03324 | s782080883 | Accepted | d, n = map(int, input().split())
print(100 ** d * (n + n // 100)) |
p03324 | s260214482 | Accepted | D, N = map(int,input().split())
cnt = 0
for i in range(1, 1500000):
if i%(100**D) == 0 and i%(100**(D+1)) != 0:
cnt += 1
if cnt == N:
print(i)
break |
p03324 | s393061354 | Accepted | a, b = map(int, raw_input().split())
ans = 1
for i in range(a):
ans = ans * 100
if b == 100:
print ans * 101
else:
print ans * b |
p03324 | s015381392 | Accepted | import math
def main():
d,n = list(map(int,input().split()))
if n==100:
n+=1
print(pow(100,d)*n)
main()
|
p03324 | s007361305 | Accepted | d, n = map(int, input().split())
arr = []
i = 1
while len(arr) != n:
if 100 ** d * i % 100 ** (d + 1) != 0:
arr.append(100 ** d * i)
i += 1
print(arr[-1]) |
p03324 | s705157667 | Accepted | d,n = map(int, input().split())
if n == 100: print(100**d*101)
else: print(100**d*n) |
p03324 | s095437730 | Accepted | D,N=list(map(int,input().split()))
if D==0:
if N==100:
print(101)
exit()
print(N)
elif D==1:
if N==100:
print(100*101)
exit()
print(100*N)
else:
if N==100:
print(100*100*101)
exit()
print(100*100*N) |
p03324 | s026344426 | Accepted | D,N = map(int,input().split())
A = [int(i) for i in range(1,100)] + [101]
B = [int(i*100) for i in range(1,100)] + [10100]
C = [int(i*10000) for i in range(1,100)] + [1010000]
if D == 0:
print(A[N-1])
elif D == 1:
print(B[N-1])
else:
print(C[N-1]) |
p03324 | s896676320 | 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(n*100)
else:
if n == 100:
print(1010000)
else:
print(n*10000)
resolve() |
p03324 | s445865823 | Accepted | d, n = map(int, input().split())
print(100**d * (n + n//100))
|
p03324 | s794467379 | Accepted | D, N = map(int, input().split())
if(N == 100):
N = 101
print(100**D*N) |
p03324 | s369980088 | Accepted | D,N = map(int,input().split())
print(N*100**D if N<100 else 101*100**D)
|
p03324 | s442771950 | Accepted | D,N = map(int, input().split())
ans = (N+N//100)*100**D
print(ans) |
p03324 | s730922109 | Accepted | d,n=map(int,input().split())
print(pow(100,d)*n if n<100 else pow(100,d)*101) |
p03324 | s006395515 | Accepted | d,n=map(int, input().split())
if n == 100:
n = 101
print(n * 100 **d)
|
p03324 | s129364282 | Accepted | d, n = map(int, input().split())
print(100**d * n if n!=100 else 100**d * 101) |
p03324 | s674984312 | Accepted | d,n=map(int,input().split())
if(n!=100):
print(n*100**d)
else:
print((n+1)*100**d) |
p03324 | s528394714 | Accepted | def solve():
d,n = map(int,input().split())
if n!=100:
print(n*(100**d))
else:
print(101*(100**d))
if __name__=='__main__':
solve() |
p03324 | s727045143 | Accepted | D,N=map(int,input().split())
p=0
if N==100:
print(pow(100,D+1)+pow(100,D))
else:
print(pow(100,D)*N) |
p03324 | s420047712 | Accepted | import sys
sys.setrecursionlimit(10**6)
d,n=map(int,input().split())
if d==0:
if n==100:
print(n+1)
exit()
print(n)
elif d!=0 and n==100:
print((n+1)*100**d)
else:
print(n*100**d)
|
p03324 | s394726723 | Accepted | d,n = map(int, input().split())
print((100**d)*n if n <= 99 else (100**d)*101) |
p03324 | s666264650 | Accepted | # B - Ringo's Favorite Numbers
D, N = map(int, input().split())
if N < 100:
print(100 ** D * N)
else:
print(100 ** D * (N + 1)) |
p03324 | s814853513 | Accepted | d, n = [int(w) for w in input().split()]
if n == 100:
n = 101
print(100**d*n)
|
p03324 | s058604505 | Accepted | d, n = map(int, input().split())
count = 0
i = 1
while True:
c = 0
num = i
while num >= 100:
if num%100==0:
num = num//100
c += 1
else:
break
if c==d:
count += 1
if count == n:
print(i)
break
i += 1 |
p03324 | s579366708 | Accepted | import sys
input = sys.stdin.readline
def main():
D, N = map(int, input().split())
if N == 100:
ans = 100 ** D * (N + 1)
else:
ans = 100 ** D * N
print(ans)
if __name__ == "__main__":
main()
|
p03324 | s381230706 | Accepted | from sys import stdin
input = stdin.readline
D, N = map(int, input().split())
ans = 100 ** D * N
if N == 100:
ans += 100 ** D
print(ans)
|
p03324 | s798061613 | Accepted | D,N = map(int,input().split())
if D == 0:
c = N//100
print(N+c)
else:
tmp = 100 ** D
c = N//100
print(tmp*N+c*tmp) |
p03324 | s418087944 | Accepted | d,n=map(int, input().split())
if n==100:n=101
s=(100**d)*n
print(s) |
p03324 | s414292735 | Accepted | d, n = map(int, input().split())
if n < 100:
print(n * (100 ** d))
else:
print((n + 1) * (100 ** d)) |
p03324 | s762916426 | Accepted | D, N = map(int, input().split())
if N == 100:
print(101 * 100**D)
else:
print(N * 100**D) |
p03324 | s684506008 | Accepted | #--------------------------------------------
#ライブラリ呼び出し
import sys
import math
#--------------------------------------------
D, N = map(int, input().split())
if N ==100:
N=101
ans=(100**D)*N
print(ans) |
p03324 | s695792111 | Accepted | #!python3
# input
D, N = list(map(int, input().split()))
def main():
if N == 100:
ans = 100 ** (D + 1) + 100 ** D
else:
ans = str(N) + "00" * D
print(ans)
if __name__ == "__main__":
main()
|
p03324 | s905217922 | Accepted | d, n = map(int, input().split())
if n == 100:
print(100 ** d * (n+1))
exit()
print(100 ** d * n)
|
p03324 | s836946102 | 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 | s253279254 | Accepted | d,n=map(int,input().split())
if n<100:
print(n*(100**d))
else:
print(101*(100**d))
|
p03324 | s851678995 | Accepted | d, n = map(int, input().split())
ans = 0
if n == 100:
print((n+1) * (100**d))
else:
print(n * (100**d))
|
p03324 | s686999070 | Accepted | D, N = map(int,input().split())
if N % 100 == 0: N += 1
print(N * 100 ** D) |
p03324 | s425675403 | Accepted | D, N = map(int, input().split())
if N == 100:
print(101 * 100 ** D)
else:
print(N * 100 ** D) |
p03324 | s631370846 | Accepted | d, n = map(int, input().split())
if n != 100:
print((100**d)*n)
else:
print((100**d)*101)
|
p03324 | s574395774 | Accepted | d,n = map(int, input().split())
if n == 100:
n += 1
for i in range(d):
n *= 100
print(n)
|
p03324 | s230553605 | Accepted | d,n = map(int,input().split())
if n == 100:
print(101*(100**d))
exit()
if d == 0:
print(n)
elif d == 1:
print(100*n)
else:
print(10000*n)
|
p03324 | s455495128 | 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 | s142926276 | Accepted | d,n=map(int,input().split())
k=100**d
if n%100==0:
n+=n//100
ans=n*k
print(ans) |
p03324 | s179199331 | Accepted | icase=100
if icase==100:
d,n=map(int,input().split())
if n<100:
print(n*100**d)
else:
print((n+1)*100**d) |
p03324 | s390796762 | Accepted | D,N=map(int,input().split())
if N==100:
print(101*100**D)
else:
print(N*100**D)
|
p03324 | s109203191 | Accepted | d, n = map(int,input().split())
def cal(x):
if x % 100 != 0: return 0
return cal(x/100) + 1
cnt = 0
tmp = 1
while True:
if cal(tmp) == d:
cnt += 1
if cnt == n:
break
tmp += 1
print(tmp) |
p03324 | s639920443 | Accepted | #n = int(input())
d,n = list(map(int,input().split()))
if n < 100:
print(n*(100**d))
else:
print((n+1)*(100**d)) |
p03324 | s424542857 | Accepted | def resolve():
d, n = map(int, input().split())
if n == 100:
n = 101
print((100 ** d) * n)
resolve() |
p03324 | s770854612 | 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 | s924650539 | Accepted | d,n = map(int,input().split())
if d == 0:
if n==100:
print(101)
else:
print(n)
else:
if n==100:
print(100**d*(n+1))
else:
print(100**d*n)
|
p03324 | s349805612 | Accepted | d, n = map(int, input().split())
if n == 100:
print((100 ** d) * n + 100**d)
else:
print((100**d)*n)
|
p03324 | s836005998 | Accepted | D, N = map(int, input().split())
if N<100:
print(100**D*N)
else:
print(100**D*101) |
p03324 | s346654912 | Accepted | def calc(n):
if n % 100 != 0:
return 0
return calc(n/100) + 1
def resolve():
d, n = map(int, input().split())
n = n + calc(n)
print(100**d*n)
resolve() |
p03324 | s002473486 | Accepted | D,N = map(int,input().split())
ans = 0
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(10100)
elif D == 2 and N != 100:
print(N*10000)
else:
print(1010000) |
p03324 | s362020794 | 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
elif d==2:
if n == 100:
ans = 1010000
else:
ans = n*10000
print(ans) |
p03324 | s345969000 | Accepted | 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())
if N == 100:
print(100 ** D * (N + 1))
else:
print(100 ** D * N) |
p03324 | s445241420 | Accepted | d, n = map(int, input().split())
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:
base = 100**d
print(base*n)
|
p03324 | s998223532 | Accepted | def resolve():
D, N = list(map(int, input().split()))
ls = [100 ** D * i for i in range(1, 100)]
ls.append(100 ** D * 101)
print(ls[N-1])
return
resolve() |
p03324 | s552668478 | Accepted | d, n = list(map(int, input().split()))
cnt = 0
i = 1
while True:
if(d == 0 and i % 100 != 0):
cnt += 1
if(d != 0 and i % (100 ** d) == 0 and i % (100 ** (d+1)) != 0):
cnt += 1
if(cnt == n):
print(i)
exit()
i += 1 |
p03324 | s832086824 | Accepted | D, N = map(int, input().split())
ans = 100 ** D * N
if N == 100:
ans += 100 ** D
print(ans) |
p03324 | s655654036 | Accepted | import sys
def input(): return sys.stdin.readline().rstrip()
D, N = map(int, input().split())
print(100**D*N if N<100 else 100**D*(N+1)) |
p03324 | s262601738 | Accepted | #n = int(input())
d, n = map(int, input().split())
#al = list(map(int, input().split()))
#al=[list(input()) for i in range(n)]
if n==100:
print(101*(100**d))
else:
print(n*(100**d))
|
p03324 | s162517226 | Accepted | D, N = map(int, input().split())
if N == 100:
N += 1
print(N * 100 ** D)
|
p03324 | s240269053 | Accepted | d,n=map(int,input().split())
li = [i * 10 ** (2*d) for i in range(2*n) if i % 100 != 0]
print(li[n-1]) |
p03324 | s592564421 | Accepted | D, N = map(int, input().split())
if (N == 100):
print((N * (100 ** D)) + 100**D)
else:
print(N * (100 ** D))
|
p03324 | s576646458 | Accepted | d, n = map(int, input().split())
if n == 100:
n = 101
print(100**d * n) |
p03324 | s550068741 | Accepted | a,b=map(int,input().split())
print((100**a)*b if b<100 else (100**a)*(b+1)) |
p03324 | s174268225 | Accepted | d,n = map(int, input().split())
if n == 100:
n = 101
print((100**d)*n) |
p03324 | s921327221 | Accepted | nums = [int(e) for e in input().split()]
if(nums[1] == 100):
print(pow(100,nums[0])*(nums[1]+1))
else:
print(pow(100,nums[0])*nums[1]) |
p03324 | s926560987 | Accepted | d, n = map(int,input().split())
i = 0
count = 0
beki = 0
beki = 100 ** d
while not count == n:
i += 1
if i % 100 == 0:
continue
count += 1
print(i * beki) |
p03324 | s614687699 | Accepted | D,N=map(int,input().split())
if N==100:
print((N+1)*(100**D))
else:
print(N*(100**D))
|
p03324 | s780178823 | Accepted | D,N=map(int,input().split())
num=N*100**D
if N==100:
num+=100**D
print(num) |
p03324 | s422865157 | Accepted | d,n=map(int, input().split())
print(100**d*n if n!=100 else 100**d*(n+1)) |
p03324 | s036375727 | Accepted | d,n = map(int,input().split())
if n==100:
n=101
print(n*100**d) |
p03324 | s868393212 | Accepted | d,n=map(int,input().split())
if n==100:
print(101*100**d)
else:
print(n*100**d)
|
p03324 | s882434699 | Accepted | D,N = map (int, input ().split ())
if N == 100:
X = (100**D)*(N+1)
else:
X = (100**D)*N
print (X) |
p03324 | s873313899 | Accepted | d, n = map(int, input().split())
if n < 100: print(n * (100 ** d))
else: print((n + 1) * (100 ** d)) |
p03324 | s013146397 | Accepted | a,b=map(int,input().split())
if b==100:
b+=1
print(b*(100**a))
|
p03324 | s325238524 | Accepted | D, N = map(int, input().split())
ans = 0
df = 0
if D == 0:
df = 1
elif D == 1:
df = 100**1
else:
df = 100**2
if N < 100:
ans = df * N
else:
ans = df * (N+1)
print(ans) |
p03324 | s901648910 | Accepted | d,n=map(int,input().split())
print(100**d*(n+n//100)) |
p03324 | s143044167 | Accepted | x,y = map(int,input().split())
if y == 100:
y += 1
print((100**x)*y) |
p03324 | s737163475 | Accepted | d,n=map(int,input().split());print((n+n//100)*(100**d)) |
p03324 | s199935854 | Accepted | D, N = map(int, input().split())
if N == 100:
print(101*100**D)
else:
print(100**D * N) |
p03324 | s100927134 | Accepted | D,N = map(int,input().split())
#%%
ans = 0
cur = 0
for i in range(1,(100**D)*N*10):
a = i
t = 0
while a%100==0 and a>0:
a//=100
t+=1
if t==D:
cur += 1
if cur == N:
ans = i
break
print(ans)
|
p03324 | s265484842 | Accepted | D, N = map(int, input().split())
if N == 100:
print(N * 100 ** D + 100 ** D)
else:
print(N * 100 ** D)
|
p03324 | s291092874 | Accepted | D,N=map(int,input().split())
if N!=100:
print(N*(100**D))
else:
print(101*(100**D))
|
p03324 | s494160795 | 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)
elif d == 2:
if n == 100:
print(1010000)
else:
print(10000*n) |
p03324 | s984587299 | Accepted | #! python3
def main():
d, n = map(int, input().split())
dd = 100**d
if n%100 != 0:
ans = n*dd
else:
ans = (1+n)*dd
print(ans)
main() |
p03324 | s570467436 | Accepted | d,n=map(int, input().split())
if n != 100:
print(n*100**d)
else:
print(101*100**d) |
p03324 | s998936792 | Accepted | D,N=map(int,input().split())
if N<100:
print(N*100**D)
else:
print(101*100**D) |
p03324 | s982626675 | Accepted | D, N = map(int,input().split())
if N==100:
print(101*(100**D))
else:
print(N*(100**D))
|
p03324 | s806542117 | Accepted | d, n = map(int, input().split())
ans = 100**d*n
if ans % 100**(d+1) == 0:
ans += 100**d
print(ans)
|
p03324 | s767467309 | Accepted | #100b
D,N = map(int, input().split())
if D==0:
if N!=100:
print(N)
else:
print(1*(N+1))
elif D==1:
if N!=100:
print(100*N)
else:
print(100*(N+1))
elif D==2:
if N!=100:
print(10000*N)
else:
print(10000*(N+1)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.