Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p02759 (python)

Fixed submission:
#A - Duplex Printing
n = int(input())
ans = n // 2
if(n % 2 == 1):
    ans += 1
print(ans)

Buggy submission (verdict: Runtime Error):
#C - Guess The Number
n,m = list(map(int,input().split()))
tmp = []
s = []
c = []
flg = False
counter = 0
ans = 0
tmp = [input() for i in range(m)]
for i in tmp:
    i.split()
    s.append(i[0])
    c.append(i[2])
if(n ==3):
  for j in range(100,1000):
    if(flg == True):
      break
    list_j = list(str(j))
    counter = 0
    for k in s:
        if(list_j[int(k)-1] != c[counter]):
          break
        if(list_j[int(k)-1] == c[counter]):
          counter += 1
          if(counter == len(c)):
            flg = True
            break
    if(flg == True):
      ans = j
      break
if(n ==2):
  for j in range(10,100):
    if(flg == True):
      break
    list_j = list(str(j))
    counter = 0
    for k in s:
        if(list_j[int(k)-1] != c[counter]):
          break
        if(list_j[int(k)-1] == c[counter]):
          counter += 1
          if(counter == len(c)):
            flg = True
            break
    if(flg == True):
      ans = j
      break
if(n ==1):
  for j in range(0,10):
    if(flg == True):
      break
    list_j = list(str(j))
    counter = 0
    for k in s:
        if(list_j[int(k)-1] != c[counter]):
          break
        if(list_j[int(k)-1] == c[counter]):
          counter += 1
          if(counter == len(c)):
            flg = True
            break
    if(flg == True):
      ans = j
      break

if(flg == True):
    print(ans)
else:
    print('-1')
Problem p02773 (python)

Fixed submission:
#C-Poll
import collections
n=int(input())
words = [input() for _ in range(n)]
count = collections.Counter(words)
leng = len(count)
ansallay = []
#抽出用に何回出てればansに出すかを変数に突っ込む
record = count.most_common()[0][1]
ms=count.most_common()
for num in range(leng):
    if(ms[num][1] == record):
        ansallay.append(ms[num][0])
    else:
        break
ansallay.sort()
for word in ansallay:
    print(word)

Buggy submission (verdict: Runtime Error):
#C-Poll
import collections
n=int(input())
words = [input() for _ in range(n)]
count = collections.Counter(words)
leng = len(count)
Flg = True
ansallay = []
for num in range(n-1)
    #もし配列が1種類しかなかった場合はそれだけ足してbreakする
    if(leng == 1):
      ansallay.append(count.most_common()[num][0])
      break
    ansallay.append(count.most_common()[num][0])
    if(count.most_common()[0][1] != count.most_common()[num+1][1]):
        break
    num += 1
    if(num == leng-1):
      if(count.most_common()[0][1] == count.most_common()[num][1]):
        ansallay.append(count.most_common()[num][0])
      break
ansallay.sort()
for word in ansallay:
    print(word)

Buggy submission (verdict: Runtime Error):
#C-Poll
import collections
n=int(input())
num=0
words = [input() for _ in range(n)]
count = collections.Counter(words)
Flg = True
ansallay = []
while Flg:
    ansallay.append(count.most_common()[num][0])
    if(count.most_common()[0][1] != count.most_common()[num+1][1]):
        Flg = False
        break
    num += 1
    if(num == n-1):
      if(count.most_common()[0][1] == count.most_common()[num][1]):
        ansallay.append(count.most_common()[num][0])
      break
ansallay.sort()
for word in ansallay:
    print(word)

Buggy submission (verdict: Runtime Error):
#C-Poll
import collections
n=int(input())
num=0
words = [input() for _ in range(n)]
count = collections.Counter(words)
Flg = True
ansallay = []
while Flg:
    ansallay.append(count.most_common()[num][0])
    if(count.most_common()[num][1] != count.most_common()[num+1][1]):
        Flg = False
    num += 1
