Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
import functools

def solve():
    n = read()
    result = think(n)
    write(result)


def read():
    return read_int(1)[0]


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(n):
    p = 10 ** 9 + 7
    return mod_fact(n, p)


def mod_fact(n, p):
    sequence = [i + 1 for i in range(n)]
    return functools.reduce(lambda x, y: x * y, sequence) % p


def write(result):
   print(result)


if __name__ == '__main__':
    solve()

Fixed submission:
def solve():
    n = read()
    result = think(n)
    write(result)


def read():
    return read_int(1)[0]


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(n):
    p = 10 ** 9 + 7
    return mod_fact(n, p)

def mod_fact(n, p):
    if n == 1:
        return 1 % p

    result = 1 % p
    for i in range(n):
        r_1 = result % p
        r_2 = (i + 1) % p
        result = (r_1 * r_2) % p
    return result

def write(result):
   print(result)


if __name__ == '__main__':
    solve()
Buggy python submission (verdict: Time Limit Exceeded):
import re
import doctest


class IO_for_Contest(object):
    @staticmethod
    def my_input():
        # return raw_input()
        return input()

    @staticmethod
    def read_from_input():
        n = IO_for_Contest.read_int()
        t = []
        a = []
        for i in range(n):
            buf = IO_for_Contest.read_n_int(2)
            t.append(buf[0])
            a.append(buf[1])
        return t, a

    @staticmethod
    def read_line():
        return IO_for_Contest.my_input().strip()

    @staticmethod
    def read_int():
        return int(IO_for_Contest.my_input().strip())

    @staticmethod
    def read_n_int(n):
        return list(map(
                    int,
                    re.split('\s+', IO_for_Contest.my_input().strip())))[: n]


def solve():
    buf = IO_for_Contest.read_from_input()
    t = buf[0]
    a = buf[1]
    min_number_of_vote = get_min_number_of_vote(t, a)
    print(sum(min_number_of_vote))


def get_min_number_of_vote(t, a):
    vote_t = 1
    vote_a = 1
    for i in range(len(t)):
        buf = get_estimate_of_next_vote(vote_t, vote_a, t[i], a[i])
        # print(buf)
        vote_t = buf[0]
        vote_a = buf[1]
    return vote_t, vote_a


