Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
rate = input()
if rate < 1200 :
  print( "ABC" )
else :
  print( "ARC" )

Fixed submission:
rate = int( input() )
if rate < 1200 :
  print( "ABC" )
else :
  print( "ARC" )
Buggy python submission (verdict: Runtime Error):
s = map( str, input().split(",") )
print( s[0] + " " + s[1] + " " + s[2] )

Fixed submission:
s = list( map( str, input().split(",") ) )
print( s[0] + " " + s[1] + " " + s[2] )
Buggy python submission (verdict: Runtime Error):
s1, s2, s3 =　map( str, input().split() )
print( "A" + list(s2)[0] + "C")

Fixed submission:
s1, s2, s3 = map( str, input().split() )
print( "A" + s2[0] + "C" )

Buggy python submission (verdict: Runtime Error):
s1, s2, s3 = map(string, input().split() )

s2p = list( s2 )[0]

print( s1 + s2p + s3 )

Fixed submission:
s1, s2, s3 = map( str, input().split() )
print( "A" + s2[0] + "C" )
Buggy python submission (verdict: Runtime Error):
H, W = map( int, input().split() )
s = [ [ map( str, input().split() ) ] for i in range(H) ] 
for i in range(H) : 
    for j in range(W) : 
       if s[i][j] == "snuke" : 
           w = chr( i + ord( "A" ) )
           h = i + 1
           exit()
print( w + str( h ) )

Fixed submission:
H, W = map( int, input().split() )
s = [ list( map( str, input().split() ) ) for i in range(H) ] 
for i in range(H) : 
    for j in range(W) : 
       if s[i][j] == "snuke" : 
           w = chr( j + ord( "A" ) )
           h = i + 1
           print( w + str( h ) )
           exit()

Buggy python submission (verdict: Runtime Error):
H, W = map( int, input().split() )
s = [ [ map( str, input().split() ) ] for i in range(H) ] 
for i in range(H) : 
    for j in range(W) : 
       if "snuke" in s[i][j] : 
           w = chr( i + ord( "A" ) )
           h = i + 1
           exit()
print( w + str( h ) )

Fixed submission:
H, W = map( int, input().split() )
s = [ list( map( str, input().split() ) ) for i in range(H) ] 
for i in range(H) : 
    for j in range(W) : 
       if s[i][j] == "snuke" : 
           w = chr( j + ord( "A" ) )
           h = i + 1
           print( w + str( h ) )
           exit()

Buggy python submission (verdict: Runtime Error):
H, W = map( int, input().split() )
abc = [ chr(i) for i in range( 65, 65+26 ) ]
for i in range(H) : 
    s = list( map( str, input().split() ) )
    if "snuke" in s : 
        w = abc[ s.index[ "snuke" ] ]
        h = i + 1
        break
print( w + str( h ) )

Fixed submission:
H, W = map( int, input().split() )
s = [ list( map( str, input().split() ) ) for i in range(H) ] 
for i in range(H) : 
    for j in range(W) : 
       if s[i][j] == "snuke" : 
           w = chr( j + ord( "A" ) )
           h = i + 1
           print( w + str( h ) )
           exit()

Buggy python submission (verdict: Runtime Error):
H, W = map( int, input().split() )
abc = [ chr(i) for i in range( 65, 65+26 ) ]
for i in range(H) : 
    s = list( map( str, input().split() ) )
    for j in range(W) :
        if "snuke" in s : 
           w = abc[ s.index[ "snuke" ] ]
           h = i + 1
           exit()
print( w + str( h ) )

Fixed submission:
H, W = map( int, input().split() )
s = [ list( map( str, input().split() ) ) for i in range(H) ] 
for i in range(H) : 
    for j in range(W) : 
       if s[i][j] == "snuke" : 
           w = chr( j + ord( "A" ) )
           h = i + 1
           print( w + str( h ) )
           exit()