ansallay.sort()
for word in ansallay:
    print(word)
Problem p03329 (python)

Fixed submission:
import math

dp = [float('inf') for _ in range(200000)]
withdraw = []

N = int(input())

#引き出し可能な金額の配列にする
withdraw.append(1)

for i in range(20):
    if 100000 >= 6**i:
        withdraw.append(6**i)
    if 100000 >= 9**i:
        withdraw.append(9**i)

withdraw = sorted(list(set(withdraw)))

dp[0] = 0

for i in range(N+1):
    for j in withdraw:
        dp[i+j] = min(dp[i+j],dp[i]+1)
        
print(dp[N])

Buggy submission (verdict: Runtime Error):
import math

dp = [float('inf') for _ in range(110000)]
withdraw = []

N = int(input())

#引き出し可能な金額の配列にする
withdraw.append(1)

for i in range( math.floor(math.log(N,6)) + 1):
    withdraw.append(6**i)

for i in range( math.floor(math.log(N,9)) + 1):
    withdraw.append(9**i)

withdraw = sorted(list(set(withdraw)))

dp[0] = 0

for i in range(N+1):
    for j in withdraw:
        dp[i+j] = min(dp[i+j],dp[i]+1)
        
print(dp[N])
Problem p02933 (python)

Fixed submission:
a = int(input())
s = str(input())
if a >= 3200:
  print(s)
else:
  print('red')

Buggy submission (verdict: Runtime Error):
a = int(input())
s = str(input())
if a >= 3200:
  print(s)
else:
  print 'red'

Buggy submission (verdict: Runtime Error):
a = input()
s = input()
if a >= 3200:
  print s
else:
  print 'red'
Problem p02793 (python)

Fixed submission:
import fractions

N = int(input())
A = list(map(int, input().split(' ')))

