problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03324 | s357178033 | Accepted | MM = input().split()
D = int(MM[0])
N = int(MM[1])
if N ==100:
ans = 100**D*(N+1)
else:
ans = 100**D *N
print(ans) |
p03324 | s931032440 | Accepted | d, n = map(int, input().split())
if n == 100:
print(101 * 100 ** d)
else:
print(n * (100 ** d)) |
p03324 | s899020925 | Accepted | #
# Written by NoKnowledgeGG @YlePhan
# ('ω')
#
#import math
#mod = 10**9+7
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
r_ = n / m
if (r_ - (n // m)) > 0:
return (n//m) + 1
else:
return (n//m)"""
def main():
a,b = map(int,input().split())
if b != 100:
print(100**a*b)
else:
print(100**a + b**(a+1))
if __name__ == '__main__':
main() |
p03324 | s752464777 | Accepted | D,N=map(int,input().split(' '))
if N != 100:
print(N*(100**D))
else:
print((N+1)*(100**D)) |
p03324 | s426697897 | Accepted | 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(10100)
elif D == 2 and N < 100:
print(N * 100 * 100)
elif D == 2 and N == 100:
print(1010000) |
p03324 | s085638049 | Accepted | import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
D, N = M()
i = 100**D
if N < 100:
print(N*i)
else:
print(101*i) |
p03324 | s701003570 | Accepted | d, n = map(int, input().split())
def culc(x):
if x % 100 != 0:
return 0
else:
cnt = 0
while x % 100 == 0:
x //= 100
cnt +=1
return cnt
count = 0
for i in range(1, 1010001):
if culc(i) == d:
count += 1
if count == n:
print(i)
break |
p03324 | s377105599 | Accepted | D, N = map(int, input().split())
if N != 100:
print(100 ** D * N)
else:
print(100 ** D * 101) |
p03324 | s292452727 | Accepted | D,N = list(map(int,input().split()))
count = 0
now = 1
while True:
tmp = now*100**D
if tmp%(100**(D+1)) != 0:
count += 1
if count == N:
print(tmp)
exit()
now += 1 |
p03324 | s901637745 | Accepted | a,b=map(int,input().split())
if a==0 and b!=100:
print(b)
elif a==0 and b==100:
print(101)
elif a==1 and b!=100:
print(b*100)
elif a==1 and b==100:
print(10100)
elif a==2 and b!=100:
print(b*10000)
else:
print(101*10**4)
|
p03324 | s891519256 | Accepted | d, n = map(int, input().split())
cnt = 0
for i in range(1, 10**7+1):
if i%(100**d) == 0:
cnt += 1
if n == 100:
if cnt == n+1:
print(i)
exit()
else:
if cnt == n:
print(i)
exit()
|
p03324 | s473879284 | 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(101*100)
else:
print(N*100)
if D == 2:
if N == 100:
print(101*100**2)
else:
print(N*100**2)
|
p03324 | s156511740 | Accepted | d, n = map(int, input().split())
print([i*100**d for i in range(1, 102) if i != 100][n - 1]) |
p03324 | s759147534 | Accepted | d,n=map(int,input().split())
print((n+1)*(100**d) if n==100 else n*(100**d))
|
p03324 | s007649846 | Accepted | d, n = map(int, input().split())
print(100**d*(n+(n==100))) |
p03324 | s749627892 | Accepted | d, n = map(int, input().split())
ten = [1, 100, 10000]
sub = (n - 1) // 99
print(((100 * sub) + n - (99 * sub)) * ten[d]) |
p03324 | s038901813 | Accepted | D,N = map(int,input().split())
if N == 100:
print(101*100**D)
else:
print(N*100**D)
|
p03324 | s582035213 | Accepted | d, n = map(int,input().split())
print(100**d *(n+n//100)) |
p03324 | s180869371 | Accepted | D,N=map(int,input().split())
B=100**D
I=0
A=0
while I<N:
A+=B
if (A//B)%100:
I+=1
print(A)
|
p03324 | s270153338 | Accepted | d, n = map(int, input().split())
if n == 100:
n = 101
print(str(n) + ('00' * d))
|
p03324 | s825162299 | Accepted | D, N = map(int, input().split())
if N<100:
print(N*(100**D))
else:
print(101*(100**D)) |
p03324 | s366297295 | 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 | s469113446 | Accepted | d,n=list(map(int,input().split()))
print(100**d*(n+n//100)) |
p03324 | s631288239 | Accepted | #!/usr/bin/env python3
import sys
def main():
D, N = map(int, input().split())
l = []
for i in range(1,10000*120):
if i % (100**D) == 0 and i % (100**(D+1)) != 0:
l.append(i)
print(l[N-1])
if __name__ == '__main__':
main()
|
p03324 | s533550538 | Accepted | A,B=map(int,input().split())
if B!=100:
print(B*(100**A))
else:
print((B+1)*(100**A))
|
p03324 | s597498961 | Accepted | d, n = map(int, input().split())
if n == 100:
print(str(101) + ('00' * d))
else:
print(str(n) + ('00' * d)) |
p03324 | s390551394 | Accepted | import sys
d,n=map(int,input().split())
if d==0:
if n==100:
print('101')
else:
print(n)
sys.exit()
if n==100:
print((100**d)*101)
else:
print((100**d)*n) |
p03324 | s488370191 | Accepted | d, n = list(map(int, input().split()))
if n != 100:
print(n * int(100 ** d))
else:
print(101 * int(100 ** d))
|
p03324 | s995664360 | Accepted | d,n = map(int,input().split())
if n == 100:
print(100 ** d * n + 100 ** d)
else:
print(100 ** d * n) |
p03324 | s052778986 | Accepted | D,N = map(int,input().split())
if N==100:
N += 1
print(100**D * N) |
p03324 | s997858545 | Accepted | #!/use/bin/env python3
import math
from collections import defaultdict
(d, n) = [int(s) for s in input().split()]
ans = 0
if d == 0:
ans = 1
elif d == 1:
ans = 100
else:
ans = 10000
ans = 101 * ans if n == 100 else n * ans
print(ans)
|
p03324 | s121168399 | Accepted | d, n = map(int,input().split())
i = 0
count = 0
beki = 0
if d == 0:
beki = 1
elif d == 1:
beki = 100
else:
beki = 10000
while not count == n:
i += 1
if i % 100 == 0:
continue
count += 1
print(i * beki) |
p03324 | s684382266 | Accepted | d,n = map(int,input().rstrip().split(' '))
if n!=100:
print(n*(100**d))
else:
print((n+1)*(100**d)) |
p03324 | s021620806 | Accepted | D,N = map(int,input().split())
print(N*100**D if N != 100 else 101*100**D) |
p03324 | s136570287 | Accepted | d,n = map(int,input().split())
ans = 0
if d == 0:
ans = n
elif d == 1:
ans = 100 * n
else:
ans = 10000 * n
if n == 100:
if d == 0:
ans += 1
elif d == 1:
ans += 100
else:
ans += 10000
print(ans) |
p03324 | s616262468 | Accepted | def main():
d,n = map(int, input().split())
if n == 100:
print(100**d*101)
else:
print(n*100**d)
if __name__ =='__main__':
main()
|
p03324 | s700448431 | Accepted | D,N = map(int,input().split())
if N == 100:
print(10**(2*D)*101)
else:
print(10**(2*D)*N) |
p03324 | s450391894 | Accepted | # -*- coding: utf-8 -*-
D, N = map(int, input().split())
if (100 ** D * N) / 100 != 100 ** D:
print(100 ** D * N)
else:
print((100 ** D * N) + (100 ** D)) |
p03324 | s258582093 | Accepted | d,n = map(int, input().split())
if (n != 100):
print((100**d) * n)
else:
print((100**d)*101) |
p03324 | s172826035 | Accepted | D,N=list(map(int, input().split()))
if N==100:
N+=1
print(100**D*N) |
p03324 | s259476041 | 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 | s929202083 | Accepted | d,n=map(int,input().split())
s=list(range(0,102))
s.pop(-2)
print(s[n]*(100**d)) |
p03324 | s704059371 | Accepted | d, n = map(int, input().split())
if d == 0:
if n == 100:
print(n+1)
else:
print(n)
elif d == 1:
if n == 100:
print((n+1)*100)
else:
print(n*100)
elif d == 2:
if n == 100:
print((n+1)*10000)
else:
print(n*10000) |
p03324 | s310627339 | Accepted | D, N =map(int, input().split())
if N != 100:
print(100**D*N)
else:
print(100**D*101)
|
p03324 | s950315449 | Accepted | d,n=map(int,input().split())
if n == 100:
a=101*100**d
else:
a=100**d*n
print(a) |
p03324 | s946724380 | Accepted | a,b = map(int,input().split())
c = 100 ** a
if b == 100:
print(c * (b+1))
else:
print(c * b)
|
p03324 | s517718569 | Accepted | d, n = map(int, input().split())
if n == 100:
ans = (n + 1) * 100 ** d
else:
ans = n * 100 ** d
print(ans)
|
p03324 | s391758716 | Accepted | d, n = map(int, input().split())
# d, n = 0, 5
# d, n = 1, 11
# d, n = 2, 85
if n != 100:
print(100**d*n)
else:
print(100**d*101)
|
p03324 | s087779991 | Accepted | d,n=map(int,input().split())
if d == 0:
print(n if n!=100 else "101")
elif d == 1:
print(n*100 if n!=100 else 10100)
else:
print(n*10000 if n!=100 else 1010000)
|
p03324 | s136158165 | Accepted | a,b=input().split()
a=int(a)
b=int(b)
if b<100:
print((100**a)*b)
elif b==100:
print((100**a)*(b+1)) |
p03324 | s184685104 | Accepted | D,N = map(int,input().split())
if N < 100:
print((100**D)*N)
else:
print((100**D)*(N+1)) |
p03324 | s778729736 | Accepted | a,b=map(int,input().split())
if b==100:
print(101*100**a)
else:
print(b*100**a) |
p03324 | s250305907 | Accepted | d, n = map(int,input().split())
print(100**d * n) if n < 100 else print(100**d * (n+1)) |
p03324 | s192779831 | Accepted | d,n = map(int,input().split())
if n==100:
print((n+1)*(100**d))
else:
print(n*(100**d)) |
p03324 | s748714422 | Accepted | d,n=map(int,input().split())
if d==0:
cnt=0
i=1
while 1:
if i%100!=0:
cnt+=1
if cnt==n:
print(i)
exit()
i+=1
else:
cnt=0
i=1
waru=100**d
while 1:
if i%waru==0 and (i//waru)%100 !=0 :
cnt+=1
if cnt==n:
print(i)
exit()
i+=1
|
p03324 | s722530912 | Accepted | d, n = [int(x) for x in input().split()]
if n < 100:
print(n * 100 ** d)
else:
print(101 * 100 ** d)
|
p03324 | s409750675 | Accepted | D, N = map(int, input().split())
print([100 ** D * i for i in range(102) if i%100 != 0][N-1]) |
p03324 | s186549926 | Accepted | D, N = map(int, input().split())
print(int(str(N) + '00' * D) if N != 100 else int(str(N + 1) + '00' * D))
|
p03324 | s506436718 | 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)
elif d==2:
if n==100:
print(1010000)
else:
print(n*10000) |
p03324 | s761652194 | Accepted | a, b = map(int, input().split())
if b != 100:
print(100**a*b)
else:
print(100**a*(b+1)) |
p03324 | s253589313 | Accepted | D, N = map(int, input().split())
if N <= 99:
print(100 ** D * N)
else:
print(100 ** D * 101) |
p03324 | s247146242 | 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 += 100 ** d
|
p03324 | s250624998 | Accepted | D,N=map(int,input().split())
if N==100:
ans=(100**D)*(N+1)
else:
ans=(100**D)*N
print(ans) |
p03324 | s577786058 | Accepted | D, N = map(int,input().split())
ls = [0]*2000000
for i in range(1,2*10**6):
if i % 100 == 0:
ls[i] = 1
if i % 10000 == 0:
ls[i] = 2
if i % 1000000 == 0:
ls[i] = 3
ii = 0
for i in range(1,2*10**6):
if ls[i] == D:
ii += 1
if ii == N:
ans = i
break
print(ans) |
p03324 | s995723110 | Accepted | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
D, N = map(int, readline().split())
ans = pow(100, D)
if N < 100:
ans *= N
else:
ans *= 101
print(ans)
return
if __name__ == '__main__':
main()
|
p03324 | s626081320 | Accepted | d,n=map(int,input().split())
ans=[]
base=100**d
cur=1
if n!=100:
print(n*base)
else:
print(101*base)
|
p03324 | s416543584 | Accepted | d,n = map(int,input().split())
print ((100**d)*n) if n != 100 else print ((100**d)*101)
|
p03324 | s629711793 | Accepted | d,n=map(int,input().split())
if n==100:
ans=101*100**d
else:
ans=n*100**d
print(ans) |
p03324 | s137496742 | Accepted | #-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
d,n = map(int,input().split())
if n==100:
print((100**d)*101)
exit()
else:
print((100**d)*n)
if __name__=="__main__":
main() |
p03324 | s991719712 | Accepted | d, n = map(int, input().split())
if d == 1 and n == 100:
print("10100")
elif d == 2 and n == 100:
print("1010000")
elif d == 0 and n == 100:
print("101")
else:
print(int(100**d * n)) |
p03324 | s430395942 | Accepted | D,N=map(int, input().split())
if N!=100:
print((100**D)*(N))
else:
print((100**D)*(N+1)) |
p03324 | s047064708 | Accepted | # ALC008 C
d, n = map(int, input().split())
if n == 100:
print((100 ** d) * n + 100**d)
else:
print((100 ** d) * n) |
p03324 | s459774962 | Accepted |
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 | s062378857 | Accepted | #!/usr/bin/env python3
import sys
def main():
D, N = map(int, input().split())
if N != 100:
print((100**D)*N)
else:
print((100**D)*101)
return
if __name__ == '__main__':
main()
|
p03324 | s559636124 | 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:
print(n*100**d) |
p03324 | s139035344 | Accepted | D, N = map(int, input().split())
if (N == 100):
print((N * (100 ** D)) + 100**D)
else:
print(N * (100 ** D))
|
p03324 | s743395073 | Accepted | def main():
d, n = map(int, input().split())
if n == 100:
print(100 ** d * 101)
else:
print(n*(100**d))
if __name__ == '__main__':
main()
|
p03324 | s372895186 | Accepted | d,n=map(int,input().split())
if n==100:
print(100**d*101)
else:
print(100**d*n) |
p03324 | s091945228 | Accepted | D,N=map(int,input().split())
print((N+N//100)*100**D) |
p03324 | s641072850 | Accepted | D, N = map(int, input().split())
print(101 * 100**D if N == 100 else N * 100**D) |
p03324 | s656865922 | 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 | s348165103 | Accepted | d,n=map(int,input().split())
if n==100:
print((n+1)*100**d)
else:
print(n*100**d) |
p03324 | s282269630 | Accepted | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
D, N = map(int, readline().split())
if N < 100:
print(N * 100 ** D)
else:
print(100 * 100 ** D + 100 ** D)
if __name__ == '__main__':
main()
|
p03324 | s592241603 | Accepted | D,N=map(int,input().split())
ans=N*(100**D)
if N==100:
ans*=1.01
print(int(ans))
|
p03324 | s447284672 | Accepted | D, N = map(int, input().split())
ans = N*100**D
if N == 100:
ans = 101*100**D
print(ans) |
p03324 | s153452340 | Accepted | d, n = map(int, input().split())
if n == 100:
print(101 * 100**d)
else:
print(n * 100**d)
|
p03324 | s263584512 | Accepted | import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque
from decimal import *
def lcm(x, y):
return (x * y) // math.gcd(x, y)
if __name__ == '__main__':
b, c = map(int, input().split())
ans = 0
if c == 100:
ans =(100 **b)*(c+1)
else:
ans =(100 **b)*c
print(ans)
|
p03324 | s367594069 | Accepted | d,n=map(int,input().split())
# # nは1<=n<=100
s=1
if d==1:
s=100
elif d==2:
s=10000
if s==1:
ans=[i for i in range(1,100)]
ans.append(101)
elif s==100:
ans=[100*i for i in range(1,100)]
ans.append(10100)
else:
ans=[10000*i for i in range(1,100)]
ans.append(1010000)
print(ans[n-1]) |
p03324 | s615336177 | 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 | s371819511 | 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 | s933904541 | Accepted | d, n = map(int, input().split())
if n == 100:
print(100 ** d * (n + 1))
else:
print(100 ** d * n)
|
p03324 | s165964457 | 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 | s995161333 | 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 * 101)
else:
print(100**d * n) |
p03324 | s884564242 | Accepted | D,N=map(int,input().split())
temp=100**D
if N<=99:
print(temp*N)
else:
print(temp*101)
|
p03324 | s435271389 | Accepted | x,y=list(map(int, input().split()))
if y==100:
y=y+1
print((100**x)*y) |
p03324 | s152016218 | 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 | s305987990 | Accepted | d, n = map(int, input().split())
n += n==100
print((100**d) * n) |
p03324 | s346254949 | Accepted | def main():
D, N = map(int, input().split())
if N < 100:
print(100**D*N)
else:
print(100**D*101)
if __name__ == "__main__":
main()
|
p03324 | s748298215 | 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(100*101)
elif d==2:
if n!=100:
print(10000*n)
else:
print(10000*101) |
p03324 | s146925473 | Accepted | a,b=map(int,input().split())
if b==100:
b+=1
for i in range(a):
b*=100
print(b) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.