Buggy python submission (verdict: Runtime Error):
H, W = map( int, input().split() )
abc = [ chr(i) for i in range( 65, 65+26 ) ]
for i in range(H) : 
    s = list( map( str, input().split() ) )
    for j in range(W) :
        if "snuke" in s : 
           w = abc[ s.index[ "snuke" ] ]
           h = i + 1
           break
print( w + str( h ) )

Fixed submission:
H, W = map( int, input().split() )
s = [ list( map( str, input().split() ) ) for i in range(H) ] 
for i in range(H) : 
    for j in range(W) : 
       if s[i][j] == "snuke" : 
           w = chr( j + ord( "A" ) )
           h = i + 1
           print( w + str( h ) )
           exit()
Buggy python submission (verdict: Runtime Error):
nums = map( int, input().split() )
nums.sort()

if num[0]+num[1]==num[2]:
  print("Yes")
else :
  print("No")
  

Fixed submission:
nums = list( map( int, input().split() ) ) 
nums.sort()

if nums[0]+nums[1]==nums[2]:
  print("Yes")
else :
  print("No")

Buggy python submission (verdict: Runtime Error):
num = list( map( int, input().split() ) ) 

sorted = list.sort()

if sorted[0]+sorted[1]==sorted[2] :
  print( "Yes" )
else : 
  print( "No" )
  

Fixed submission:
nums = list( map( int, input().split() ) ) 
nums.sort()

if nums[0]+nums[1]==nums[2]:
  print("Yes")
else :
  print("No")

Buggy python submission (verdict: Runtime Error):
num = list( map( int, input().split() ) )
[ a, b, c ] = num.sort()
 
if a + b == c:
  print( "Yes" )
else :
  print( "No" )

Fixed submission:
nums = list( map( int, input().split() ) ) 
nums.sort()

if nums[0]+nums[1]==nums[2]:
  print("Yes")
else :
  print("No")

Buggy python submission (verdict: Runtime Error):
num = list( map( int, input().split() ) )
[ a, b, c ] = sort( num )
 
if a + b == c:
  print( "Yes" )
else :
  print( "No" )

Fixed submission:
nums = list( map( int, input().split() ) ) 
nums.sort()

if nums[0]+nums[1]==nums[2]:
  print("Yes")
else :
  print("No")

Buggy python submission (verdict: Runtime Error):
num = list( map( int, input().split() ) )
[ a, b, c ] = sort( list )

if a + b == c:
  print( "Yes" )
else :
  print( "No" )
  

Fixed submission:
nums = list( map( int, input().split() ) ) 
nums.sort()

if nums[0]+nums[1]==nums[2]:
  print("Yes")
else :
  print("No")
Buggy python submission (verdict: Runtime Error):
cols = map( int, input().split() )
cols set = set( cols )

print( len( cols set ) )

Fixed submission:
cols = set( map( int, input().split() ) )
 
print( len( cols ) )

Buggy python submission (verdict: Runtime Error):
cols = list( int, input().split() )

num col = cols.unique();

print( num col )

Fixed submission:
cols = set( map( int, input().split() ) )
 
print( len( cols ) )
Buggy python submission (verdict: Runtime Error):
s = [ str( input() ) for x in range(3) ]
flag = 0
t = 0
while flag == 0
   if len( s[t] ) != 0
      t = s[t][0]
      s[t] = s[t][1:]
   else :
      print( char( ord("A")+ t ) )
   

Fixed submission:
s = [ str( input() ) for x in range(3) ]
flag = 0
t = 0
while flag == 0 :
   if len( s[t] ) != 0 : 
      tnext = s[t][0]
      s[t] = s[t][1:]
      t = ord( tnext ) - ord( "a" )
   else :
      flag = 1
      print( chr( ord("A")+ t ) )
Buggy python submission (verdict: Runtime Error):
[N,K,X,Y] = list( int, input().split() )

if N < K+1 : 
   tot = N * X
else : 
   tot = N * K + ( N - K ) * Y
    
print( tot )


Fixed submission:
N = int( input() )
K = int( input() )
X = int( input() )
Y = int( input() )
 