def get_estimate_of_next_vote(vote_t, vote_a, ratio_t, ratio_a):
    # simple case
    if vote_t % ratio_t == 0 and vote_a % ratio_a == 0:
        if vote_t // ratio_t == vote_a // ratio_a:
            return vote_t, vote_a
    offset = 0
    while True:
        new_vote_t = vote_t + offset
        if new_vote_t % ratio_t == 0:
            if (new_vote_t // ratio_t) * ratio_a >= vote_a:
                return new_vote_t, (new_vote_t // ratio_t) * ratio_a
            else:
                offset += ratio_t
        else:
            offset += 1

if __name__ == '__main__':
    # doctest.testmod()
    solve()


Fixed submission:
def solve():
    list_t_and_a = read()
    result = think(list_t_and_a)
    write(result)


def read():
    n = read_int(1)[0]
    list_t_and_a = []
    for _ in range(n):
        list_t_and_a.append(read_int(2))
    return list_t_and_a


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(list_t_and_a):
    n = len(list_t_and_a)
    vote_t, vote_a = list_t_and_a[0][0], list_t_and_a[0][1]
    for i in range(1, n):
        ti, ai = list_t_and_a[i][0], list_t_and_a[i][1]
        ratio_t = vote_t // ti
        if vote_t % ti != 0:
            ratio_t += 1
        ratio_a = vote_a // ai
        if vote_a % ai != 0:
            ratio_a += 1
        ratio = max(ratio_t, ratio_a)
        vote_t = ratio * ti
        vote_a = ratio * ai
    return vote_t + vote_a


def expected_lower_value_than_actual(actual, expected):
    return actual > expected


def write(result):
    print(result)


if __name__ == '__main__':
    solve()
Buggy python submission (verdict: Time Limit Exceeded):
import re
# import doctest


class IO_for_Contest(object):
    @staticmethod
    def my_input():
        # return raw_input()
        return input()

    @staticmethod
    def read_from_input():
        pass

    @staticmethod
    def read_line():
        return IO_for_Contest.my_input().strip()

    @staticmethod
    def read_int():
        return int(IO_for_Contest.my_input().strip())

    @staticmethod
    def read_n_int(n):
        return list(map(
                    int,
                    re.split('\s+', IO_for_Contest.my_input().strip())))[: n]


def solve():
    buf = IO_for_Contest.read_n_int(3)
    a = buf[0]
    b = buf[1]
    c = buf[2]
    print(min_diff(a, b, c,))


def min_diff(a, b, c):
    diff = a * b * c
    for x in range(c):
        mine = a * b * (x + 1)
        other = a * b * (c - x - 1)
        diff = min(diff, abs(mine - other))
    for x in range(b):
        mine = a * (x + 1) * c
        other = a * (b - x - 1) * c
        diff = min(diff, abs(mine - other))
    for x in range(a):
        mine = (x + 1) * b * c
        other = (a - x - 1) * b * c
        diff = min(diff, abs(mine - other))
    return diff


if __name__ == '__main__':
    # doctest.testmod()
    solve()

Fixed submission:
import re
# import doctest


class IO_for_Contest(object):
    @staticmethod
    def my_input():
        # return raw_input()
        return input()

    @staticmethod
    def read_from_input():
        pass

    @staticmethod
    def read_line():
        return IO_for_Contest.my_input().strip()

    @staticmethod
    def read_int():
        return int(IO_for_Contest.my_input().strip())

    @staticmethod
    def read_n_int(n):
        return list(map(
                    int,
                    re.split('\s+', IO_for_Contest.my_input().strip())))[: n]


def solve():
    buf = IO_for_Contest.read_n_int(3)
    a = buf[0]
    b = buf[1]
    c = buf[2]
    print(min_diff(a, b, c,))


def min_diff(a, b, c):
    if a % 2 == 0 or b % 2 == 0 or c % 2 == 0:
        return 0
    diff = a * b * c
    diff = min(diff, abs(a * b * (c // 2) - a * b * (c - (c // 2))))
    diff = min(diff, abs(a * (b // 2) * c - a * (b - (b // 2)) * c))
    diff = min(diff, abs((a // 2) * b * c - (a - (a // 2)) * b * c))
    return diff

if __name__ == '__main__':
    # doctest.testmod()
    solve()
Buggy python submission (verdict: Runtime Error):
s =str(input())

if len(s) == 2:
    if s[0]==s[1]:
        sIndex = 1
        eIndex = 2
    else:
        sIndex = -1
        eIndex = -1
elif len(s)>2:
    sIndex=-1
    eIndex=-1
    for i in range(len(s)-2):
        par_str = s[i:i+3]
        if (par_str.count(par_str[0])>=2) | (par_str.count(par_str[1])>=2):
            sIndex = i + 1
            eIndex = i + 3
            break
    
ans = str(sIndex)+' '+str(eIndex)
print(ans)

Fixed submission:
n = int(input())
sum = 0
for i in range(n+1):
    sum = sum + i
    
print(sum)

Buggy python submission (verdict: Runtime Error):
import numpy as np
 
N =int(input())
 
a = np.array([int(i) for i in input().split()])
 
a_min = min(a)
a_max =max(a)
ans = 0
 
for i in range(a_min,a_max+1):
    diff_a = a - i
    dummy = int(sum([i**2 for i in diff_a]))
    if i == a_min:
        ans = dummy
    elif i>a_min:
        if ans > dummy:
            ans = dummy
 
print(ans)

Fixed submission:
n = int(input())
sum = 0
for i in range(n+1):
    sum = sum + i
    
print(sum)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
ans = 10**9
for ai in range(min(a),max(a)+1):
    w = 0
    for aj in a:
        w += (ai-aj)**2
    ans = min(w,ans)
print(ans)

Fixed submission:
n = int(input())
sum = 0
for i in range(n+1):
    sum = sum + i
    
print(sum)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
ans = 10**9
for ai in range(min(a),max(a)+1):
    w = 0
    for aj in ai:
        w += (ai-aj)**2
    ans = min(w,ans)
print(ans)

Fixed submission:
n = int(input())
sum = 0
for i in range(n+1):
    sum = sum + i
    
print(sum)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split().strip()))
ans =10**9
for ai in range(min(a),max(a)+1):
    w = 0
    for aj in a:
        w += (ai-aj)**2
    ans = min(w,ans)
print(ans)

Fixed submission:
n = int(input())
sum = 0
for i in range(n+1):
    sum = sum + i
    
print(sum)

Buggy python submission (verdict: Runtime Error):

n = int(input())
a = list(map(int,input().split().strip()))
ans =10**9
for ai in range(min(a),max(a)):
    w = 0
    for aj in ai:
        w += (ai-aj)**2
    ans = min(w,ans)
print(ans)

Fixed submission:
n = int(input())
sum = 0
for i in range(n+1):
    sum = sum + i
    
print(sum)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split().strip()))
ans =10**9
for ai in range(min(a),max(a)):
    w = 0
    for aj in a:
        w += (ai-aj)**2
    ans = min(w,ans)
print(ans)

Fixed submission:
n = int(input())
sum = 0
for i in range(n+1):
    sum = sum + i
    
print(sum)
Buggy python submission (verdict: Runtime Error):
s =str(input())

if len(s) == 2:
    if s[0]==s[1]:
        sIndex = 1
        eIndex = 2
    else:
        sIndex = -1
        eIndex = -1
elif len(s)>2:
    sIndex=-1
    eIndex=-1
    for i in range(len(s)):
        par_str = s[i:i+3]
        if (par_str.count(par_str[0])>=2) | (par_str.count(par_str[1])>=2):
            sIndex = i + 1
            eIndex = i + 3
            break
    
ans = str(sIndex)+' '+str(eIndex)
print(ans)

Fixed submission:
s =str(input())

if len(s) == 2:
    if s[0]==s[1]:
        sIndex = 1
        eIndex = 2
    else:
        sIndex = -1
        eIndex = -1
elif len(s)>2:
    sIndex=-1
    eIndex=-1
    for i in range(len(s)-2):
        par_str = s[i:i+3]
        if (par_str.count(par_str[0])>=2) | (par_str.count(par_str[1])>=2):
            sIndex = i + 1
            eIndex = i + 3
            break
    
ans = str(sIndex)+' '+str(eIndex)
print(ans)
Buggy python submission (verdict: Runtime Error):
n,l = map(int ,input().strip().split())
s = [""]*n
for i in range(n):
    s[i]=input()
s.sort()
sol = ""
for i in s:
    sol += i
print(sol)

Fixed submission:
a= list(map(int,input().strip().split()))
cnt5 = 0
cnt7 = 0
for i in range(3):
    if a[i] == 5:
        cnt5 += 1
    if a[i] == 7:
        cnt7 += 1

if cnt5==2 and cnt7 ==1:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
n,l = map(int ,input())
s = [""]*n
for i in range(n):
    s[i]=input()
s.sort()
sol = ""
for i in s:
    sol +=i
print(sol)

Fixed submission:
a= list(map(int,input().strip().split()))
cnt5 = 0
cnt7 = 0
for i in range(3):
    if a[i] == 5:
        cnt5 += 1
    if a[i] == 7:
        cnt7 += 1

if cnt5==2 and cnt7 ==1:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
import math
import sys
from collections import defaultdict
input = sys.stdin.readline

############ ---- Input Functions ---- ############
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))
    
n = inp()
A = invr()

map = defaultdict(int)
for i, boss in enumerate(A, 2):
	map[boss] += 1 
	
for i in range(n):
	print map[i+1]


Fixed submission:
import math
import sys
from collections import defaultdict
input = sys.stdin.readline

############ ---- Input Functions ---- ############
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))
    
n = inp()
A = invr()

map = defaultdict(int)
for i, boss in enumerate(A, 2):
	map[boss] += 1 
	
for i in range(n):
	print map[i+1]
Buggy python submission (verdict: Time Limit Exceeded):
import math
import sys
from collections import defaultdict
input = sys.stdin.readline

############ ---- Input Functions ---- ############
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))
    
n, k = invr()
#A = invr()

A = [i for i in range(n + 1)]

res = 0
for cLen in range(k, n + 2):
	small = sum(A[:cLen])
	large = sum(A[-cLen:])
	res += large - small + 1

print res

Fixed submission:
import math
import sys
from collections import defaultdict
input = sys.stdin.readline

############ ---- Input Functions ---- ############
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    s = input()
    return(list(s[:len(s) - 1]))
def invr():
    return(map(int,input().split()))
    
n, k = invr()
#A = invr()

A = [i for i in range(n + 1)]

res = 0
small = sum(A[:k])
large = sum(A[-k:])
for cLen in range(k, n + 2):
	# print small, large
	res = (res +  large - small + 1 ) % (10 ** 9 + 7)
	if cLen != n + 1:
		small += A[cLen]
		large += A[-cLen - 1]

print res
Buggy python submission (verdict: Runtime Error):
def resolve():
    a,b = map(int, input().split())
    A = list(map(int, input().split()))
    count = 0

    for c in range(b):
        count += A[c]
    
    print(a - count)
    
 resolve()

Fixed submission:
def resolve():
    a,b = map(int, input().split())
    A = list(map(int, input().split()))
    count = 0

    for c in range(b):
        count += A[c]
    
    result = a - count
    if result < 0:
        print("-1")
    else:
        print(result)
    
resolve()
Buggy python submission (verdict: Runtime Error):
coin = 0
for i in range(0,2):
    if a > b:
        coin += a
        a = a-1
    elif b > a:
        coin += b
        b = b-1
    else:
        coin += a
        a = a-1
print(coin)

Fixed submission:
a,b=map(int,input().split())
coin = 0
for i in range(0,2):
    if a > b:
        coin += a
        a = a-1
    elif b > a:
        coin += b
        b = b-1
    else:
        coin += a
        a = a-1
print(coin)
Buggy python submission (verdict: Runtime Error):
x,a,b = [int(input()) for i in range(3)]
print((x-a)%bå)

Fixed submission:
x,a,b = [int(input()) for i in range(3)]
print((x-a)%b)
Buggy python submission (verdict: Time Limit Exceeded):
import math

def main():
    strA = input()
    listA = strA.split(" ")

    N = int(listA[0])
    K = int(listA[1])

    x = N
    y = 0
    while(1):
        x = math.floor(x/K)

        y = y + 1
        if(x < K and x != 0):
            y = y + 1
            break

    print(y)

if __name__ == '__main__':
    main()


Fixed submission:
import math

def main():
    strA = input()
    listA = strA.split(" ")

    N = int(listA[0])
    K = int(listA[1])

    x = N
    y = 0
    while(1):
        x = math.floor(x/K)

        y = y + 1
        if(x < K):
            if (x != 0):
                y = y + 1
            break

    print(y)

if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
import numpy as np

def calculate_length(int radius):
    return 2.0 * radius * np.pi

if __name__ == "__main__":
    radius = int(input())
    print(calculate_rength(radius))

Fixed submission:
import numpy as np

def calculate_length(radius):
    return 2.0 * radius * np.pi

if __name__ == "__main__":
    radius = int(input())
    print(calculate_length(radius))
Buggy python submission (verdict: Runtime Error):
def is_much_money(num_of_coin, yen):
  if num_of_coin * 500 >= yen:
    return "Yes"
  else:
    return "No"

if __name__ == "__main__":
    num_of_coin, yen = int(input().split())
    judgement = is_much_mony(num_of_coin, yen)
    print(judgement)

Fixed submission:
def is_much_money(num_of_coin, yen):
  if num_of_coin * 500 >= yen:
    return "Yes"
  else:
    return "No"
 
if __name__ == "__main__":
    num_of_coin, yen = input().split()
    judgement = is_much_money(int(num_of_coin), int(yen))
    print(judgement)
Buggy python submission (verdict: Runtime Error):
import math
 
R = int(input())
 
print float(R*2*math.pi())

Fixed submission:
import math

R = int(input())

print (float(R*2*math.pi))

Buggy python submission (verdict: Runtime Error):
import math

R = int(input())

print R*2*math.pi()

Fixed submission:
import math

R = int(input())

print (float(R*2*math.pi))

Buggy python submission (verdict: Runtime Error):
import math

R = input()

print R * 2 *math.pi()

Fixed submission:
import math

R = int(input())

print (float(R*2*math.pi))
Buggy python submission (verdict: Runtime Error):
N, M = int(input().split())
A = input.split()
total = 0
for i in range(A):
    total = total+A[i]

if total <= N:
    print (N - total)
else:
    print ("-1")


Fixed submission:
import math

n, m = map(int, input().split())
a = list(map(int, input().split()))

if (n-sum(a)) < 0:
    print(-1)
else:
    print(n-sum(a))

Buggy python submission (verdict: Runtime Error):
N = int(input())
M = int(input())
total = 0
 
for i in range(M):
    A = int(input())
    total = total+A
 
if total <= N:
    print (N - total)
else:
    print ("-1")

Fixed submission:
import math

n, m = map(int, input().split())
a = list(map(int, input().split()))

if (n-sum(a)) < 0:
    print(-1)
else:
    print(n-sum(a))

Buggy python submission (verdict: Runtime Error):
N = int(input())
M = int(input())
total = 0

for i in range(M):
    A = int(input())
    total = total+A

if total <= N:
    print (N - total)
else:
    print (-1)


Fixed submission:
import math

n, m = map(int, input().split())
a = list(map(int, input().split()))

if (n-sum(a)) < 0:
    print(-1)
else:
    print(n-sum(a))

Buggy python submission (verdict: Runtime Error):
N = int(input())
M = int(input())
total = 0

for i in range(M):
  	A = int(input())
    total = total + A
    
if total <= N:
    print (N - total)
else:
  	print "-1"

Fixed submission:
import math

n, m = map(int, input().split())
a = list(map(int, input().split()))

if (n-sum(a)) < 0:
    print(-1)
else:
    print(n-sum(a))
Buggy python submission (verdict: Runtime Error):
import numpy as np

n = input()
a = np.array([int(i) for i in input().split()])
for i in range(int(n)):
    print(a.count(i+1))

Fixed submission:
num = int(input())
h_numbers = list(map(int, input().split()))
s = [0] * num
for i in h_numbers:
    s[i-1] += 1
[print(i) for i in s]

Buggy python submission (verdict: Runtime Error):
n = input()
a = np.array([int(i) for i in input().split()])

for i in range(int(n)):
    print(a.count(i+1))


Fixed submission:
num = int(input())
h_numbers = list(map(int, input().split()))
s = [0] * num
for i in h_numbers:
    s[i-1] += 1
[print(i) for i in s]

Buggy python submission (verdict: Runtime Error):
n = input()
#a = list(map(int, input().split()))
a = np.array([int(i) for i in input().split()])
for i in range(int(n)):
    print(a.count(i+1))


Fixed submission:
num = int(input())
h_numbers = list(map(int, input().split()))
s = [0] * num
for i in h_numbers:
    s[i-1] += 1
[print(i) for i in s]

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

for i in range(int(n)):
    print(a.count(i+1))

Fixed submission:
num = int(input())
h_numbers = list(map(int, input().split()))
s = [0] * num
for i in h_numbers:
    s[i-1] += 1
[print(i) for i in s]

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

print(0)
for i in range(len(a)):
    print(a.count(i))


Fixed submission:
num = int(input())
h_numbers = list(map(int, input().split()))
s = [0] * num
for i in h_numbers:
    s[i-1] += 1
[print(i) for i in s]
Buggy python submission (verdict: Runtime Error):
S = raw_input()

length = len(S)
if length % 2 == 0:
  if n.count('hi')==length/2:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Fixed submission:
S = raw_input()

length = len(S)
if length % 2 == 0:
  if S.count('hi')==length/2:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
S = input()
if 'hi' in S:
    print 'Yes'
elif:
    print 'No'

Fixed submission:
S = raw_input()

length = len(S)
if length % 2 == 0:
  if S.count('hi')==length/2:
    print("Yes")
  else:
    print("No")
else:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
x = int(input())
cnt = 0
while True:
  for i in range(1,x+1):
    if x % i == 0:
      cnt += 1
  if cnt == 2:
    print(x)
    break
  else:
    x += 1

Fixed submission:
x = int(input())
done = True
while done :
    for i in range(2,x):
        if x % i == 0:
            x += 1
            break
    else:
        print(x)
        done = False

Buggy python submission (verdict: Time Limit Exceeded):
x = int(input())
cnt = 0
while True:
  for i in range(1,x+1):
    if x % i == 0:
      cnt += 1
  if cnt == 2:
    print(x)
    break
  else:
    x += 1

Fixed submission:
x = int(input())
done = True
while done :
    for i in range(2,x):
        if x % i == 0:
            x += 1
            break
    else:
        print(x)
        done = False

Buggy python submission (verdict: Time Limit Exceeded):
x = int(input())
cnt = 0
y = x
while 1:  
  for i in range(1,y+1):
    if y % i == 0:
      cnt += 1
  if cnt == 2:
    print(y)
    break
  else:
    y += 1


      
  

Fixed submission:
x = int(input())
done = True
while done :
    for i in range(2,x):
        if x % i == 0:
            x += 1
            break
    else:
        print(x)
        done = False
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
if A > B:
    print('GREATER')
elif A < B:
    print('LESS')
else:
    print('EQUAL')

Fixed submission:
s1,s2,s3 = input().split()
print(s1[0].capitalize() + s2[0].capitalize() + s3[0].capitalize())

Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
if A > B:
  print("GREAT")
elif A < B:
  print("LESS")
else:
  print("EQUAL")
                

Fixed submission:
s1,s2,s3 = input().split()
print(s1[0].capitalize() + s2[0].capitalize() + s3[0].capitalize())

Buggy python submission (verdict: Runtime Error):
s1,s2,s3 = map(int,input().split())
print(s1[0].capitalize() + s2[0].capitalize() + s3[0].capitalize())

Fixed submission:
s1,s2,s3 = input().split()
print(s1[0].capitalize() + s2[0].capitalize() + s3[0].capitalize())

Buggy python submission (verdict: Runtime Error):
s1,s2,s3 = map(int,input().split())
print(s1[0].capitalize() + s2[0].capitalize() + s3[0]capitalize())

Fixed submission:
s1,s2,s3 = input().split()
print(s1[0].capitalize() + s2[0].capitalize() + s3[0].capitalize())
Buggy python submission (verdict: Runtime Error):
a = map(int,input().split())
for i in range(2,10,1):
  if a % i == 0 and a/i < 10:
    print('Yes')
	return 0
print('No)

Fixed submission:
a = int(input())
for i in range(1,10,1):
  if a % i == 0 and a/i < 10:
    print('Yes')
    exit(0)
print('No')