Problem p03324 (python)

Fixed submission:
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])

Buggy submission (verdict: Runtime Error):
def main():
    d,n = map(int, input().split())
    if n == 100:
        print((100**d) * (n+1)) 
        sys.exit()
    print((100**d) * n)  
if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
def main():
    d,n = map(int, input().split())
    if n == 100:
        print((100**d) * n+1) 
        sys.exit()
    print((100**d) * n)  
if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
def main():
    d,n = map(int, input().split())
    if n == 100:
        print(((100**d) * n) + 1)
        sys.exit()
    print((100**d) * n)  
if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
def main():
    d,n = map(int, input().split())
    a_list = []
    
    if d == 0:
        for i in range(0,100):
            a_list.append(i)
        print(a_list[n])
        sys.exit()

    elif d == 1:
        for i in range(100, 10000, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1000000, 10000):
            a_list.append(i)

    #print(n-1)
    print(a_list[n-1])
    #print(len(a_list))
    
if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
def main():
    d,n = map(int, input().split())
    a_list = []
    
    if d == 0:
        for i in range(0,100):
            a_list.append(i)

    elif d == 1:
        for i in range(100, 10000, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1000000, 10000):
            a_list.append(i)

    #print(n-1)
    print(a_list[n-1])
    #print(len(a_list))
    
if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt, gcd
from copy import deepcopy

def main():
    d,n = map(int, input().split())
    a_list = []
    
    if d == 0:
        for i in range(0,100):
            a_list.append(i)

    elif d == 1:
        for i in range(100, 10000, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1000000, 10000):
            a_list.append(i)

    #print(n-1)
    print(a_list[n-1])
    #print(len(a_list))
    
if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
def main():
    d,n = map(int, input().split())
    a_list = []
    
    if d == 0:
        for i in range(1,100):
            a_list.append(i)
    elif d == 1:
        for i in range(100, 10000, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1000000, 10000):
            a_list.append(i)

    print(a_list[n-1])
    
if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt, gcd
from copy import deepcopy

def main():
    d,n = map(int, input().split())
    a_list = []
    ans = 0
    if d == 0:
        for i in range(1,100):
            a_list.append(i)
    elif d == 1:
        for i in range(100, 10000, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1000000, 10000):
            a_list.append(i)

    print(a_list[n-1])
    
if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
def main():
    
    d,n = map(int, input().split())
    a_list = []
    ans = 0
    if d == 0:
        for i in range(1,100):
            a_list.append(i)
    elif d == 1:
        for i in range(100, 10000, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1000000, 10000):
            a_list.append(i)

    print(a_list[n-1])
    
if __name__ == '__main__':
    main()

Buggy submission (verdict: Runtime Error):
def main():
    
    d,n = map(int, input().split())
    a_list = []
    ans = 0
    if d == 0:
        for i in range(1,100):
            a_list.append(i)
    elif d == 1:
        for i in range(100, 10000, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1000000, 10000):
            a_list.append(i)

    print(a_list[n-1])
    
if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
import os
import sys
from collections import defaultdict, Counter
from itertools import product, permutations,combinations, accumulate
from operator import itemgetter
from bisect import bisect_left,bisect
from heapq import heappop,heappush,heapify
from math import ceil, floor, sqrt, gcd
from copy import deepcopy

def main():
    
    d,n = map(int, input().split())
    a_list = []
    ans = 0
    if d == 0:
        for i in range(1,100):
            a_list.append(i)
    elif d == 1:
        for i in range(100, 10000, 100):
            a_list.append(i)
    else:
        for i in range(10000, 1000000, 10000):
            a_list.append(i)

    print(a_list[n-1])
    
if __name__ == "__main__":
    main()