if N < K + 1 :
   tot = N * X
else : 
   tot = K * X + ( N - K ) * Y
  
print( tot )
Buggy python submission (verdict: Runtime Error):
a = input()

sol = a * (a + 1) / 2

print( sol )

Fixed submission:
a = int( input() )

sol = a * ( a + 1 ) // 2 

print( sol )
Buggy python submission (verdict: Runtime Error):
in = list(map(int,input().split()))

in.sort()

if in=[5,5,7] : 
  print( 'Yes' )
else : 
  print( 'No' )  

Fixed submission:
a = list(map(int, input().split()))

a.sort()

if a == [5,5,7] : 
  print( "YES" )
else :
  print( "NO" )

Buggy python submission (verdict: Runtime Error):
number1 = input("First number: ") 
number2 = input("\nSecond number: ") 
number3 = input("\nSecond number: ") 
  
if ( (number1==5&number1==7&number1==5) |
     (number1==7&number1==5&number1==5) |
     (number1==5&number1==5&number1==7) ) : 
    print("Yes") 
else: 
    print("No" ) 

Fixed submission:
a = list(map(int, input().split()))

a.sort()

if a == [5,5,7] : 
  print( "YES" )
else :
  print( "NO" )
Buggy python submission (verdict: Time Limit Exceeded):
import collections

N = int(input())

S_list = []

for i in range(N):
    tmp = str(input())
    S_list.append(tmp)

c = collections.Counter(S_list)

appear = max(list(c.values()))

keys = [k for k, v in c.items() if v == appear]

for i in range(len(keys)):
    print(sorted(keys)[i])


Fixed submission:
import collections

N = int(input())

S_list = []

for i in range(N):
    tmp = str(input())
    S_list.append(tmp)

c = collections.Counter(S_list)

appear = max(list(c.values()))

keys = [k for k, v in c.items() if v == appear]

keys_sorted = sorted(keys)

for i in range(len(keys)):
    print(keys_sorted[i])
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np

N = int(input())
P = list(map(int, input().split()))

value = np.array(P)

ac = [v for i, v in enumerate(P) if v == np.minimum.accumulate(P)[i]]

print(len(ac))


Fixed submission:
N = int(input())
P = list(map(int, input().split()))

value = 10 ** 9
ans = 0
for v in P:
    if v < value:
        ans += 1
        value = v
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
P = list(map(int, input().split()))

index = [i for i in range(N)]

dict_value = {key: val for key, val in zip(index, P)}
ac = [dict_value[i] for i in range(N) if dict_value[i] <= min([v for k, v in dict_value.items() if k <= i])]

print(len(ac))


Fixed submission:
N = int(input())
P = list(map(int, input().split()))

value = 10 ** 9
ans = 0
for v in P:
    if v < value:
        ans += 1
        value = v
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
P = list(map(int, input().split()))

index = [i for i in range(N)]

dict_value = {key: val for key, val in zip(index, P)}

ac = [dict_value[i] for i in range(N) if dict_value[i] <= min([v for k, v in dict_value.items() if k <= i])]

print(len(ac))


Fixed submission:
N = int(input())
P = list(map(int, input().split()))

value = 10 ** 9
ans = 0
for v in P:
    if v < value:
        ans += 1
        value = v
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
P = list(map(int, input().split()))
 
value = 1
 
ac = [P[i] for i in range(1, N) if P[i] <= min(P[:i])]
 
value += len(ac)
 
print(value)

Fixed submission:
N = int(input())
P = list(map(int, input().split()))

value = 10 ** 9
ans = 0
for v in P:
    if v < value:
        ans += 1
        value = v
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
P = list(map(int, input().split()))

value = 1

ac = [P[i] for i in range(1, N) if P[i] <= min(P[:i])]

value += len(ac)

print(value)


Fixed submission:
N = int(input())
P = list(map(int, input().split()))

value = 10 ** 9
ans = 0
for v in P:
    if v < value:
        ans += 1
        value = v
