Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n = int(input())
numList = list()
for i in range(n):
    numList.append(int(input()))
sum, ctr = 0, 1
for i in numList:
    if i == 0: continue
    elif i % 2 != 0 and ctr % 2 != 0:
        sum = sum + 1
    ctr = ctr + 1
print(sum)

Fixed submission:
n = int(input())
S = list(map(int, input().split()))
ans = 0
for i in range(0, n, 2):
    if i%2 == 0 and S[i]%2 == 1:
        ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
n = int(input())
numList = list()
for i in range(n):
    numList.append(int(input()))
sum, ctr = 0, 1
for i in numList:
    if i == 0: continue
    else:
        if i % 2 != 0 and ctr % 2 != 0:
            sum = sum + 1
    ctr = ctr + 1
print(sum)

Fixed submission:
n = int(input())
S = list(map(int, input().split()))
ans = 0
for i in range(0, n, 2):
    if i%2 == 0 and S[i]%2 == 1:
        ans += 1
print(ans)

Buggy python submission (verdict: Runtime Error):
n = int(input())
numList = list()
for i in range(n):
    numList.append(int(input()))
sum, ctr = 0, 1
for i in numList:
    if i == 0: continue
    if i % 2 != 0 and ctr % 2 != 0:
        sum = sum + 1
    ctr = ctr + 1
print(sum)

Fixed submission:
n = int(input())
S = list(map(int, input().split()))
ans = 0
for i in range(0, n, 2):
    if i%2 == 0 and S[i]%2 == 1:
        ans += 1
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())


def calc(c):
    g = 0
    for x in range(1, 101):
        for y in range(1, 101):
            for z in range(1, 101):
                if (x * x) + (y * y) + (z * z) + x * y + y * z + x * z == c:
                    g += 1
    return g


for i in range(n):
    print(calc(i))

Fixed submission:
n = int(input())
a = [0] * (n + 1)
for x in range(1, 101):
    for y in range(1, 101):
        for z in range(1, 101):
            c = x * x + y * y + z * z + x * y + y * z + z * x
            if c <= n:
                a[c] +=1
            else:
                break
for i in a[1:]:
    print(i)
Buggy python submission (verdict: Runtime Error):
count = input()
a = 0
b = 0
c = 0
d = 0
while count:
    val = input()
    if val == 'AC':
        a += 1
    elif val == 'WA':
        b += 1
    elif val == 'TLE':
        c +=1
    elif val == 'RE':
        d+=1

print('AC x ' + str(a))
print('WA x ' + str(b))
print('TLE x ' + str(c))
print('RE x ' + str(d))

Fixed submission:
n = int(raw_input())

t = ['AC', 'WA', 'TLE', 'RE']
d = {}
for _ in xrange(n):
    s = raw_input()
    d[s] = d.get(s, 0) + 1
for k in t:
    print '%s x %d' % (k, d.get(k, 0))
Buggy python submission (verdict: Runtime Error):
#the program is to find the nearest number which is not included in N, and if more than 1 number, it will take the smallest one

#we will declare the x and n integer
x, n = map(int, input().split())

#declare the pi
p = list(map(int, input().split()))


for a in range(x + 1):
for b in [-1, +1]:
result = X + b * a
if p.count(result) == 0:
print(result)


Fixed submission:
x, n = map(int, input().split())
p = list(map(int, input().split()))

check = 1000000
ans = 0

N = list(range(102))

for i in range(1, 101):
    if i in p:
        N.remove(i)

for i in range(len(N)):
    if check > abs(N[i]-x):
        check = abs(N[i]-x)
        ans = N[i]
print(ans)
Buggy python submission (verdict: Runtime Error):
import math

A=input()
B=input()

num=int(A)*float(B)
num=math.floor(num) #Round down the value of A*B

print(int(num))