lcm = 1
for a in A:
    lcm *= (a // fractions.gcd(lcm, a)) % (10**9 + 7)

for i in range(len(A)):
    A[i] = lcm // A[i]

print(sum(A) % (10**9 + 7))

Buggy submission (verdict: Runtime Error):
import math

N = int(input())
A = list(map(int, input().split(' ')))

lcm = 1
for a in A:
    lcm *= (a // math.gcd(lcm, a)) % (10**9 + 7)

for i in range(len(A)):
    A[i] = lcm // A[i]

print(sum(A) % (10**9 + 7))

Buggy submission (verdict: Runtime Error):
import math

N = int(input())
A = list(map(int, input().split(' ')))

lcm = 1
for a in A:
    lcm *= (a // math.gcd(lcm, a)) % (10**9 + 7)

for i in range(len(A)):
    A[i] = int(lcm / A[i])

print(sum(A) % (10**9 + 7))
Problem p03242 (python)

Fixed submission:
import numpy as np

n = int(input())

ans = 0

if n % 10 == 9:
    ans += 1
else:
    ans += 9
n = int(n/10)


if n % 10 == 9:
    ans += 10
else:
    ans += 90
n = int(n/10)
if n % 10 == 9:
    ans += 100
else:
    ans += 900


print(ans)

Buggy submission (verdict: Runtime Error):
import collections


n = int(input())
v = list(map(int, input().split()))
odd = []
even = []
for i in range(int(n/2)):
    even.append(v[2*i])
    odd.append(v[2*i + 1])
evencount = collections.Counter(even)
oddcount = collections.Counter(odd)


def hoge(i):
    global ans
    try:
        if evencount.most_common()[i][0] == oddcount.most_common()[i][0]:

            if evencount.most_common()[i][1] > oddcount.most_common()[i][1]:
                ans = n - evencount.most_common()[i][1] - oddcount.most_common()[i][1]
                print(ans)
            elif evencount.most_common()[i][1] < oddcount.most_common()[i][1]:
                ans = n - evencount.most_common()[i][1] - oddcount.most_common()[i][1]
                print(ans)
            else:
                if len(evencount) == 1:
                    ans = int(n/2)
                    print(ans)
                else:
                    hoge(i+1)

        else: 
            ans = n - evencount.most_common()[i][1] - oddcount.most_common()[i][1]
            print(ans)
    except IndexError:   
        ans = n - evencount.most_common()[0][1] - oddcount.most_common()[1][1]
        print(ans) 


hoge(0)
Problem p02832 (python)

Fixed submission:
import sys

input = sys.stdin.readline

def main():
    n = int(input()[:-1])
    l = list(map(int, input()[:-1].split(" ")))

    c = 1
    s = 0
    tmp = 0
    while l:
        if tmp >= n:
            break
        if l[tmp] != c :
            s += 1
        else:
            c += 1
        tmp += 1

    res = s
    if s == n:
        res = -1

    print(res)

main()

Buggy submission (verdict: Runtime Error):
import sys

input = sys.stdin.readline


def f(l, c, s, n):
    if not l:
        if s == n:
            return -1
        return s

    if l[0] != c:
        return f(l[1:], c, s + 1, n)
    return f(l[1:], c + 1, s, n)

def main():
    n = int(input()[:-1])
    l = list(map(int, input()[:-1].split(" ")))

    c = 1
    s = 0
    tmp = 0
    while not l:
        if l[tmp] != c :
            s += 1
        else:
            c += 1
        tmp += 1

    res = s
    if s == n:
        res = -1

    print(f(l, 1, 0, n))

main()
Problem p02831 (python)

Fixed submission:
from fractions import gcd

def lcm (x, y):
    return (x * y) // gcd(x, y)

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

print (lcm(a,b))

Buggy submission (verdict: Runtime Error):
import math

def lcm (x, y):
    return (x * y) // math.gcd(x, y)

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

print (lcm(a,b))

Buggy submission (verdict: Runtime Error):
import math

def lcm (x, y):
    return (x * y) // math.gcd(x, y)

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

print (lcm(a,b))
Problem p03011 (python)

Fixed submission:
P, Q, R = map(int, input().split())
abc = P+Q
acb = P+R
cab = R+Q

ans = 10000
ans = min(ans, abc)
ans = min(ans, acb)
ans = min(ans, cab)
print(ans)

Buggy submission (verdict: Runtime Error):
P, Q, R = map(int, input().split())
abc = P+Q
acb = P+R
cab = R+Q

ans = 10000
ans = min(ans, abc)
ans = min(ans, acb)
ans = min(ans, dca)
print(ans)
Problem p02779 (python)

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

b = set(a)

if len(a) == len(b):
  print('YES')
else:
  print('NO')

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

b = [0] * max(a)
d = 'YES'

for i in range(n):
  b[a[i]-1] += 1

if max(b) > 1:
  d = 'NO'

print(d)
Problem p02835 (python)

Fixed submission:
a1, a2, a3 = map(int, input().split())

if (a1 + a2 + a3 <= 21):
    print('win')
else:
    print('bust')

Buggy submission (verdict: Runtime Error):
a1, a2, a3 = int(input().split())

if (a1 + a2 + a3 <= 21):
    print('win')
else:
    print('bust')
Problem p02915 (python)

Fixed submission:
N = int(input())

print(N**3)

Buggy submission (verdict: Runtime Error):
i = int(input())

print(N**3)
Problem p03307 (python)

Fixed submission:
n = int(input())
mod = n%2
if mod==0:
    dst = n
else:
    dst = n*2

print(dst)

Buggy submission (verdict: Runtime Error):
n = int(input())
list = [int(i) for i in input().split()]

n_max = max(list)
n_min = min(list)

print(n_max - n_min)
Problem p02759 (python)

Fixed submission:
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
  
n = I()

print(n // 2 + n % 2)

Buggy submission (verdict: Runtime Error):
N = int(raw_input())

print(N // 2 + N % 2)
Problem p02793 (python)

Fixed submission:
import fractions
from functools import reduce

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)
def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)
  
n = int(input())
a = list(map(int, input().split()))

saikou = lcm_list(a)
ans = 0

for i in a:
  b = saikou // i
  ans += b
  
print(int(ans) % 1000000007)

Buggy submission (verdict: Runtime Error):
import fractions
from functools import reduce
import math

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)
def lcm(*numbers):
    return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)
  
n = int(input())
a = list(map(int, input().split()))

saikou = lcm_list(a)
ans = 0

for i in a:
  b = saikou / i
  ans += b
  
print(int(ans) % 1000000007)
Problem p02759 (python)

Fixed submission:
N = int(input())

if N % 2 == 0:
    print("{}".format(int(N / 2)))
else:
    print("{}".format(int((N + 1) / 2)))

Buggy submission (verdict: Runtime Error):
import sys
 
N,M = map(int,input().split())
s = []
c = []
if M >= 1:
    for i in range (M):
        s,c = map(int,input().split())
        s.append(s)
        c.append(c)
    
    for i in range(M):
        if s[i] == 1 and c[i] == 0:
            print("-1")
            sys.exit()
a = zip(s, c)
a.sort()
s, c = zip(*a)
s = list(s)
c = list(c)
    if M >= 2:
        for i in range(1,M):
            if s[i - 1] == s[i] and c[i - 1] != c[i]:
                print("-1")
                sys.exit()
        if s[M - 1] == s[M] and c[M - 1] != c[M]:
            print("-1")
            sys.exit()
    for i in range(M):
        cc = [0] * N
        cc[s[i] - 1] = c[i]
    for i in range(min(s[i])):
        cc[i] = 1
    print(cc)
if M == 0:
    cc = [0] * N
    cc[0] = 1
    print(cc)
Problem p02860 (python)

Fixed submission:
N = int(input())
S = input()
ans = "No"
if N % 2 == 0:
    x = N//2
    if S[:x] == S[x:]:
        ans = "Yes"

print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
S = input()
ans = "No"
if N % 2 == 0:
    x = N//2
    if s[:x] == s[x:]:
        ans = "Yes"

print(ans)
Problem p02880 (python)

Fixed submission:
N = int(input())
ans = "No"
for i in range(1, 10):
    for j in range(1, 10):
        if N == i*j:
            ans = "Yes"
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
ans = "No"
for i in range(N):
    if N % i == 0:
        if int(N / i) == N // i and len(str(N // i)) == 1:
            ans = "Yes"

print(ans)
Problem p02881 (python)

Fixed submission:
N = int(input())

for i in range(int(N**0.5), 0, -1):
    if N % i == 0:
        x = i
        y = N // i
        break
print(x+y-2)

Buggy submission (verdict: Runtime Error):
for i in range(int(N**0.5), 0, -1):
    if N % i == 0:
        x = i
        y = N // i
        break
print(x+y-2)
Problem p02933 (python)

Fixed submission:
a = int(input())
s = input()
if a>= 3200:
  print(s)
else:
  print("red")

Buggy submission (verdict: Runtime Error):
N,Q = map(int, input().split())
abL = [[int(x) for x in input().split()] for _ in range(N-1)]
tree = [[0]*(N+1) for _ in range(N+1)]
graph = [[] for _ in range(N+1)]
for a,b in abL:
    graph[a].append(b)
 
for a in range(N, 0, -1):
    incL = graph[a]
    for b in incL:
        for i in range(a):
            if a in graph[i]:
                graph[i].append(b)
    graph[a].append(a)
 
pxL = [[int(x) for x in input().split()] for _ in range(Q)]
 
for p,x in pxL:
    tmpL = graph[p]
    for b in tmpL:
        tree[p][b] += x
 
for i in range(1, N+1):
    sum_ = 0
    for j in range(1, N+1):
        sum_ += tree[j][i]
    print(sum_, end=" ")
Problem p02990 (python)

Fixed submission:
import math
n, k = map(int, input().split())
mod = 10**9+7
for i in range(1, k+1):
    if i > n-k+1:
        print(0)
        continue
    count = 0
    i_pos_count = math.factorial(n-k+1) \
                   // (math.factorial(n-k-i+1) * math.factorial(i))
    split_count = math.factorial(k-1) \
                  // (math.factorial(k-i) * math.factorial(i-1))
    count = i_pos_count * split_count
    print(count % mod)

Buggy submission (verdict: Runtime Error):
import math
n, k = map(int, input().split())
mod = 10**9+7
for i in range(1, k+1):
    count = 0
    i_poss_count = math.factorial(n-k+1) \
                   // (math.factorial(n-k-i+1) * math.factorial(i))
    split_count = math.factorial(k-1) \
                  // (math.factorial(k-i) * math.factorial(i-1))
    count = i_poss_count * split_count
    print(count % mod)
Problem p03127 (python)

Fixed submission:
import fractions

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

minA = A[0]

for i in A:
    minA = fractions.gcd(minA, i) 

print(minA)

Buggy submission (verdict: Runtime Error):
N = int(input())
A = map(int, input().split())

A_set = set(A)
if len(A_set) == 1:
    print(A_set[0])
else:
    A = list(A_set)
    A = sorted(A)
    if (A[0] % 2 == 0) and (A[1] % 2 ==0):
        print("2")
    else:
        print("1")
Problem p03207 (python)

Fixed submission:
n = int(input())
pL = [int(input()) for i in range(n)]
print(int(sum(pL)-(max(pL)/2)))

Buggy submission (verdict: Runtime Error):
n = int(input())
pL = [input() for i in range(n)]
print(int(sum(pL)-(max(pL)/2)))

Buggy submission (verdict: Runtime Error):
n = int(input())
pL = [input() for i in range(n)]
print(int(sum(pL)-(max(pL)/2))

Buggy submission (verdict: Runtime Error):
n = int(input())
pL = [input() for i in range(n)]
print(sum(pL)-max(pL)/2)
Problem p03221 (python)

Fixed submission:
import bisect

n, m = map(int, input().split())
data = [list(map(int, input().split())) for _ in range(m)]  # 市iの順番を保つ
py_list = [[] for _ in range(n)]  # 市iの(属する県, 誕生年)

for p, y in data:
    py_list[p-1].append(y)

for i in range(n):
    py_list[i].sort()

for p, y in data:
    pos = bisect.bisect_left(py_list[p-1], y) + 1
    print("%06d%06d" % (p, pos))

Buggy submission (verdict: Runtime Error):
import bisect

n, m = map(int, input().split())
data = [list(map(int, input().split())) for _ in range(m)]  # 市iの順番を保つ
py_list = [[] for _ in range(m)]  # 市iの(属する県, 誕生年)

for p, y in data:
    py_list[p-1].append(y)

for i in range(n):
    py_list[i].sort()

for p, y in data:
    pos = bisect.bisect_left(py_list[p-1], y) + 1
    print("%06d%06d" % (p, pos))

Buggy submission (verdict: Runtime Error):
import bisect

n, m = map(int, input().split())
data = [list(map(int, input().split())) for _ in range(m)]  # 市iの順番を保つ
py_list = [[] for _ in range(m)]  # 市iの(属する県, 誕生年)

for p, y in data:
    py_list[p-1].append(y)

for i in range(m):
    py_list[i].sort()

for p, y in data:
    pos = bisect.bisect_left(py_list[p-1], y) + 1
    print("%06d%06d" % (p, pos))
Problem p02777 (python)

Fixed submission:
#!/usr/bin/env python3
import sys


def solve(S: str, T: str, A: int, B: int, U: str):
    dictionary = {S: A, T: B}
    dictionary[U] = dictionary[U] - 1
    print("{0} {1}".format(dictionary[S], dictionary[T]))
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    T = next(tokens)  # type: str
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    U = next(tokens)  # type: str
    solve(S, T, A, B, U)


if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys


def solve(S: str, T: str, A: int, B: int, U: str):
    dictionary = {S: A, T: B}
    dictionary[U] = dictionary[U] - 1
    print(f"{dictionary[S]} {dictionary[T]}")
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    T = next(tokens)  # type: str
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    U = next(tokens)  # type: str
    solve(S, T, A, B, U)


if __name__ == "__main__":
    main()
Problem p02881 (python)

Fixed submission:
#!/usr/bin/env python3
import sys
import numpy as np


def solve(N: int):
    result_list = []
    for i in range(1, int(np.sqrt(N)) + 1):
        if N % i == 0:
            result_list.append(i - 1 + N // i - 1)
        else:
            pass
    print(min(result_list))
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)


if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys
from sympy.ntheory import factorint
import numpy as np


def solve(N: int):

    fct = factorint(N)

    fct_list = []
    for key, item in zip(fct.keys(), fct.values()):
        fct_list += [key] * item

    result = 1e12

    if len(fct_list) == 2:
        x = fct_list[0]
        y = fct_list[1]
        print(x - 1 + y - 1)
    elif len(fct_list) == 1:
        x = fct_list[0]
        y = 1
        print(x - 1 + y - 1)

    else:
        for i in range(1, len(fct_list) - 1):

            x = np.prod(fct_list[: i + 1])
            y = np.prod(fct_list[i + 1 :])

            result = min(result, x - 1 + y - 1)
        print(result)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)


if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys
import sympy
import numpy as np


def solve(N: int):

    fct = sympy.factorint(N)

    fct_list = []
    for key, item in zip(fct.keys(), fct.values()):
        fct_list += [key] * item

    result = 1e12

    if len(fct_list) == 2:
        x = fct_list[0]
        y = fct_list[1]
        print(x - 1 + y - 1)
    elif len(fct_list) == 1:
        x = fct_list[0]
        y = 1
        print(x - 1 + y - 1)

    else:
        for i in range(1, len(fct_list) - 1):

            x = np.prod(fct_list[: i + 1])
            y = np.prod(fct_list[i + 1 :])

            result = min(result, x - 1 + y - 1)
        print(result)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)