print(ans)
Buggy python submission (verdict: Runtime Error):
A, B, X = map(int, input().split())

low = 0
high = 10 ** 10

for i in range(10 ** 9):

    if high - low == 1:
        if A * high + B * len(str(high)) <= X:
            print(high)
            break
        else:
            print(low)
            break

    if (high - low) % 2 == 0:
        N = (high - low) // 2 + low
        tmp = A * N + B * len(str(N))

        if tmp < X:
            low = N
        elif tmp > X:
            high = N
        elif tmp == X:
            print(N)
            break

    else:
        N = (high - low) / 2 + low
        floor = int(N)
        ceil = floor + 1

        tmp_floor = A * floor + B * len(str(floor))
        tmp_ceil = A * ceil + B * len(str(ceil))

        if tmp_floor < tmp_ceil < X:
            low = ceil
        elif X < tmp_floor < tmp_ceil:
            high = floor
        elif tmp_floor < X < tmp_ceil:
            low = floor
            high = ceil
        elif X == tmp_floor:
            print(N)
            break
        elif X == tmp_ceil:
            print(N)
            break



Fixed submission:
S = str(input())

x = 0

if S == "MON":
    x += 6
elif S == "TUE":
    x += 5
elif S == "WED":
    x += 4
elif S == "THU":
    x += 3
elif S == "FRI":
    x += 2
elif S == "SAT":
    x += 1
elif S == "SUN":
    x += 7

print(x)
Buggy python submission (verdict: Time Limit Exceeded):
N, K = map(int, input().split())
h_array = list(map(int, input().split()))

dp = [10 ** 5 for i in range(N)]

for i in range(N):
    if i == 0:
        dp[0] = 0
    elif 0 < i <= K:
        tmp = [dp[i - (j + 1)] + abs(h_array[i] - h_array[i - (j + 1)]) for j in range(i)]
        dp[i] = min(tmp)
    elif K < i:
        tmp = [dp[i - (j + 1)] + abs(h_array[i] - h_array[i - (j + 1)]) for j in range(K)]
        dp[i] = min(tmp)
print(dp[N - 1])


Fixed submission:
N, K = map(int, input().split())
h_array = list(map(int, input().split()))

dp = [10 ** 5 for i in range(N)]

for i in range(N):
    if i == 0:
        dp[0] = 0
    elif 0 < i <= K:
        tmp = [dp[i - (j + 1)] + abs(h_array[i] - h_array[i - (j + 1)]) for j in range(i)]
        dp[i] = min(tmp)
    elif K < i:
        tmp = [dp[i - (j + 1)] + abs(h_array[i] - h_array[i - (j + 1)]) for j in range(K)]
        dp[i] = min(tmp)
print(dp[N - 1])
Buggy python submission (verdict: Time Limit Exceeded):
h, w = map(int, input().split())
s = [input() for i in range(h)]
isCase = True
count = 1

while (count != 0):
    count = 0
    for i in range(h):
        for j in range(w):
            count = s[i][j].count('#')
            if (s[i][j] == '#'):
                s[i][j].replace('#', '.')
                if (s[max(i-1,0)][j] == '#'):
                    s[max(i-1,0)][j].replace('#', '.')
                elif (s[i][max(j-1,0)] == '#'):
                    s[i][max(j-1,0)].replace('#', '.')
                elif (s[i][min(j+1,w-1)] == '#'):
                    s[i][min(j+1,w-1)].replace('#', '.')
                elif (s[min(i+1,h-1)][j] == '#'):
                    s[min(i+1,h-1)][j].replace('#', '.')
                else:
                    isCase = False
                    break
    if (isCase == False):
        break

if (isCase):
    print('Yes')
else:
    print('No')

Fixed submission:
h, w = map(int, input().split())
s = [list(map(str, input())) for i in range(h)]
isCase = True
count = 1