Fixed submission:
str_a, str_b = input().split()
a = int(str_a)
b_100 = int(str_b.replace('.', ''))
print(a * b_100 // 100)

Buggy python submission (verdict: Runtime Error):
# you take the input of A and B
# if b = 0 then straight away print 0
# if other value than 0 then compute X x b[i]
# if x > tha 10**18 then x = -1

a = int(input())
b = list(map(int,input().split()))
x = 1
if 0 in b :
  print(0)
  exit()
for i in range(len(b)):
  x = x * b[i]
  if x > 10**18:
    x = -1
    break
print(x)

Fixed submission:
str_a, str_b = input().split()
a = int(str_a)
b_100 = int(str_b.replace('.', ''))
print(a * b_100 // 100)

Buggy python submission (verdict: Runtime Error):
a,b = input().split() # read two numbeers 

A = int(a)  # Declare the number to A
B = int(b) # declare the number to B

C = int(A*B) # we use int to truncate the fractional part of C
print(C) # print C

Fixed submission:
str_a, str_b = input().split()
a = int(str_a)
b_100 = int(str_b.replace('.', ''))
print(a * b_100 // 100)

Buggy python submission (verdict: Runtime Error):
import math
num1=int(input("Enter the int number: "))
#input value for variable num1
num2=float(input("Enter the float number: "))
round(num2)
#input value for variable num2
mul=num1*num2;
print("the product of given numbers is: ",math.trunc(mul))
#display the producta=int (input)


Fixed submission:
str_a, str_b = input().split()
a = int(str_a)
b_100 = int(str_b.replace('.', ''))
print(a * b_100 // 100)
Buggy python submission (verdict: Runtime Error):
#need to use a raw input for one line input because they both defer in data types i.e interger and float
a,b = input().split()
#and then convert them back into respective data types
a=int(a)
b=float(b)
#multiply a and b and then round the answer up before printing
mul=a*b
ans=math.trunc(mul)
print(ans)


Fixed submission:
#input the K and S string
#using another new variable to count the length of string
#then compare the value with the string
#if string less than the value just pring the string S
#if the length of string more than the value
#cut the string using while loop then print ... at the end
#program end

K = int(input())  #O(1)
S = input() #O(1)
value=len(S)    #O(1)

if value <= K: 
    print(S)    #O(1)
elif value > K : 
    x=0     #O(1)
    while x<K: 
        print((S[x]),end=(""))  #O(1)
        x+=1
    print("...")   #O(1)

Buggy python submission (verdict: Runtime Error):
#firsts we declare string s and k, if character s is at most with char k, it will print char s, no change
#if s i more than k it


k = int(input())
s= input()

str = s
tripledot= "..."

#if same, no change
if lens(s) == k:
         print(s)

elif len(s) > k:
         print (str[0:k],"...")


Fixed submission:
#input the K and S string
#using another new variable to count the length of string
#then compare the value with the string
#if string less than the value just pring the string S
#if the length of string more than the value
#cut the string using while loop then print ... at the end
#program end

K = int(input())  #O(1)
S = input() #O(1)
value=len(S)    #O(1)

if value <= K: 
    print(S)    #O(1)
elif value > K : 
    x=0     #O(1)
    while x<K: 
        print((S[x]),end=(""))  #O(1)
        x+=1
    print("...")   #O(1)

Buggy python submission (verdict: Runtime Error):
k=int(input())
s=input()
if lens(s)>k:
  print(s[:k]+"..")
else:
  print(s)
s[]
s[5:]

Fixed submission:
#input the K and S string
#using another new variable to count the length of string
#then compare the value with the string
#if string less than the value just pring the string S
#if the length of string more than the value
#cut the string using while loop then print ... at the end
#program end

K = int(input())  #O(1)
S = input() #O(1)
value=len(S)    #O(1)

if value <= K: 
    print(S)    #O(1)
elif value > K : 
    x=0     #O(1)
    while x<K: 
        print((S[x]),end=(""))  #O(1)
        x+=1
    print("...")   #O(1)
Buggy python submission (verdict: Runtime Error):
import math
a = int(input())
b = int(input())
n = int(input())
x = min(b - 1, n)
ans = math.floor(a * x / b) - a * math.floor(x / b)
print(ans)

Fixed submission:
a, b, n = map(int, input().split())
if n >= b - 1:
    print((a * (b - 1)) // b)
else:
    print((a * n) // b)
Buggy python submission (verdict: Time Limit Exceeded):
inp=input().split()
n=int(inp[0])
m=int(inp[1])
arr=[]
pares=0
impares=0
count=1
nums=0
while len(arr)<(m+n):
    if count%2==0 and pares<n:
        arr.append(count)
        pares+=1
    elif count%2!=0 and impares<m:
        arr.append(count)
        impares+=1
    count+=1
sums=[]
for x in arr:
   for y in arr:
        if(x+y)%2==0 and [x,y] not in sums and [y,x] not in sums and x!=y:
            nums+=1
            sums.append([x,y])

print(nums)


Fixed submission:
n, m = list(map(int, input().split()))
print(n * (n-1) // 2 + m * (m-1) // 2)

Buggy python submission (verdict: Runtime Error):
import math
def f(x):
    return math.factorial(x)
arr=list(map(int,input().split()))
n=arr[0]
m=arr[1]
cnt=0
cnt+=int(f(n)/(2*f(n-2)))
if m>1:cnt+=int(f(m)/(2*f(m-2)))
print(int(cnt))

Fixed submission:
n, m = list(map(int, input().split()))
print(n * (n-1) // 2 + m * (m-1) // 2)
Buggy python submission (verdict: Runtime Error):
#hello
#password
#input
#understandign python
#less errors
$work now please
q = int(input())
w = q / 3
print(w ** 3)

Fixed submission:
def shortie(L):
    r = L/3
    return (r **3)


L =int(input())
print(shortie(L))
Buggy python submission (verdict: Runtime Error):
n=input()
i=0;c=0
a=input()
b=input()
while True:
    for j in range(a):
        if i >= n:break
        i+=1
        c+=1
    for j in range(b):
        i+=1
    if i > n:break
print(c)

Fixed submission:
N, A, B = [int(x) for x in input().strip().split()]
p = N // (A + B) * A
q = N % (A + B)
if q > A:
    q = A
print(p + q)

Buggy python submission (verdict: Time Limit Exceeded):
N,A,B= input().split()
ans=0
for i in range(int(N)):
    if i%(int(A)+int(B))<int(A):
        ans+=1
print(ans)


Fixed submission:
N, A, B = [int(x) for x in input().strip().split()]
p = N // (A + B) * A
q = N % (A + B)
if q > A:
    q = A
print(p + q)
Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())
c=int(input())
if(a==b or b==c or a==c):
    if(not(a==b and b==c)):
        print("Yes")
    else:
        print("No")
else:
    print("No")

Fixed submission:
import math

class Input():
	def readInt(self):
		return int(input())

	def readIntArray(self):
		return [int(x) for x in input().split(" ")]

	def readString(self):
		return input()

	def readStringArray(self):
		return input().split(" ")

	def readFloat(self):
		return float(input())

	def readFloatArray(self):
		return [float(x) for x in input().split(" ")]

def main():
	inp = Input()
	arr =  inp.readIntArray()
	s = set()
	s.update(arr)
	if len(s) == 2:
		print("Yes")
	else:
		print("No")

if __name__ == "__main__":
   main()
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int,input().split()))
flag = False
for i in range(n-1):
    for j in range (i+1,n):
        if a[i] == a[j]:
            flag = True
            break
print('YES' if flag == False else 'NO')

Fixed submission:
import math

def main():
    n = int(input())
    a = list(map(int, input().split()))
    cnt = {}
    for val in a:
        cnt[val] = cnt.get(val, 0) + 1
    distinct = True
    for val in cnt:
        if cnt[val] > 1:
            distinct = False
    if distinct:
        print("YES")
    else:
        print("NO")

if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
N,K=input().split()
n,k=int(N),int(K)
p=list(input().split())

for i in range (len(p)):
    p[i]=int(p[i])

pre=[0 for i in range (n)]
q=[0 for i in range (n-k+100)]


pre[0]=p[0]
for i in range(n):
    pre[i+1]=pre[i]+p[i]

for i in range(1,n-k+1):
    q[i]=pre[i+k]-pre[i]
   
ans=max(q)

print((ans+k)/2)



Fixed submission:
N,K=input().split()
n,k=int(N),int(K)
p=list(input().split())
ans = 0

for i in range (len(p)):
    p[i]=int(p[i])

pre=[0 for i in range (n+1)]
q=[0 for i in range (n-k+100)]


pre[0]=p[0]
for i in range(n):
    pre[i+1]=pre[i]+p[i]

for i in range(n-k+1):
    tmp = pre[i+k]-pre[i]
    ans = max(ans , tmp)

print ((ans + k) / 2)
Buggy python submission (verdict: Runtime Error):
a=input()

b=chr(a)
c=chr(b)
d=chr(c)

print(chr(ord(d)+1))

Fixed submission:
from sys import stdin

def main():
    s = stdin.readline().strip()
    print(chr(ord(s)+1))

main()

Buggy python submission (verdict: Runtime Error):
n=int(input())
diez=10*n+10
if(1<=n<=10000):
    if(n!=10):
        print(diez-n)
    else:
        print(n+99)


Fixed submission:
from sys import stdin

def main():
    s = stdin.readline().strip()
    print(chr(ord(s)+1))

main()
Buggy python submission (verdict: Runtime Error):
processedIp = input.split(' ')
k = int(processedIp[0])
x = int(processedIp[1])
totalValue = k*500
if (totalValue >= x):
    print("Yes")
else:
    print("No")

Fixed submission:
processedIp = input().split(" ")
k = int(processedIp[0])
x = int(processedIp[1])
totalValue = k*500
if (totalValue >= x):
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
processedIp = input.split(" ")
k = int(processedIp[0])
x = int(processedIp[1])
totalValue = k*500
if (totalValue >= x):
    print("Yes")
else:
    print("No")

Fixed submission:
processedIp = input().split(" ")
k = int(processedIp[0])
x = int(processedIp[1])
totalValue = k*500
if (totalValue >= x):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
#ddfdfdf
#djfkdnfjdnfjfn
#sjhdjhfjdf
def stringconcant(S,T):
    d = S
    h = T
    r = d+h
    return r

S,T= input().split()
d = stringconcant(T,S)
print(d)

Fixed submission:
string_1, string_2 = input("").split()
print(string_2+string_1)

Buggy python submission (verdict: Runtime Error):
s=input()
t=input()
print(t+s)
#a comment for exec

Fixed submission:
string_1, string_2 = input("").split()
print(string_2+string_1)

Buggy python submission (verdict: Runtime Error):
S = input()
T = input()
new = T + S
print(new)
#####################################

Fixed submission:
string_1, string_2 = input("").split()
print(string_2+string_1)
Buggy python submission (verdict: Runtime Error):
a=0dddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddddd

Fixed submission:
import math
t = int(input())
if t<2:
    print(2)
    exit()
for i in range(t,t+250):
    v = int(math.sqrt(i))
    f=0
    for j in range(2,v+1):
        if i%j==0:
            f=1
            break
    if(f==0):
        print(i)
        break
Buggy python submission (verdict: Runtime Error):
from sys import stdin
#from collections import deque
#from math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin
from math import gcd


def ii(): return int(stdin.readline())


def fi(): return float(stdin.readline())


def mi(): return map(int, stdin.readline().split())


def fmi(): return map(float, stdin.readline().split())


def li(): return list(mi())


def lsi():
    x=list(stdin.readline())
    x.pop()
    return x


def si(): return stdin.readline()


def sieve(x):
    a=[True]*(x+1)
    sq=floor(sqrt(x))
    for i in range(3, sq+1, 2):
        if a[i]:
            for j in range(i*i, x+1, i):
                a[j]=False
    if x>1:
        p=[2]
    else:
        p=[]
    for i in range(3, x+1, 2):
        if a[i]:
            p.append(i)
    return p
#vowel={'a', 'e', 'i', 'o', 'u', 'y', 'A', 'E', 'I', 'O', 'U', 'Y'}
#pow=[1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 16384, 32768, 65536, 131072, 262144, 524288, 1048576, 2097152, 4194304, 8388608, 16777216, 33554432, 67108864, 134217728, 268435456, 536870912, 1073741824, 2147483648, 4294967296, 8589934592, 17179869184, 34359738368, 68719476736, 137438953472, 274877906944, 549755813888, 1099511627776, 2199023255552, 4398046511104, 8796093022208, 17592186044416, 35184372088832, 70368744177664, 140737488355328, 281474976710656, 562949953421312, 1125899906842624, 2251799813685248, 4503599627370496, 9007199254740992, 18014398509481984, 36028797018963968, 72057594037927936, 144115188075855872, 288230376151711744, 576460752303423488, 1152921504606846976, 2305843009213693952, 4611686018427387904, 9223372036854775808]
############# CODE STARTS HERE #############
a, b=mi()
print((a*b)//gcd(a, b))

Fixed submission:
def calculate_gcd(x, y):
   while(y):
       x, y = y, x % y
   return x

def calculate_lcm(x, y):
    lcm = (x*y)//calculate_gcd(x,y)
    return lcm


str = input()
list1=str.split(' ')
a=int(list1[0])
b=int(list1[1])

lcm= calculate_lcm(a,b)

print(lcm)
Buggy python submission (verdict: Runtime Error):
n=int('enter number')
def doublefactorial(n): 
    if (n == 0 or n == 1): 
        return 1; 
    return n * doublefactorial(n - 2);

def trailing_zeros(longint):
    manipulandum = str(longint)
    return len(manipulandum)-len(manipulandum.rstrip('0'))
  
print("Double factorial is",  
       doublefactorial(n));

print('trailing zeroes are'+ str(trailing_zeros(doublefactorial(n))))



Fixed submission:
n=int(input())
if n%2 == 0:
    num=10
    c=0;
    while num <= n:
        c += (n//num)
        num *= 5
    print(c)
else:
    print(0)

Buggy python submission (verdict: Runtime Error):
def count_zero(num):
    i = 10
    count = 0
    while(i <= num):
        count += int(num/i)
        i = i*5
    return count
n = int(input())
print(factorial(n))
if(n % 2 == 0):
    print(count_zero(n))
else:
    print(0)

Fixed submission:
n=int(input())
if n%2 == 0:
    num=10
    c=0;
    while num <= n:
        c += (n//num)
        num *= 5
    print(c)
else:
    print(0)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
ten = 0
two = 0
five = 0
while n > 1:
  if n % 2 == 0:
    two = 1
  if n % 5 == 0:
    five = 1
  if two == 1 and five == 1:
    ten = ten + 1
    
    two = 0
    five = 0
  n = n - 2
print(ten)

Fixed submission:
n=int(input())
if n%2 == 0:
    num=10
    c=0;
    while num <= n:
        c += (n//num)
        num *= 5
    print(c)
else:
    print(0)
Buggy python submission (verdict: Runtime Error):
inp = input().split()

input().split() == "2 5 7" == ["2", "5","7"]

A = int(inp[0])
B = int(inp[1])
C = int(inp[3])

if A + B + C >= 22:
	print("bust")
else:
	print("win")

Fixed submission:
import math
from collections import defaultdict
ml=lambda:map(float,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())

"""========main code==============="""

a,b,c=ml()
if(a+b+c>=22):
    print("bust")
else:
    print("win")
Buggy python submission (verdict: Runtime Error):
s = input()
l = len(s)
half_len = int(l/2)

if l%2 != 0:
	s = s.replace(s[half_len], "")
	fst_half = s[:half_len]
	snd_half = s[half_len:]
else:
	fst_half = s[:half_len]
	snd_half = s[half_len:]

snd_half = snd_half[::-1]

count = 0
for i in range(half_len):
	if(snd_half[i] != fst_half[i]):
		count += 1

print(count)

Fixed submission:
s = input()
count = 0
for i in range(len(s)//2):
    if(s[i] != s[len(s)-i-1]):
        count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
a = (input())
if a == "SUN":
    print(7)
elif a == "MON":
    print(6)
elif a == "TUE":
    print(5)
elif a == "WED":
    print(4)
elif a == "THU":
    print(3)
elif a == "FRI":
    print(2)
elif a == "SAT":
     print(1)

Fixed submission:
s = ['SUN','MON','TUE','WED','THU','FRI','SAT']
day = input()
start = s.index(day)
if day == 'SUN':
    print(7)
else:
    count = 0
    for x in range(7):
        if start == 7:
            start = 0
        if s[start] == 'SUN':
            print(count)
            break
        else:
            start += 1
        count += 1
Buggy python submission (verdict: Runtime Error):
s = raw_input()
a,b = s.split('/')
a,b = int(a),int(b)

def mul(a,b):
    if a <= 9 and a >=1 and (1 <= b <= 9):
        return a * b
    else:
        return -1

print(mul(a,b))

Fixed submission:
a,b=map(int, input().split())
if a<=9 and b<=9:
    print(a*b)
else:
    print(-1)

Buggy python submission (verdict: Runtime Error):
s = raw_input()
a,b = s.split('/')
a,b = int(a),int(b)

def mul(a,b):
    if a <= 9 and a >=1 and (1 <= b <= 9):
        return a * b
    else:
        return -1

return mul(a,b)

Fixed submission:
a,b=map(int, input().split())
if a<=9 and b<=9:
    print(a*b)
else:
    print(-1)

Buggy python submission (verdict: Runtime Error):
s = raw_input()
a,b = s.split('/')
a,b = int(a),int(b)

def mul(a,b):
    if a <= 9 and a >=1 and (1 <= b <= 9):
        return a * b
    else:
        return -1

mul(a,b)

Fixed submission:
a,b=map(int, input().split())
if a<=9 and b<=9:
    print(a*b)
else:
    print(-1)

Buggy python submission (verdict: Runtime Error):
while True:
    try:
        a = int(input())
        b = int(input())
    except EOFError:
        break
    if a <= 9 and a>=1 and b <= 9 and b>=1:
        print(a * b)
    else:
        print(-1)

Fixed submission:
a,b=map(int, input().split())
if a<=9 and b<=9:
    print(a*b)
else:
    print(-1)

Buggy python submission (verdict: Runtime Error):
while True:
    try:
        a = int(input())
        b = int(input())
    except EOFError:
        break
    if a <= 9 and b <= 9:
        print(a * b)
    else:
        print(-1)

Fixed submission:
a,b=map(int, input().split())
if a<=9 and b<=9:
    print(a*b)
else:
    print(-1)
Buggy python submission (verdict: Runtime Error):
def main(n,s):
    if n == 1:
        return 1
        
    count = 1
    for i in range(1,n):
        if s[i] != s[i-1]:
            count += 1
    return count

inp = input().split()
n = int(inp[0])
s = inp[1]


print(main(n,s))

Fixed submission:
n = int(input())
s = input()

cnt = 1
for i in range(n-1):
    if s[i]!=s[i+1]:
        cnt+=1
print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
from itertools import combinations

n = int(input())
sticks = list(map(int, input().split()))
com = combinations(sticks, 3)
amount = 0
for m in com:
    if m[0] + m[1] > m[2] and m[0] + m[2] > m[1] and m[2] + m[1] > m[0]:
        amount += 1
print(amount)


Fixed submission:
input()
a = input().split(' ')
b = []
for i in a:
    b.append(int(i))
b.sort()
b.reverse()
out = 0
for i in range(len(b) - 2):
    l = i + 1
    r = len(b) - 1
    while l < r:
        if b[i] < b[l] + b[r]:
            out += r - l
            l += 1
        else:
            r -= 1

print(out)
Buggy python submission (verdict: Runtime Error):
num=int(input())
if(num%2==0): 
     print(0.5)
else
     print((num/2+1)/num)



Fixed submission:
n=int(input())
c=0
for i in range(1,n+1):
    if(i%2!=0):
        c+=1
print('%.10f'%(c/n))
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))
for i in range(0,n+1):
    for j in range(0,n):
        if a[j]==i:
            print("%d "%int(j+1),end='')

Fixed submission:
import math
n=int(input())
l=list(map(int,input().split()))
ans=[0]*n
for i in range(n):
    ans[l[i]-1]=i+1
for i in ans:
    print(i,end=" ")

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))
aa=[0]*n
for i in range(n):
    aa[a[i]-1]=i+1
kk=''
for i in aa:
    kk=kk +str(i) + ' '
print(kk)

'''
p,m=map(int,input().split())
s=bin(p)
s=s[2:]
n=len(s)


ans=pow(2,n) -1
if(m>=2):
    print(ans)
else:
    print(p)


m,n=map(int,input().split())
a=[False]*(n+1)
a[0]=True
for i in range(m):
    temp=list(map(int,input().split()))
    for kk in temp[1:]:
        a[kk]=True
ans=True
for nn in a:
    ans = nn and ans
if(ans):
    print("YES")
else:
    print("NO")



y,b,r = map(int,input().split())

if(r>b):
    if(b>y):
        print(int((3*y)+3))
    else:
        print(int(3*b))
else:
    if(b<y):
        print(int((3*y)-3))
    else:
        print()


  '''  




        

Fixed submission:
import math
n=int(input())
l=list(map(int,input().split()))
ans=[0]*n
for i in range(n):
    ans[l[i]-1]=i+1
for i in ans:
    print(i,end=" ")
Buggy python submission (verdict: Time Limit Exceeded):
n,m=map(int,(input().split(' ')))
a=list(map(int,input().split(' ')))
while m:
    m-=1
    r=max(a)
    a.remove(r)
    r//=2
    a.append(r)
print(sum(a))

Fixed submission:
#!/usr/bin/python3

import heapq

def main():
    line1 = input()
    line2 = input()

    n, m = list(map(int, line1.split()))
    l = list(map(int, line2.split()))
    ans = sum(l)
    for i in range(len(l)):
        l[i] *= -1
    heapq.heapify(l)
    for i in range(m):
        price = heapq.heappop(l) * (-1)
        new_price = price // 2
        heapq.heappush(l, new_price * (-1))
        ans -= (price - new_price)
    print(ans)
    return

if __name__ == "__main__":
    main()