if __name__ == "__main__":
    main()
Problem p02897 (python)

Fixed submission:
#!/usr/bin/env python3
import sys


def solve(N: int):
    count = 0
    for i in range(1, N + 1):
        if i % 2 != 0:
            count += 1
        else:
            pass

    result = count / N

    print(result)

    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)


if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys


def solve(N: int, A: "List[int]"):
    result_list = []
    for i in range(1, N + 1):
        result_list.append(str(A.index(i) + 1))
    print(" ".join(result_list))
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = [int(next(tokens)) for _ in range(N)]  # type: "List[int]"
    solve(N, A)


if __name__ == "__main__":
    main()
Problem p03042 (python)

Fixed submission:
#!/usr/bin/env python3
import sys


def solve(S: int):

    if 1 <= int(S[2:]) <= 12:
        if 1 <= int(S[:2]) <= 12:
            print("AMBIGUOUS")
        else:
            print("YYMM")
    else:
        if 1 <= int(S[:2]) <= 12:
            print("MMYY")
        else:
            print("NA")

    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    S = str(next(tokens))  # type: int
    solve(S)


if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys


def solve(S: int):

    S = str(S)

    if int(S[:2]) > 12 and 1 <= int(S[2:]) <= 12:
        print("YYMM")
    elif 1 <= int(S[:2]) <= 12 and int(S[2:]) > 12:
        print("MMYY")
    elif 1 <= int(S[:2]) <= 12 and 1 <= int(S[2:]) <= 12:
        print("AMBIGUOUS")
    else:
        print("NA")

    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    S = int(next(tokens))  # type: int
    solve(S)


if __name__ == "__main__":
    main()