def isBlack(i, j, h, w):
    if ((i-1>0 and s[max(i-1,0)][j] == 'B') or (j-1>0 and s[i][max(j-1,0)] == 'B') or (j+1<w-1 and s[i][min(j+1,w-1)] == 'B') or (i+1<h-1 and s[min(i+1,h-1)][j] == 'B')):
        return True
    else:
        return False

while (count != 0 and isCase):
    count = 0
    for i in range(h):
        for j in range(w):
            if (s[i][j] == '#'):
                s[i][j] = 'B'
                count += 1
                if (s[max(i-1,0)][j] == '#'): #上
                    s[max(i-1,0)][j] = 'B'
                elif (s[i][max(j-1,0)] == '#'): #左
                    s[i][max(j-1,0)] = 'B'
                elif (s[i][min(j+1,w-1)] == '#'): #右
                    s[i][min(j+1,w-1)] = 'B'
                elif (s[min(i+1,h-1)][j] == '#'): #下
                    s[min(i+1,h-1)][j] = "B"
                elif (isBlack(i, j, h ,w)):
                    pass
                else:
                    isCase = False
                    break
        if (isCase == False):
            break

if (isCase):
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
N,M=map(int,input().split())
cards=[1]*N

for i in range(M):
    l,r=map(int,input().split())
    if l!=1:
        cards[:l-1]=[0]*(l-1)
    if r!=N:
        cards[r:]=[0]*(N-r)
    
print(sum(cards))

Fixed submission:
N,M=map(int,input().split())
cards_l=1
cards_r=N


for i in range(M):
    l,r=map(int,input().split())
    cards_l=max(cards_l,l)
    cards_r=min(cards_r,r)
    #print(r,cards_r)
print(max(0,cards_r-cards_l+1))
Buggy python submission (verdict: Runtime Error):
S=input()
judge=''
L=len(S)
for index in range(L):
    moji=S[index]
    if (moji=='A') or (moji=='G') or (moji=='T') or (moji=='C'):
        judge+='X'
    else:
        judge+='W'
#print(judge)
num_keeper=[]
num=0
for index in range(L):
    J=judge[index]
    if index==0 and J=='X':
        num=1
    elif J=='W':
        num_keeper.append(num)
        num=0
    else:
        num+=1
    #print(num)
print(max(num_keeper))

Fixed submission:
S=input()
judge=''
L=len(S)
for index in range(L):
    moji=S[index]
    if (moji=='A') or (moji=='G') or (moji=='T') or (moji=='C'):
        judge+='X'
    else:
        judge+='W'
#print(judge)
num_keeper=[]
num=0
for index in range(L):
    J=judge[index]
    if (index==0) and (J=='X'):
        num=1
    elif J=='W':
        num_keeper.append(num)
        num=0
    elif (index==L-1) and (J=='X'):
        num+=1
        num_keeper.append(num)
    else:
        num+=1
if len(num_keeper)==0:
    num_keeper.append(L)
print(max(num_keeper))
Buggy python submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
yakusuu_array=[]
if a==b:
    max_gcd=a
else:
    for l in  reversed(range(min(a,b))):
        if max(a,b)%l==0:
            max_gcd=l
            break        
if k==1:
    print(max_gcd)
else:
    for i in range(1,max_gcd):
        if max_gcd % i == 0:
            yakusuu_array.append(i)

    print(yakusuu_array[-(k-1)])

Fixed submission:
a,b,k=map(int,input().split())
yakusuu_array=[]
if a==b:
    max_gcd=a
else:
    for l in  reversed(range(min(a,b)+1)):
        if (a%l==0) and (b%l==0):
            max_gcd=l
            break        
if k==1:
    print(max_gcd)
else:
    for i in range(1,max_gcd):
        if max_gcd % i == 0:
            yakusuu_array.append(i)

    #print(max_gcd)
    #print(yakusuu_array)
    print(yakusuu_array[-(k-1)])

Buggy python submission (verdict: Runtime Error):
a,b,k=map(int,input().split())
import math
max_gcd=math.gcd(a, b)
yakusuu_array=[]
if k==1:
    print(max_gcd)
