problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p03324 | s738377850 | Wrong Answer | d,n=map(int,input().split())
print(n*100**d) |
p03324 | s008978303 | Wrong Answer | D , N = map(int, input().split())
C = []
if D == 0 :
for i in range(1,N+100):
if i%100 != 0 :
C.append(i)
print(C[N-1])
if D == 1:
print(100*N)
if D == 2:
print(10000*N) |
p03324 | s341492661 | Wrong Answer | d,n=map(int,input().split())
if d==0:
print(n)
else:
if n<100:
print(100**d*n)
else:
print(100**d*101)
|
p03324 | s987075459 | Wrong Answer | D, N = map(int, input().split())
print(N * 100**D) |
p03324 | s382816468 | Wrong Answer | D, N = map(int, input().split())
if 100*D == 0:
number = 1
else:
number = 100**D
print(N*number) |
p03324 | s300614508 | Wrong Answer | D,N=map(int,input().split())
print(str(N)+str(0)*(D*2)) |
p03324 | s155757744 | Wrong Answer | d,n = map(int,input().split())
m = n * 100
l = n * 10000
if(d == 0):
print(n)
elif(d == 1):
print(m)
elif(d == 2):
print(l) |
p03324 | s307850426 | Wrong Answer | d,n=map(int,input().split())
print(str(n)+str(0)*(d*2)) |
p03324 | s601044841 | Wrong Answer | def resolve():
d, n = map(int, input().split())
if d == 0:
if n == 100:
print(101)
else:
print(n)
return
if d == 1:
if n == 100:
print(10100)
else:
print(100 * n)
return
if d == 2:
if n == 100:
print(1000100)
else:
print(10000 * n)
return
return
if __name__ == "__main__":
resolve()
|
p03324 | s207280793 | Wrong Answer | D,N=map(int,input().split(' '))
print(N*(100**D)) |
p03324 | s881071023 | Wrong Answer | d, n = map(int, input().split())
print(n * 100 ** d) |
p03324 | s597407790 | Wrong Answer | 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(1000100) |
p03324 | s003388439 | Wrong Answer | a = list(map(int,input().split()))
print(100^a[0]*a[1])
|
p03324 | s007523230 | Wrong Answer | d, n = map(int, input().split())
print(100**d*n)
|
p03324 | s459218888 | Wrong Answer | d,n=map(int,input().split())
print((100**d)*n) |
p03324 | s485392831 | Wrong Answer | D,N = map(int,input().split())
ans = 100*D*N
if D==0:
ans = N
print(ans) |
p03324 | s611073376 | Wrong Answer | d, n = map(int, input().split())
print(n*(100)**d) |
p03324 | s785172066 | Wrong Answer | d, n = map(int, input().split())
print(n * (100 ** d)) |
p03324 | s414875597 | Wrong Answer | d, n = map(int, input().split())
cnt = 0
for i in range(1,10**9):
if i % 100**d == 0: cnt += 1
if cnt == n:
print(i)
break |
p03324 | s569591667 | Wrong Answer | d,n = map(int,input().split())
ans = 0
if d == 0:
ans = n
elif d == 1:
ans = 100 * n
else:
ans = 10000 * n
print(ans) |
p03324 | s625730943 | Wrong Answer | import sys
D,N = map(int,input().split())
if D not in [0,1,2] and not (1 <= N <= 100):
sys.exit()
print(N*100**D) |
p03324 | s436525037 | Wrong Answer | D, N = map(int, input().split())
if D==0:
print(N)
else:
print(100*D*N) |
p03324 | s190191978 | Wrong Answer | d,n = map(int,input().split())
print(n*(100**d))
|
p03324 | s487510768 | Wrong Answer | d,n=map(int,input().split())
a=100**d
print(a*n) |
p03324 | s285676828 | Wrong Answer | D, N = map(int, input().split())
print(N*(100**D)) |
p03324 | s389795692 | Wrong Answer | d, n = map(int, input().split())
if n == 100:
print(100**d * n + 1)
exit()
print(100**d * n) |
p03324 | s648673784 | Wrong Answer | d,n = map(int,input().split())
print((100**d)*n) |
p03324 | s009678998 | Wrong Answer | a,b=map(int, input().split())
print(b*100**a) |
p03324 | s217362147 | Wrong Answer | d,n = map(int,input().split())
if d == 0:
print(n)
elif d == 1:
print(100 * n)
elif d == 2:
print(10000 * n) |
p03324 | s806446394 | Wrong Answer | 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(1000100)
|
p03324 | s075098707 | Wrong Answer | d,n = map(int,input().split())
#print(n*100**d)
a = 0
while n > 0:
a += 100**d
n -= 1
print(a) |
p03324 | s630337120 | Wrong Answer | d,n=map(int,input().split())
if n==100:
n=101
print(10**d*n) |
p03324 | s559049773 | Wrong Answer | # AtCoder Beginner Contest 100
# B - Ringo's Favorite Numbers
D,N=map(int,input().split())
print(N*100**D) |
p03324 | s842235503 | Wrong Answer | D, N = map(int, input().split())
print(N * 100 ** D)
|
p03324 | s240836340 | Wrong Answer | d, n = map(int, input().split())
print((100**d)*n) |
p03324 | s505367512 | Wrong Answer | d, n = map(int, input().split())
if (d == 0):
print(n)
else:
print(100**d*n) |
p03324 | s257187571 | Wrong Answer | d,n=map(int,input().split())
print(n*(100**d)) |
p03324 | s897441638 | Wrong Answer | D, N = map(int, input().split())
ans = 100**D
ans += (N//100) * 100
print(ans*N) |
p03324 | s531428854 | Wrong Answer | D,N=map(int,input().split())
print((100**D)*N) |
p03324 | s637174316 | Wrong Answer | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
D, N = MAP()
print((100**D)*N)
|
p03324 | s657725833 | Wrong Answer | a=input().split(" ")
print((100**(int(a[0])))*(int(a[1]))) |
p03324 | s501699303 | Wrong Answer | d, n = map(int, input().split())
if d == 0:
print(n)
elif d == 1:
print(n*100)
elif d == 2:
print(n*10000)
|
p03324 | s431287183 | Wrong Answer | #100b
D,N = map(int, input().split())
if D==0:
if N!=100:
print(N)
else:
print(101)
elif D==1:
print(100*N)
elif D==2:
print(10000*N) |
p03324 | s151687474 | Wrong Answer | D,N = map(int,input().split())
print(N*pow(100,D)) |
p03324 | s178129822 | Wrong Answer | d,n=map(int,input().split())
if n != 100:
a=100**d*n
else:
a=101**d*n
print(a) |
p03324 | s851769070 | Wrong Answer | d, n = map(int, input().split())
if d == 0:
print(1*n)
elif d == 1:
print(100*n)
else:
print(10000*n) |
p03324 | s029606075 | Wrong Answer | d, n = map(int, input().split())
l = []
l.append(str(n))
for i in range(d):
l.append("00")
print("".join(l)) |
p03324 | s134181460 | Wrong Answer | #!/usr/bin/env python3
d, n = map(int, input().split())
if d == 0:
print(n)
elif d == 1:
print(100 * n)
else:
print(100 * 100 * n) |
p03324 | s166336480 | Wrong Answer | d,n = map(int,input().split())
if n==100:
ans = 100**d*n+1
else:
ans = 100**d*n
print(ans)
|
p03324 | s266567094 | Wrong Answer | d,n=map(int,input().split())
num=10**d
if n==100:
print(num*101)
else:
print(num*n) |
p03324 | s218989727 | Wrong Answer | #!/usr/bin/env python3
d, n = map(int, input().split())
print(n * 100**d + (n == 100))
|
p03324 | s280212759 | Wrong Answer | D, N = [int(_) for _ in input().split()]
ans = 1 * 100 ** D * N
if ans >= 1 * 100 ** (D+1):
ans = 1 * 100 ** D * 99
print(ans)
|
p03324 | s293426062 | Wrong Answer | d,n = map(int,input().split())
num = 100 ** d * n
print(num) |
p03324 | s770161662 | Wrong Answer | D,N=map(int,input().split())
if N!=100:
print(100**D*N)
else:
print(100**D*N+1) |
p03324 | s479423040 | Wrong Answer | a, b = map(int, input().split())
print((100**a)*b) |
p03324 | s294578911 | Wrong Answer | ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
d,n = nm()
ans = n*100**d
print(ans) |
p03324 | s866948565 | Wrong Answer | 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(10001)
else:
if N != 100:
print(N*10000)
else:
print(1000001) |
p03324 | s158610396 | Wrong Answer | from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from math import floor, ceil, sqrt, factorial, log
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict
from heapq import heappop, heappush, heappushpop
from itertools import product
import sys
stdin = sys.stdin
mod = 10**9 + 7
def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))
D, N = na()
if D == 0:
print(N)
else:
print(N * 100**D if N != 100 else 101 * 100**D)
|
p03324 | s647261594 | Wrong Answer | # import math
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque
# import numpy as np
# import scipy as scp
# 入力の受け取り
d,n = map(int,input().split())
if d ==0:
if n <=99:
ans = n
elif n==100:
ans = 101
elif d == 1:
if n <=99:
ans = n*100
elif n==100:
ans = 101*100
else:
if n <=99:
ans = n
elif n==100:
ans = 101*100**2
print(ans) |
p03324 | s110946586 | Wrong Answer | d, n = map(int, input().split())
print(100**d*n) |
p03324 | s182803319 | Wrong Answer |
d, n = map(int, input().split())
print(100 ** d * n) |
p03324 | s850911007 | Wrong Answer | 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(100001)
elif d==2 and n==100:
print(10000001)
else:
print(a[-1]) |
p03324 | s248787398 | Wrong Answer | D, N = map(int, input().split())
print((100**D)*N)
|
p03324 | s408648886 | Wrong Answer | D, N = map(int, input().split())
print(100**D*N)
|
p03324 | s869192137 | Wrong Answer | # coding:utf-8
d, n = map(int, input().split())
if d == 0:
print(n)
else:
print((100 ** d) * n)
|
p03324 | s628790773 | Wrong Answer | import itertools
import sys
input = sys.stdin.readline
D, N = map(int, input().split())
M = N // 99
ans = 100**D * (100*M + (N-M*99))
print(ans)
|
p03324 | s385560172 | Wrong Answer | D, N = map(int, input().split())
if N == 100:
print(100**D*N+100)
else:
print(100**D*N)
|
p03324 | s731007728 | Wrong Answer | D, N = map(int, input().split())
li = [i * 100 ** D for i in range(N + 1)]
print(li[N]) |
p03324 | s595629859 | Wrong Answer | D,N = map(int,input().split())
print(N*100**D if N != 100 else N*100**(D-1)) |
p03324 | s494834684 | Wrong Answer | D, N = map(int, input().split())
A = 100**D
print(A*N) |
p03324 | s139741498 | Wrong Answer | D,N=map(int,input().split())
l=[int(pow(100,D)*i) for i in range(1,N+1)]
print(l[N-1]) |
p03324 | s506656045 | Wrong Answer | a, b = list(map(int, input().split()))
print(b * 100 ** a)
|
p03324 | s436138005 | Wrong Answer | D, N = map(int, input().split())
tmp = str(100**D)
print(str(N)+tmp[1:]) |
p03324 | s060786119 | Wrong Answer | 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(10001)
else:
print(1000001)
|
p03324 | s164934078 | Wrong Answer | d,n = map(int,input().split())
if d == 0:
print(n)
else:
print(100**d*n) |
p03324 | s406974281 | Wrong Answer | d, n = map(int, input().split())
print(100**d*n if d>0 or n<100 else 101) |
p03324 | s147016562 | Wrong Answer | D,N = map(int,input().split())
if N < 100:
print((100**D)*N)
else:
print((100**D)*N+1) |
p03324 | s094395100 | Wrong Answer | D,N=map(int,input().split())
print(pow(100,D)*N) |
p03324 | s974342804 | Wrong Answer | d, x = (int(i) for i in input().split())
ans = str(x)
for i in range(d):
ans += '00'
print(ans)
|
p03324 | s435867983 | Wrong Answer | d,n = map(int,input().split())
if d !=0:
print((100**d)*n)
else:
print(n) |
p03324 | s424759118 | Wrong Answer | def read_ints():
return[int(i) for i in input().split()]
def main():
d, n = read_ints()
print(100 * (100**n) + 1 if n == 100 else (100**d)*n)
if __name__ == '__main__':
main() |
p03324 | s638284275 | Wrong Answer | #!/usr/bin/env python3
d, n = map(int, input().split())
print(n * 100**d + (n == 100 and d ==0))
|
p03324 | s434869760 | Wrong Answer | d, n = map(int, input().split())
print(n * 100**d)
|
p03324 | s270589760 | Wrong Answer | D,N = map(int,input().split())
ans = 0
if D == 0:
print(N)
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 | s200172727 | Wrong Answer | 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 ** 1) if a != 0 else str(int(dst) + 1)
print(dst)
|
p03324 | s853467901 | Wrong Answer | D,N = map(int,input().split())
ans = (100 ** D) * N
print(ans) |
p03324 | s731917719 | Wrong Answer | d, n = map(int, input().split())
s = 0
if d == 0:
print(n)
exit()
for i in range(100 ** d, 100 ** (d * 2), 100 ** d):
s += 1
if s == n:
print(i)
exit()
|
p03324 | s189472703 | Wrong Answer | D,N = map(int,input().split())
print(str((100 ** D) * N)) |
p03324 | s570385431 | Wrong Answer | d, n = map(int, input().split())
print(n*(100**d)) |
p03324 | s830883303 | Wrong Answer | d,n=map(int,input().split())
if d==0:
print(n)
exit()
if d==1:
base=100
elif d==2:
base=10000
tmp=base
for i in range(n-1):
tmp+=base
print(tmp) |
p03324 | s905075521 | Wrong Answer | import sys
stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))
def main():
d, n = nm()
print(pow(100, d) * n)
if __name__ == '__main__':
main()
|
p03324 | s176933400 | Wrong Answer | d,n,=map(int, input().split())
ans=0
for i in range(d+1):
ans=100**i*n
print(ans) |
p03324 | s247774561 | Wrong Answer | d,n=map(int,input().split())
ans=0
m=0
while True:
ans+=1
if ans//100==d:
m+=1
if n==m:
break
print(ans)
|
p03324 | s771982424 | Wrong Answer | d, n = map(int, input().split())
if d == 0:
print(n)
elif d == 1:
print(n*100)
else:
print(n*10000)
|
p03324 | s331586681 | Wrong Answer | 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(10010000)
else:
print(10000*N) |
p03324 | s981166208 | Wrong Answer | d, n = map(int,input().split())
if n == 100:
print('1010000')
else:
print(100 ** d * n) |
p03324 | s471067863 | Wrong Answer | d, n = map(int, input().split())
if n == 100:
print(100**d * n + 100 ** n)
exit()
print(100**d * n) |
p03324 | s542359399 | Wrong Answer | d,n=map(int,input().split())
print(n*100**d) |
p03324 | s733052143 | Wrong Answer | d, n = map(int, input().split())
print((100+(n==100))**d*n) |
p03324 | s730744080 | Wrong Answer | d, n = map(int, input().split())
ans = 0
if d == 0:
print(n)
elif d == 1:
print(100 * n)
elif d == 2:
print(10000 * n)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.