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

Fixed submission:
N,X,*M,=map(int,open(0).read().split())
print(N+(X-sum(M))//min(M))

Buggy submission (verdict: Runtime Error):
N,X=map(int,input().split())
*M,=map(int,open(0))
print(N+(X-sum(M))//min(M))
Problem p03408 (python)

Fixed submission:
N=input()
N=int(N)
S=[0]*N
for i in range(N):
    S[i]=input()

M=input()
M=int(M)
T=[0]*M
for i in range(M):
    T[i]=input()

A=[]
for i in S:
    A.append(S.count(i)-T.count(i))

print(max(0,max(A)))

Buggy submission (verdict: Runtime Error):
N=input()
N=int(N)
S=[0]*N
for i in range(N):
    S[i]=input()

M=input()
M=int(M)
T=[0]*M
for i in range(M):
    T[i]=input()

A=[]
for i in S:
    A.append(S.count(i)-T.count(i))

print(max(*A,0))

Buggy submission (verdict: Runtime Error):
N=int(input())
S=[0]*N
for i in range(N):
    S[i]=input()

M=int(input())
T=[0]*M
for i in range(M):
    T[i]=input()

A=[]
for i in S:
    A.append(S.count(i)-T.count(i))

print(max(*A,0))

Buggy submission (verdict: Runtime Error):
N=int(input())
S=[0]*N
for i in range(N):
    S[i]=input()

M=int(input())
T=[0]*M
for i in range(M):
    T[i]=input()

A=[]
for i in S:
    A.append(S.count(i)-T.count(i))

print(max(*A,0))
Problem p03470 (python)

Fixed submission:
N,*D=open(0);print(len(set(D)))

Buggy submission (verdict: Runtime Error):
A,B=input().split()
print('YNeos'[int(A+B)**0.5%1!=0::2])
Problem p03565 (python)

Fixed submission:
S=input()
T=input()
ns=len(S)
nt=len(T)
ans=[]
i=0
while i+nt<=ns:
    j=0
    while j<nt:
        if S[i+j]=='?' or S[i+j]==T[j]:
            j+=1
        else:
            break
    if j==nt:
        A=S[:i]+T+S[i+nt:]
        A=A.replace('?','a')
        ans.append(A)
    i+=1
    
if ans:
    print(sorted(ans)[0])
else:
    print('UNRESTORABLE')

Buggy submission (verdict: Runtime Error):
S=input()
T=input()

Rs=list(S)[::-1]
Rt=list(T)[::-1]
N=len(S)
M=len(T)
i=0
while i+M<N:
    j=0
    while j<M:
        if Rs[i+j]=='?' or Rs[i+j]==Rt[j]:
            j+=1
        else:
            i+=1
            break
    if j==M:
        break

if j!=M:
    ans='UNRESTORABLE'
else:
    for t in Rt:
        Rs[i]=t
        i+=1
    ans=''.join(Rs[::-1]).replace('?','a')
print(ans)
Problem p03951 (python)

Fixed submission:
N=int(input())
S=input()
T=input()

ans=2*N
i=N
while i:
    if S[-i:]==T[:i]:
        ans-=i
        break
    i-=1

print(ans)

Buggy submission (verdict: Runtime Error):
N=int(input())
S=input()
T=input()
ans=S+T

while ans[-N:]==T:
    recover=ans
    if ans[N-1]==ans[N]:
        ans=ans[:N]+ans[N+1:]
    else:
        recover=ans
        break

if S in T:
    print(len(T))
elif T in S:
    print(len(S))
else:
    print(len(recover))
Problem p02614 (python)

Fixed submission:
import numpy as np
import itertools

h, w, k = list(map(int, input().split(' ')))

cells = []
for _ in range(h):
  cells.append(list(input()))
cells = np.asarray(cells)

n_choice = 0
for n_target_rows in range(h + 1):
  target_rows = list(itertools.combinations(range(h), n_target_rows))
  
  for n_target_clms in range(w + 1):
    target_clms = list(itertools.combinations(range(w), n_target_clms))
    
    for rows in target_rows:
      row_converted_cells = cells.copy()
      row_converted_cells[rows, :] = 'r' * w
      
      for clms in target_clms:
        clm_converted_cells = row_converted_cells.copy()
        clm_converted_cells[:, clms] = 'r'
        n_black = np.count_nonzero(clm_converted_cells == '#')
        
        if n_black == k:
          n_choice += 1
                    
print(n_choice)

Buggy submission (verdict: Runtime Error):
import numpy as np
import itertools

h, w, k = list(map(int, input().split(' ')))

cells = []
for _ in range(h):
  cells.append(list(input()))
cells = np.asarray(cells)

n_choice = 0
for n_target_rows in range(h + 1):
  target_rows = list(itertools.combinations(range(h), n_target_rows))
  
  for n_target_clms in range(w + 1):
    target_clms = list(itertools.combinations(range(w), n_target_clms))
    
    for rows in target_rows:
      row_converted_cells = cells.copy()
      row_converted_cells[rows, :] = 'r' * w
      
      for clms in target_clms:
        clm_converted_cells = row_converted_cells.copy()
        clm_converted_cells[:, clms] = 'r'
        n_black = np.count_nonzero(clm_converted_cells == '#')
        
        if n_black == k:
          n_choice += 
                    
print(n_choice)
Problem p02584 (python)

Fixed submission:
x, k, d = list(map(int, input().split()))

sign = 0
if x != 0:
  sign = int(x /abs(x))

if (abs(x) // d) < k:
  tmp = x - sign * d * (abs(x) // d)
  #print(tmp)
  if (k - (abs(x) // d)) % 2 == 0:
    print(abs(tmp))
  else:
    print(min(abs(tmp + d), abs(tmp - d)))
else:
  print(abs(x - sign * d * k))

Buggy submission (verdict: Runtime Error):
x, k, d = list(map(int, input().split()))

sign = int(x /abs(x))

if (abs(x) // d) < k:
  tmp = x - sign * d * (abs(x) // d)
  #print(tmp)
  if (k - (abs(x) // d)) % 2 == 0:
    print(abs(tmp))
  else:
    print(min(abs(tmp + d), abs(tmp - d)))
else:
  print(abs(x - sign * d * k))

Buggy submission (verdict: Runtime Error):
x, k, d = list(map(int, input().split()))

sign = int(x /abs(x))

if (abs(x) // d) < k:
  tmp = x - sign * d * (abs(x) // d)
  #print(tmp)
  if (k -(abs(x) // d)) % 2 == 0:
    print(tmp)
  else:
    print(min(abs(tmp + d), abs(tmp - d)))
else:
  print(abs(x - sign * d * k))

Buggy submission (verdict: Runtime Error):
x, k, d = list(map(int, input().split()))

sign = int(x /abs(x))

if (abs(x) // d) < k:
  tmp = x - sign * d * (abs(x) // d)
  if (abs(x) // d) % 2 == 0:
    print(tmp)
  else:
    print(min(abs(tmp + d), abs(tmp - d)))
else:
  print(abs(x - sign * d * k))
Problem p02743 (python)

Fixed submission:

a, b, c = map(int, input().split())
import math

if (c - a - b) **2 <= 4 * a * b  or c - a - b <= 0:
  print("No")
else:
  print("Yes")

Buggy submission (verdict: Runtime Error):

a, b, c = map(int, input().split())
import math

if
if (c - a - b) **2 <= 4 * a * b  or c - a - b <= 0:
  print("No")
else:
  print("Yes")
Problem p02888 (python)

Fixed submission:
import bisect
N = int(input())
#ソートしておく
L = sorted(list(map(int, input().split())))
ans = 0

#短い2辺を総当たりで選択
for i in range(N - 2):
  for j in range(i + 1, N - 1):
    #小さい順に並べた時の成立条件
    # l1 + l2 > l3
    l12 = L[i] + L[j]
    #l2の隣から　l12以下のところまで全部が対象、成立しない場合
    #ans += max(bisect.bisect_left(L, l12) - j - 1, 0)
    ans += bisect.bisect_left(L, l12) - j - 1
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
L = list(map(int, input().split()))
ans = 0
#for i in range(N):
#  for j in range(i + 1, N):
#    for k in range(j + 1, N):
#      #print(str(i) + str(j) + str(k))
#      if L[i] < L[j] + L[k] and L[j] < L[k] + L[i] and L[k] < L[i] + L[j]:
#        ans += 1
#print(ans)
comb = list(itertools.combinations(L, 3))
print(comb)
Problem p02923 (python)

Fixed submission:
import math
N = int(input())
H = list(map(int, input().split()))
ans = [0]*N
for i in range(1,N):
  if H[i] <= H[i - 1]:
    ans[i] = ans[i - 1] + 1
print(max(ans))

Buggy submission (verdict: Runtime Error):
N = int(input())
H = list(map(int, input().split()))
ans = [0]*N
for i in range(1,N):
  if H[i - 1] <= now_:
    ans[i] = ans[i - 1] + 1
print(max(ans))
Problem p02945 (python)

Fixed submission:


a, b = input().split()

a = int(a)
b = int(b)


sum = a + b
dif = a - b
pro = a * b


def greatest(a, b, c):
    if a > b:
        if a > c:
            return a
        else:
            return c
    else:
        if b > c:
            return b
        else:
            return c


print(greatest(sum, dif, pro))

Buggy submission (verdict: Runtime Error):
N = int(input())
strings = []
for i in range(N):
    strings.append(str(input()))


strings = [''.join(sorted(s)) for s in strings]
strings.sort()

for s in strings:
    print(s)


hashMap = {}
for string in strings:
    if string not in hashMap:
        hashMap[str(string)] = 1
    else:
        hashMap[str(string)] += 1


sum = 0

for key in hashMap:
    v = hashMap[key]
    sum += v * (v - 1) / 2
print(int(sum))

Buggy submission (verdict: Runtime Error):
N = int(input())
strings = []
for i in range(N):
    strings.append(input())


strings = [''.join(sorted(s)) for s in strings]
strings.sort()

for s in strings:
    print(s)


hashMap = {}
for string in strings:
    if string not in hashMap:
        hashMap[str(string)] = 1
    else:
        hashMap[str(string)] += 1


sum = 0

for key in hashMap:
    v = hashMap[key]
    sum += v * (v - 1) / 2
print(int(sum))
Problem p02947 (python)

Fixed submission:
N = int(input())
strings = []
for i in range(N):
    strings.append(input())


strings = [''.join(sorted(s)) for s in strings]
strings.sort()


hashMap = {}
for string in strings:
    if string not in hashMap:
        hashMap[str(string)] = 1
    else:
        hashMap[str(string)] += 1


sum = 0

for key in hashMap:
    v = hashMap[key]
    sum += v * (v - 1) / 2
print(int(sum))

Buggy submission (verdict: Runtime Error):

N = input()
strings = []
for i in range(N):
    strings.append(input())


strings = [''.join(sorted(s)) for s in strings]
strings.sort()

for s in strings:
    print(s)


hashMap = {}
for string in strings:
    if string not in hashMap:
        hashMap[str(string)] = 1
    else:
        hashMap[str(string)] += 1


sum = 0

for key in hashMap:
    v = hashMap[key]
    sum += v * (v - 1) / 2
print(int(sum))
Problem p02553 (python)

Fixed submission:
a,b,c,d = map(int, input().split())
print(max([a*c, a*d, b*c, b*d]))

Buggy submission (verdict: Runtime Error):
a,b,c,d = map(int, input().split())
print(max([a*c, a*d, b*c, b*d])
Problem p02555 (python)

Fixed submission:
S = int(input())
if S < 3:
    print(0)
else:
    MODULO = int(1e9+7)
    dp = [0,0,0,1]
    for i in range(4,S+1):
        x = dp[i-3] + dp[i-1]
        x %= MODULO
        dp.append(x)
    print(dp[-1])

Buggy submission (verdict: Runtime Error):
S = int(input())
if S < 3: return 0
MODULO = int(1e9+7)
dp = [0,0,0,1]
for i in range(4,S+1):
  x = dp[i-3] + dp[i-1]
  x %= MODULO
  dp.append(x)
print(dp[-1])

Buggy submission (verdict: Runtime Error):
S = int(input())
if S < 3: return 0
MODULO = int(1e9+7)
dp = [0,0,0,1]
for i in range(4,S+1):
  x = dp[i-3] + dp[i-1]
  x %= MODULO
  dp.append(x)
print(dp[-1]
Problem p02988 (python)

Fixed submission:
n=int(input())
p=list(map(int,input().split()))
a=0
for i in range(1,n-1):
	a+=p[i]>min(p[i-1],p[i+1]) and p[i]<max(p[i-1],p[i+1])
print(a)

Buggy submission (verdict: Runtime Error):
input()
p=list(map(int,input().split()))
a=0
for i in range(1,n-1):
	a+=p[i]>min(p[i-1],p[i+1]) and p[i]<max(p[i-1],p[i+1])
print(a)
Problem p03294 (python)

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

def f(m, a):
    return sum([m % i for i in a])

def gcd(a, b):
    while b > 0:
        if a < b: a, b = b, a
        r = a % b
        a = b
        b = r
    return a

lcm = arr[0]
for i in range(1, len(arr)):
    lcm = lcm * arr[i] // gcd(lcm, arr[i])

print(f(lcm -1, arr))

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

def f(m, a):
    return sum([m % i for i in a])

def gcd(a, b):
    while b > 0:
	if a < b: a, b = b, a
        r = a % b
	a = b
        b = r
    return a

lcm = arr[0]
for i in range(1, len(arr)):
    lcm = lcm * arr[i] // gcd(lcm, arr[i])

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

def f(m, a):
    return sum([m % i for i in a])

lcm = arr[0]
for i in range(1, len(arr)):
    lcm = lcm * arr[i] // math.gcd(lcm, arr[i])

print(f(lcm -1, arr))
Problem p02536 (python)

Fixed submission:
n, m = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(m)]
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
uni = UnionFind(n)
for i in range(m):
    a, b = ab[i]
    uni.union(a - 1, b - 1)
print(uni.group_count() - 1)

Buggy submission (verdict: Runtime Error):
n, m = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(m)]
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
uni = UnionFind(n)
for i in range(m):
    a, b = ab[i]
    uni.union(a, b)
print(uni.group_count() - 1)
Problem p02615 (python)

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

a.sort(reverse=True)

ans = a[0]
cnt = 1
index = 1
while cnt < n - 1:
    ans += 2 * a[index]
    index += 1
    cnt += 2
    
if cnt == n - 1:
    print(ans)
else:
    print(ans - a[index - 1])

Buggy submission (verdict: Runtime Error):
import heapq
n = int(input())
a = list(map(int, input().split))
a.sort(reverse=True)

ans = 0
heap = []
heapq.heappush(heap, -a[0])
for i in range(1, n):
    tmp = heapq.heappop(heap)
    tmp *= -1
    ans += tmp
    heapq.heappush(heap, -a[i])
    heapq.heappush(heap, -a[i])
print(ans)
Problem p02630 (python)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
q = int(input())
s = [list(map(int, input().split())) for i in range(q)]

ans = sum(a)
from collections import Counter
cnt = Counter(a)

for i, j in s:
    #ans = ans - i * cnt[i] + j * cnt[j]
    if j in cnt:
        cnt[j] += cnt[i]
    else:
        cnt[j] = cnt[i]
        
    ans = ans - i * cnt[i] + cnt[i] * j
    if i in cnt:
        cnt.pop(i)
    #ans = ans + j * cnt[j]
    #print(ans, cnt)
    print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
q = int(input())
s = [list(map(int, input().split())) for i in range(q)]

ans = sum(a)
from collections import Counter
cnt = Counter(a)

for i, j in s:
    
    if j in cnt:
        cnt[j] += cnt[i]
    else:
        cnt[j] = cnt[i]
        
    ans = ans - i * cnt[i] + cnt[i] * j
    cnt.pop(i)

    print(ans)
Problem p02657 (python)

Fixed submission:
a, b = map(int, input().split())
print(a * b)

Buggy submission (verdict: Runtime Error):
n = int(input())
"""nを素因数分解"""
"""2以上の整数n => [[素因数, 指数], ...]の2次元リスト"""
# n == 1のとき、[1, 1]を返す
def factorization(n):
    
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr
num = factorization(n)
kazu = []
for num_i in num:
    cnt = 1 #num_i[0]
    hoge = num_i[0]
    for i in range(num_i[1]):
        cnt *= hoge
        kazu.append(cnt)
kazu.sort()
cnt = 0
ans = 1
while ans <= n:
    ans *= kazu[cnt]
    cnt += 1
print(cnt)
Problem p02658 (python)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
import sys
limit = 10 ** 18
if 0 in a:
    print(0)
    sys.exit()
else:
    ans = 1
    for i in range(n):
        ans *= a[i]
        if ans > limit:
            print(-1)
            sys.exit()
    print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
limit = 10 ** 18
if 0 in a:
    print(0)
    sys.exit()
else:
    ans = 1
    for i in range(n):
        ans *= a[i]
        if ans > limit:
            print(-1)
            sys.exit()
    print(ans)
Problem p02684 (python)

Fixed submission:
n, k = map(int, input().split())
an = list(map(int, input().split()))
for i in range(n):
    an[i] -= 1
    
import math
dv = []
dv.append(an)
K = k
N = n
for _ in range(1, int(math.log2(K)) + 1):
    l = [0] * N
    dv.append(l)

for k in range(1, int(math.log2(K)) + 1):
    for n in range(N):
        dv[k][n] = dv[k - 1][dv[k - 1][n]]
        
# N 回目を 2 ^ t で表すためにビット演算を用いる
# a : dv の何行目を用いるかを格納
a = []
for i in range(int(math.log2(K)) + 1):
    if K >> i & 1:
        a.append(i)
        
now = 0
for i in a:
    now = dv[i][now]
        
print(now + 1)

Buggy submission (verdict: Runtime Error):
n, k = map(int, input().split())
a = list(map(int, input().split()))
dic = {}
dic[1] = 1
new = 1
rest = 0
ball = 0
for i in range(1, n):
    new = a[new - 1]
    if new in dic:
        rest = dic[new] - 1
        ball = i - rest
        break
    else:
        dic[new] = i + 1
hoge = list(dic)[rest:]
print(hoge[::-1][(k - 1) % ball + rest - 1])
#hoge
Problem p02687 (python)

Fixed submission:
s = input()
if s == 'ABC':
    print('ARC')
else:
    print('ABC')

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

for i in range(1000):
    #for j in range(10)
    #print(i ** 5)
    for j in range(1000):
        #print(i ** 5 - j ** 5)
        if i ** 5 - j ** 5 == x:
            print(i, j)
            quit()
        elif i ** 5 - (-j) ** 5 == x:
            print(i, -j)
            quit()
        elif (-i) ** 5 - j ** 5 == x:
            print(-i, j)
            quit()
        elif (-i) ** 5 - (-j) ** 5 == x:
            print(-i, -j)
            quit()
Problem p02713 (python)

Fixed submission:
import math
k = int(input())
ans = 0
for i in range(1, k + 1):
    for j in range(1, k + 1):
        gcd1 = math.gcd(i, j)
        for l in range(1, k + 1):
            gcd2 = math.gcd(gcd1, l)
            ans += gcd2
print(ans)

Buggy submission (verdict: Runtime Error):
import math
def multi_gcd(a):
    ans = a[0]
    for i in range(1, len(a)):
        ans = fractions.gcd(ans, a[i])
    #print(ans)
    return ans
K = int(input())
sum_ = 0
for i in range(1, K + 1):
    for j in range(1, K + 1):
        for k in range(1, K + 1):
            sum_ += multi_gcd([i, j, k])
print(sum_)

Buggy submission (verdict: Runtime Error):
import math
k = int(input())
ans = 0
for i in range(1, k + 1):
    for j in range(1, j + 1):
        gcd1 = math.gcd(i, j)
        for l in range(1, l + 1):
            gcd2 = math.gcd(gcd1, l)
            ans += gcd2
print(ans)
Problem p02727 (python)

Fixed submission:
x, y, a, b, c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p = sorted(p, reverse=True)[:x]
q = sorted(q, reverse=True)[:y]
r = sorted(r, reverse=True)
ans = p + q + r
ans.sort(reverse=True)
print(sum(ans[:x + y]))

Buggy submission (verdict: Runtime Error):
x, y, a, b, c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
ans = p[:x] + q[:y] + r
print(sum(ans.sort(reverse=True)[:x + y]))
Problem p02742 (python)

Fixed submission:
h, w = map(int, input().split())

syou, amari = divmod(h, 2)
if w % 2 == 1:
    a = w // 2 + 1
    ans = (a + a - 1)* syou + a * amari
else:
    a = w / 2
    ans = (a + a)* syou + a * amari
if h == 1 or w == 1:
    print(1)
else:
    print(int(ans))

Buggy submission (verdict: Runtime Error):
h, w = map(int, input().split())

syou, amari = divmod(h, 2)
if w % 2 == 1:
    a = w // 2 + 1
ans = (a + a - 1)* syou + a * amari
print(ans)
Problem p02743 (python)

Fixed submission:
import math
from decimal import Decimal
a, b, c = map(int, input().split())
A = Decimal(str(a))**Decimal('0.5')
B = Decimal(str(b))**Decimal('0.5')
C = Decimal(str(c))**Decimal('0.5')
if A + B < C:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
#import numpy as np
import math
#abc_sq = np.sqrt(abc)
d = c - a - b
if 4*a*b < d**2 and d > 0:
    print('Yes')
else:
    print('No')
Problem p02755 (python)

Fixed submission:
a, b = map(int, input().split())
flag = False
for i in range(0, 1300):
    if a == int(i * 0.08) and b == int(i * 0.1):
        flag = True
        break
if flag:
    print(i)
else:
    print(-1)
        #print(i)

Buggy submission (verdict: Runtime Error):
a, b = map(int, input().split())
for i in range(1, 1250):
    if a == int(i * 0.08) and b == int(i * 0.1):
        flag = True
        break
if flag:
    print(i)
else:
    print(-1)