else:
    for i in range(1,max_gcd):
        if max_gcd % i == 0:
            yakusuu_array.append(i)

    print(yakusuu_array[-(k-1)])

Fixed submission:
a,b,k=map(int,input().split())
yakusuu_array=[]
if a==b:
    max_gcd=a
else:
    for l in  reversed(range(min(a,b)+1)):
        if (a%l==0) and (b%l==0):
            max_gcd=l
            break        
if k==1:
    print(max_gcd)
else:
    for i in range(1,max_gcd):
        if max_gcd % i == 0:
            yakusuu_array.append(i)

    #print(max_gcd)
    #print(yakusuu_array)
    print(yakusuu_array[-(k-1)])
Buggy python submission (verdict: Runtime Error):
import re

if re.match("keyence",S) or re.match("^(.*)(keyence)$",S) or re.match("^k(.*)(eyence)$",S) or re.match("^(ke)(.*)(yence)$",S) or re.match("^(key)(.*)(ence)$",S) or re.match("^(keye)(.*)(nce)$",S) or re.match("^(keyen)(.*)(ce)$",S) or re.match("^(keyenc)(.*)(e)$",S)  or re.match("^(keyence)(.*)$",S):
    print("YES")
else:
    print("NO")

Fixed submission:
import re

S=input()

if re.match("keyence",S) or re.match("^(.*)(keyence)$",S) or re.match("^k(.*)(eyence)$",S) or re.match("^(ke)(.*)(yence)$",S) or re.match("^(key)(.*)(ence)$",S) or re.match("^(keye)(.*)(nce)$",S) or re.match("^(keyen)(.*)(ce)$",S) or re.match("^(keyenc)(.*)(e)$",S)  or re.match("^(keyence)(.*)$",S):
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
N,H,W = map(int, input().split())
for i in range(N):
    a.append(list(map(int, input().split())))

num =0
a =[]
for i in range(N):
    if a[i][0]>=H:
        if a[i][1] >= W:
            num +=1
print(num)   

Fixed submission:
a =[]
N,H,W = map(int, input().split())
for i in range(N):
    a.append(list(map(int, input().split())))

num =0
for i in range(N):
    if a[i][0]>=H:
        if a[i][1] >= W:
            num +=1
print(num)

Buggy python submission (verdict: Runtime Error):
N,H,W = map(int, input().split())
for i in range(N):
    a.append(list(map(int, input().split())))

num =0
for i in range(N):
    if a[i][0]>=H:
        if a[i][1] >= W:
            num +=1
print(num)  

Fixed submission:
a =[]
N,H,W = map(int, input().split())
for i in range(N):
    a.append(list(map(int, input().split())))

num =0
for i in range(N):
    if a[i][0]>=H:
        if a[i][1] >= W:
            num +=1
print(num)

Buggy python submission (verdict: Runtime Error):
N,H,W = map(int, raw_input().split())
for i in range(N):
    a.append(list(map(int, input().split())))

num =0
for i in range(N):
    if a[i][0]>=H:
        if a[i][1] >= W:
            num +=1
print(num) 

Fixed submission:
a =[]
N,H,W = map(int, input().split())
for i in range(N):
    a.append(list(map(int, input().split())))

num =0
for i in range(N):
    if a[i][0]>=H:
        if a[i][1] >= W:
            num +=1
print(num)

Buggy python submission (verdict: Runtime Error):
N,H,W = map(int, raw_input().split())
a = []
a = []
for i in range(N):
    a.append(list(map(int, input().split())))

num =0
for i in range(N):
    if a[i][0]>=H:
        if a[i][1] >= W:
            num +=1
print(num)         

Fixed submission:
a =[]
N,H,W = map(int, input().split())
for i in range(N):
    a.append(list(map(int, input().split())))

num =0
for i in range(N):
    if a[i][0]>=H:
        if a[i][1] >= W:
            num +=1
print(num)
Buggy python submission (verdict: Runtime Error):
def gcd(a,b):
    while b!=0:
        a,b=b,a%b
    return(a)

N,X=map(int,input().split())
x_list=list(map(int,input().split()))

#x_list.append(X)
#x_list_new=sorted(x_list)
x_list_new_dif=[abs(x_list_new[i]-X) for i in range(len(x_list_new))]

for i in range(len(x_list_new_dif)):
    if i==0:
        skip=x_list_new_dif[0]
    else:
        skip=gcd(skip,x_list_new_dif[i])
print(skip)

Fixed submission:
def gcd(a,b):
    while b!=0:
        a,b=b,a%b
    return(a)

N,X=map(int,input().split())
x_list=list(map(int,input().split()))

#x_list.append(X)
x_list_new=sorted(x_list)
x_list_new_dif=[abs(x_list_new[i]-X) for i in range(len(x_list_new))]

for i in range(len(x_list_new_dif)):
    if i==0:
        skip=x_list_new_dif[0]
    else:
        skip=gcd(skip,x_list_new_dif[i])
print(skip)
Buggy python submission (verdict: Runtime Error):
N,M=map(int,input())

ans=(1900M+100(N-M))*2^M
print(ans)

Fixed submission:
N,M=list(map(int,input().split()))

ans=(1900*M+100*(N-M))*(2**M)
print(ans)

Buggy python submission (verdict: Runtime Error):
N,M=map(int,input())

ans=1900M+100(N-M)*2^M
print(ans)

Fixed submission:
N,M=list(map(int,input().split()))

ans=(1900*M+100*(N-M))*(2**M)
print(ans)

Buggy python submission (verdict: Runtime Error):
N,M=map(int,input())

ans=1900M+100(N-M)*2^M

Fixed submission:
N,M=list(map(int,input().split()))

ans=(1900*M+100*(N-M))*(2**M)
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b,x = map(int,input().split())

S = a*b
I = x/a

if I > S/2:
  print(math.degrees(math.atan(2*(S-I)/a**2)))
else:
  print(90-math.degrees(math.atan(2*I/b**2)))


Fixed submission:
import math

a,b,x = map(int,input().split())

S = a*b
I = x/a

if I > S/2:
  print(math.degrees(math.atan(2*(S-I)/a**2)))
else:
  print(90-math.degrees(math.atan(2*I/b**2)))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = [int(input()) for n in range(N)]

maxA = max(A)
for n in range(N):
  if A[n] != maxA:
    print(maxA)
  else:
    a = A[n]
    A[n] = 0
    print(max(A))
    A[n] = a

Fixed submission:
N = int(input())
A = [int(input()) for n in range(N)]
 
max_A = max(A)
max_index = A.index(max(A))

A[max_index] = 0
max_A2 = max(A)
A[max_index] = max_A

for n in range(N):
  if A[n] != max_A:
    print(max_A)
  else:
    print(max_A2)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())

A = [int(input()) for n in range(N)]

for n in range(N):
  a = A[n]
  A[n] = 0
  print(max(A))
  A[n] = a

Fixed submission:
N = int(input())
A = [int(input()) for n in range(N)]
 
max_A = max(A)
max_index = A.index(max(A))

A[max_index] = 0
max_A2 = max(A)
A[max_index] = max_A

for n in range(N):
  if A[n] != max_A:
    print(max_A)
  else:
    print(max_A2)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
B = [0]*(N+1)
ans = []
 
for n in range(N):
  i = N-n
  BB = B[::i]
  if (sum(BB))%2 != A[i-1]:
    B[i] = 1
    ans.append(str(i))
  
print(len(x))
print(' '.join(ans))

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
B = [0 for n in range(N+1)]
x = []

for n in range(N):
  i = N-n
  # print(i)
  BB = B[::i]
  if (sum(BB))%2 == A[i-1]:
    B[i] = 0
  else:
    B[i] = 1
    # print(B)
  if B[i] == 1:
    x.append(str(i))
  
if len(x) == 0:
  print(0)
else:
  print(len(x))
  print(' '.join(x))