Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline

N = int(input())
S = ["".join(sorted(input())) for _ in range(N)]
c = Counter(S)
print(sum([k*(k-1)//2 for k in c.values()]))

Fixed submission:
from collections import Counter

N = int(input())
S = []
for _ in range(N):
    S.append("".join(sorted(input())))

c = Counter(S)
print(sum([k*(k-1)//2 for k in c.values()]))

Buggy python submission (verdict: Time Limit Exceeded):
from collections import Counter

N = int(input())
S = []
for _ in range(N):
    S.append(Counter(list(input())))

count = 0
for i in range(N):
    for j in range(i + 1, N):
        if S[i] == S[j]:
            count += 1

print(count)

Fixed submission:
from collections import Counter

N = int(input())
S = []
for _ in range(N):
    S.append("".join(sorted(input())))

c = Counter(S)
print(sum([k*(k-1)//2 for k in c.values()]))

Buggy python submission (verdict: Time Limit Exceeded):
from collections import Counter

N = int(input())
S = []
for _ in range(N):
    S.append(list(input()))

count = 0
for i in range(N):
    for j in range(i + 1, N):
        si = set(S[i])
        sj = set(S[j])
        if len(si) == len(sj) and si == sj:
            count += 1
        else:
            ci = Counter(S[i])
            cj = Counter(S[j])
            if ci == cj:
                count += 1
print(count)

Fixed submission:
from collections import Counter

N = int(input())
S = []
for _ in range(N):
    S.append("".join(sorted(input())))

c = Counter(S)
print(sum([k*(k-1)//2 for k in c.values()]))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
H = list(map(int, input().split()))
lowest = 10**10
for i in range(N - 2):
    if H[i] - H[i + 1] >= 2:
        print("No")
        exit()
    elif H[i] > H[i + 1]:
        H[i] -= 1
        lowest = min(H[i + 1:])
        if H[i] > lowest:
            print("No")
            exit()
print("Yes")

Fixed submission:
N = int(input())
H = [int(x) for x in input().split()][::-1]
for i in range(1, N):
    d = H[i] - H[i - 1]
    if d >= 2:
        print("No")
        exit()
    elif d == 1:
        H[i] -= 1
print("Yes")
Buggy python submission (verdict: Runtime Error):
import math

A, B, C, D = map(int, input().split(" "))
r = B - A + 1
n_C = round(r / C)
n_D = round(r / D)
n_CD = round(r / ((C * D) // math.gcd(C, D)))
print(r - (n_C + n_D - n_CD))


Fixed submission:
from fractions import gcd


def wari(x, c, d):
    nc = x // c
    nd = x // d
    ncd = x // ((c * d) // gcd(c, d))
    return x - nc - nd + ncd


A, B, C, D = map(int, input().split())

nb = wari(B, C, D)
na = wari(A - 1, C, D)
print(nb - na)

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

A, B, C, D = map(int, input().split(" "))
r = B - A + 1
n_C = round(r / C)
n_D = round(r / D)
n_CD = round(r / ((C * D) // math.gcd(C, D)))
print(r - (n_C + n_D - n_CD))

Fixed submission:
from fractions import gcd


def wari(x, c, d):
    nc = x // c
    nd = x // d
    ncd = x // ((c * d) // gcd(c, d))
    return x - nc - nd + ncd


A, B, C, D = map(int, input().split())

nb = wari(B, C, D)
na = wari(A - 1, C, D)
print(nb - na)
Buggy python submission (verdict: Runtime Error):
N = int(input())
x_list, y_list = [], []
for _ in range(N):
    x, y = map(int, input().split(" "))
    x_list.append(x)
    y_list.append(y)

vec_counts = {}
for x1, y1 in zip(x_list, y_list):
    for x2, y2 in zip(x_list, y_list):
        v = x1 - x2, y1 - y2
        if v != (0, 0):
            if v in vec_counts:
                vec_counts[v] += 1
            else:
                vec_counts[v] = 1

print(N - max(vec_counts.values()))

Fixed submission:
N = int(input())
x_list, y_list = [], []
for _ in range(N):
    x, y = map(int, input().split(" "))
    x_list.append(x)
    y_list.append(y)

vec_counts = {0: 0}
for x1, y1 in zip(x_list, y_list):
    for x2, y2 in zip(x_list, y_list):
        v = x1 - x2, y1 - y2
        if v != (0, 0):
            if v in vec_counts:
                vec_counts[v] += 1
            else:
                vec_counts[v] = 1

print(N - max(vec_counts.values()))
Buggy python submission (verdict: Time Limit Exceeded):
import heapq as hq

N, M = map(int, input().split())
A = [int(a) for a in input().split()]
BC = [tuple(map(int, input().split())) for _ in range(M)]

hq.heapify(A)
for b, c in BC:
    for i in range(b):
        a = hq.heappop(A)
        if a < c:
            hq.heappush(A, c)
        else:
            hq.heappush(A, a)
            break

print(sum(A))

Fixed submission:
import heapq as hq

N, M = map(int, input().split())
A = [int(a) for a in input().split()]
BC = [tuple(map(int, input().split())) for _ in range(M)]
BC.sort(key=lambda x: x[1], reverse=True)

hq.heapify(A)
for b, c in BC:
    for i in range(b):
        a = hq.heappop(A)
        if a < c:
            hq.heappush(A, c)
        else:
            hq.heappush(A, a)
            break

print(sum(A))

Buggy python submission (verdict: Time Limit Exceeded):
import heapq as hq

N, M = map(int, input().split())
A = [int(a) for a in input().split()]
BC = [tuple(map(int, input().split())) for _ in range(M)]

hq.heapify(A)
for b, c in BC:
    for i in range(b):
        a = hq.heappop(A)
        if a < c:
            hq.heappush(A, c)
        else:
            hq.heappush(A, a)
            break

print(sum(A))

Fixed submission:
import heapq as hq

N, M = map(int, input().split())
A = [int(a) for a in input().split()]
BC = [tuple(map(int, input().split())) for _ in range(M)]
BC.sort(key=lambda x: x[1], reverse=True)

hq.heapify(A)
for b, c in BC:
    for i in range(b):
        a = hq.heappop(A)
        if a < c:
            hq.heappush(A, c)
        else:
            hq.heappush(A, a)
            break

print(sum(A))
Buggy python submission (verdict: Runtime Error):
import numpy as np

N = int(input())
V = np.array([int(v) for v in input().split()])
C = np.array([int(c) for c in input().split()])
R = V - C
print(R[R > 0].sum())

Fixed submission:
import numpy as np

N = int(input())
V = np.array([int(v) for v in input().split()])
C = np.array([int(c) for c in input().split()])
R = V - C
print(R[R > 0].sum())
Buggy python submission (verdict: Runtime Error):
input()
V = [int(v) for v in input().split()]
count = 0
c1 = Counter(V[::2] + [0]).most_common()[0][0]
for v in V[::2]:
    if v != c1:
        count += 1
c2 = Counter(V[1::2] + [0]).most_common()
c2 = c2[0][0] if c1 != c2[0][0] else c2[1][0]
for v in V[1::2]:
    if v != c2:
        count += 1
print(count)

Fixed submission:
from collections import Counter

input()
V = [int(v) for v in input().split()]
count1 = 0
count2 = 0
c11 = Counter(V[::2]).most_common()[0][0]
c12 = Counter(V[1::2]).most_common()[0][0]
for v1, v2 in zip(V[::2], V[1::2]):
    if v1 != c11:
        count1 += 1
    if v2 != c12:
        count2 += 1
c21 = Counter(V[1::2]).most_common()
c22 = Counter(V[::2]).most_common()
c21.append((0, 1))
c22.append((0, 1))
c21 = c21[0][0] if c21[0][0] != c11 else c21[1][0]
c22 = c22[0][0] if c22[0][0] != c12 else c22[1][0]
for v1, v2 in zip(V[1::2], V[::2]):
    if v1 != c21:
        count1 += 1
    if v2 != c22:
        count2 += 1
print(min(count1, count2))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = [int(input()) for _ in range(N)]
pushed = [False] * N
pushed[0] = True
button = 0
count = 0
while True:
    count += 1
    button = A[button] - 1
    if button == 1:
        print(count)
        exit()
    if pushed[button]:
        print(-1)
        exit()


Fixed submission:
N = int(input())
A = [int(input()) for _ in range(N)]
pushed = [False] * N
pushed[0] = True
button = 0
count = 0
while True:
    count += 1
    button = A[button] - 1
    if button == 1:
        print(count)
        exit()
    if pushed[button]:
        print(-1)
        exit()
    pushed[button] = True
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
p = 1
for i in range(2, N + 1):
    p *= i
print(p % (10**9 + 7))

Fixed submission:
N = int(input())
p = 1
for i in range(2, N + 1):
    p *= i
    p %= 10**9 + 7
print(p)
Buggy python submission (verdict: Runtime Error):
input_line = input()

if input_line == "AAA" or input_line == "BBB"
    print("No")
else:
    print("Yes")

Fixed submission:
input_line = input()

if input_line == "AAA" or input_line == "BBB":
    print("No")
else:
    print("Yes")

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

if s1 == s2 and s1 == s3:
    print("No")
else:
    print("Yes")



Fixed submission:
input_line = input()

if input_line == "AAA" or input_line == "BBB":
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))
A.sort()
ans = 0
confo = [A[N-1]]
for i in range(N-1):
	ans += confo[0]
	confo.append(A[N-i-2])
	confo.append(A[N-i-2])
	del confo[0]
print(ans)

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
A.sort()
ans = 0
confo = [A[N-1]]
for i in range(N-1):
	ans += confo[i]
	confo.append(A[N-i-2])
	confo.append(A[N-i-2])
print(ans)
Buggy python submission (verdict: Runtime Error):
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <typeinfo>
#include <numeric>
#include <functional>
#include <unordered_map>
#include <bitset>
#include <stack>
#include <assert.h>
#include <unordered_set>
#include <random>


using namespace std;
using ll = long long;
using ull = unsigned long long;

const ll INF = 1e18;
const ll MOD = 1e9 + 7;

#define REP(i, n) for(ll i = 0; i < n; i++)


























int main(){
    ll a;
    long double b;
    cin >> a >> b;
    cout << (ll)(a * b) << endl;
}


Fixed submission:
print((lambda a:a[0]*a[1]//100)(list(map(int,input().replace(".", "").split()))))
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
C = list(input())
ans = 0
for l in range(n):
    if C[l] == "W":
        for r in range(n-1,0,-1):
            if r<=l:
                print(ans)
                exit()
            if C[r] == "R":
                #print(C)
                C[l] = "R"
                C[r] = "W"
                #print(C)
                #print("-----------------")
                ans += 1
                break
print(ans)

Fixed submission:
n=int(input())
C = list(input())
ans = 0
N = n-1
for l in range(n):
    if C[l] == "W":
        for r in range(N,0,-1):
            if r<=l:
                print(ans)
                exit()
            if C[r] == "R":
                #print(C)
                C[l] = "R"
                C[r] = "W"
                #print(C)
                #print("-----------------")
                ans += 1
                N = r-1
                break
print(ans)
Buggy python submission (verdict: Runtime Error):
from copy import deepcopy
n,k=map(int, input().split())
a=list(map(int,input().split()))
tmp = 1
for i in range(k):
    tmp*=a[i]
p = tmp
p //= a[0]
p *= a[k]
for j in range(n-k):
    #print(tmp,p)
    if tmp < p:
        print("Yes")
    else:
        print("No")
    if k+j+1 > n-1:
        break
    tmp = p
    #print(a[j+1],a[k+j])
    p //= a[j+1]
    p *= a[k+j+1]


Fixed submission:
x = int(input())
p = 599
for i in range(8):
    
    if x <= p:
        print(8-i)
        exit()
    p += 200
Buggy python submission (verdict: Time Limit Exceeded):
from copy import deepcopy
n,k=map(int, input().split())
a=list(map(int,input().split()))
tmp = 1
for i in range(k):
    tmp*=a[i]
p = tmp
p //= a[0]
p *= a[k]
for j in range(n-k):
    #print(tmp,p)
    if tmp < p:
        print("Yes")
    else:
        print("No")
    if k+j+1 > n-1:
        break
    tmp = p
    #print(a[j+1],a[k+j])
    p //= a[j+1]
    p *= a[k+j+1]


Fixed submission:
n,k = map(int, input().split())
a=list(map(int,input().split()))
for i in range(n-k):
    #print(i,k+i)
    if a[i] < a[k+i]:
        print("Yes")
    else:
        print("No")

Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int, input().split())
a = list(map(int,input().split()))
ans = [0]*(n+1)
ans[0] = 1
p = 1
for i in range(n):
    ans[i+1] = ans[i]*a[i]
#print(ans)
for j in range(n-k):
    #print(ans[k]//ans[j],ans[k+1]//ans[j+1])
    if ans[k+j]//ans[j] < ans[k+j+1]//ans[j+1]:
        print("Yes")
    else:
        print("No")


Fixed submission:
n,k = map(int, input().split())
a=list(map(int,input().split()))
for i in range(n-k):
    #print(i,k+i)
    if a[i] < a[k+i]:
        print("Yes")
    else:
        print("No")

Buggy python submission (verdict: Time Limit Exceeded):
from copy import deepcopy
n,k=map(int, input().split())
a=list(map(int,input().split()))
tmp = 1
for i in range(k):
    tmp*=a[i]
p = tmp
p //= a[0]
p *= a[k]
for j in range(n-k):
    #print(tmp,p)
    if tmp < p:
        print("Yes")
    else:
        print("No")
    if k+j+1 > n-1:
        break
    tmp = p
    #print(a[j+1],a[k+j])
    p //= a[j+1]
    p *= a[k+j+1]


Fixed submission:
n,k = map(int, input().split())
a=list(map(int,input().split()))
for i in range(n-k):
    #print(i,k+i)
    if a[i] < a[k+i]:
        print("Yes")
    else:
        print("No")
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))
q=int(input())
bc = [list(map(int,input().split())) for _ in range(q)]
N=[0]*(10**5+1)
for i in a:
    N[i]+=1
for b,c in bc:
    N[c] += N[b]
    N[b] = 0
    print(sum([i*x for i,x in enumerate(N) if x != 0]))


Fixed submission:
n=int(input())
a=list(map(int,input().split()))
q=int(input())
bc = [list(map(int,input().split())) for _ in range(q)]
N=[0]*(10**5+1)
for i in a:
    N[i]+=1
ans = 0
for i,x in enumerate(N):
    if x != 0:
        ans += i*x #初期値

for b,c in bc:
    ans += (c-b)*N[b]
    N[c] += N[b]
    N[b] = 0
    print(ans)
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
a.sort()
M = a[-1]+1
t=[True]*M


for i in a:
    if t[i] == False:
        continue
    if a.count(i)>1:
        t[i] = False
    for j in range(2*i,M,i):
        t[j] = False
ans = 0
for k in a:
    if t[k] == True:
        ans += 1

print(ans)

Fixed submission:
num = list(map(int, input().split()))
print(num.index(0)+1)

Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
M = max(a)+1
t=[True]*M
a.sort()

for i in a:
    if t[i] == False:
        continue
    if a.count(i)>1:
        t[i] = False
    for j in range(2*i,M,i):
        t[j] = False
ans = 0
for k in a:
    if t[k] == True:
        ans += 1

print(ans)

Fixed submission:
num = list(map(int, input().split()))
print(num.index(0)+1)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))
M = max(a)+1
t=[True]*M
a.sort()
s=set(a)
for i in a:
    if t[i] == 0:
        continue
    if a.count(i)>1:
        t[i] = False
    for j in range(2*i,M,i):
        t[j] = False
ans = 0
for k in a:
    if t[k] == True:
        ans += 1

print(ans)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
M = max(a)+1
t=[True]*M
a.sort()
s=set(a)
pre = 0
for i in a:
    if t[i] == 0:
        continue
    if pre == i:
        t[i] = False
    for j in range(2*i,M,i):
        t[j] = False
    pre = i
ans = 0
for k in a:
    if t[k] == True:
        ans += 1

print(ans)

Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int, input().split()))
a.sort()
ans = 0
c= 0 #調べ始める位置する数
if a[0] != a[1]:
    c = 1
    ans = 1
else:
    c = a.count(a[0])

for i in range(c,n,1):
    for j in a[:i]:
        if a[i]%j == 0:
            break
    else:
        ans += 1
print(ans)


Fixed submission:
n=int(input())
a=list(map(int,input().split()))
M = max(a)+1
t=[True]*M
a.sort()
s=set(a)
pre = 0
for i in a:
    if t[i] == 0:
        continue
    if pre == i:
        t[i] = False
    for j in range(2*i,M,i):
        t[j] = False
    pre = i
ans = 0
for k in a:
    if t[k] == True:
        ans += 1

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int, input().split()))
ans = 1
for i in range(n):
    if a.count(0)>0:
        print(0)
        exit()
    ans*= a[i]
    if ans > 10**18:
        print(-1)
        exit()
print(ans)


Fixed submission:
n=int(input())
a=list(map(int, input().split()))
ans = 1
if a.count(0)>0:
    print(0)
    exit()
for i in range(n):
    l = len(str(ans))
    L = len(str(a[i]))
    if a[i] > 10**18:
        print(-1)
        exit()
    elif l+L > 20:
        print(-1)
        exit()
    ans *= a[i]
    if ans > 10**18:
        print(-1)
        exit()
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int, input().split()))
ans =1
for i in a:
    ans *= i
if ans > 10**18:
    print(-1)
    exit()    
print(ans)


Fixed submission:
n=int(input())
a=list(map(int, input().split()))
ans = 1
if a.count(0)>0:
    print(0)
    exit()
for i in range(n):
    l = len(str(ans))
    L = len(str(a[i]))
    if a[i] > 10**18:
        print(-1)
        exit()
    elif l+L > 20:
        print(-1)
        exit()
    ans *= a[i]
    if ans > 10**18:
        print(-1)
        exit()
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int, input().split()))
ans =1
for i in a:
    ans *= i
if ans > 10**18:
    print(-1)
    exit()    
print(ans)

Fixed submission:
n=int(input())
a=list(map(int, input().split()))
ans = 1
if a.count(0)>0:
    print(0)
    exit()
for i in range(n):
    l = len(str(ans))
    L = len(str(a[i]))
    if a[i] > 10**18:
        print(-1)
        exit()
    elif l+L > 20:
        print(-1)
        exit()
    ans *= a[i]
    if ans > 10**18:
        print(-1)
        exit()
print(ans)
Buggy python submission (verdict: Runtime Error):
from decimal improt Decimal
a,b=map(Decimal, input().split())
print(int(a*b))

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

Buggy python submission (verdict: Runtime Error):
from decimal improt Decimal
a,b=map(Decimal, input().split())
print(a*b)

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

Buggy python submission (verdict: Runtime Error):
a,b=intput().split()
a=int(a)
b=int(float(b)*100)
print(int(a*b/100))


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

Buggy python submission (verdict: Runtime Error):
a,b=intput().split()
b=b*100
print(a*b/100)

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

Buggy python submission (verdict: Runtime Error):
a,b=input().split()
b = b*100
print(a*b//100)

Fixed submission:
from decimal import Decimal
a,b=map(Decimal, input().split())
print(int(a*b))
Buggy python submission (verdict: Time Limit Exceeded):
mul2019 = []
for i in range(2, 100):
    if str(i*2019).count("0")>0:
        continue
    mul2019.append(str(i*2019))
n = str(input())
cnt = 0
for j in range(4, len(n)):
    for i in range(len(n)-j+1):
        for r in mul2019:
            if str(r)==n[i:i+j]:
                cnt += 1 
print(cnt)

Fixed submission:
s = input()[::-1] # 入力文字列を逆順でsに格納

counts = [0] * 2019
counts[0] = 1
#余りの数字がそれぞれ何回出たかカウント
#count[0]は「累積和的」に0%2019を考えるために1にしている

num, d = 0, 1
#numは余りの累積和、dはcharの桁数
for char in s:
    num += int(char) * d
    num %= 2019
    d *= 10
    d%= 2019
    counts[num] += 1
'''
charに一桁ずつ取り出す。そのMOD2019を考え、累積和をとる
しかし、それぞれの数字には10の累乗がかかっているのでそれについては別途dを用意してMOD2019をとる
つまり、numは1桁目のMOD2019、2桁目のMOD2019に1桁目のMOD2019に加える
'''

ans = 0
for cnt in counts:
    ans += cnt * (cnt - 1) // 2

print(ans) # 答えの出力
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
lists = list(map(int, input().split()))
for i in range(1, n+1):
    print(lists.count(i))

Fixed submission:
n = int(input())
lists = list(map(int, input().split()))
num = [0]*n
for i in lists:
    num[i-1] += 1
for j in range(n):
    print(num[j])
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
import math
ans = 0
for i in range(1, n+1):
    for j in range(1, n+1):
        for k in range(1, n+1):
            tmp = math.gcd(i,j)
            ans += math.gcd(tmp,k)
print(ans)

Fixed submission:
n = int(input())
import math
ans = 0
for i in range(1, n+1):
    for j in range(1, n+1):
        for k in range(1, n+1):
            tmp = math.gcd(i,j)
            ans += math.gcd(tmp,k)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
num = list(map(int, input().split()))
SetNum = list(set(num))
lenghtNum = len(SetNum)
box = [0]*lenghtNum
for i in range(lenghtNum):
  a = num.count(SetNum[i])
  box[i] = a*(a-1)/2 #要素SetNum[i]の組み合わせの数

for j in num:
  b = SetNum.index(j)
  c = num.count(j)
  if box[b] <= 2:
    d = box[b]
    box[b] = 0
    print(int(sum(box)))
    box[b] = d
  else:
    box[b] = box[b]/c*(c-2)
    print(int(sum(box)))
    box[b] = box[b]*c/(c-2)


Fixed submission:
import collections
n = int(input())
arr = list(map(int, input().split()))
cnt = collections.Counter(arr)
total = 0
for i in cnt.keys():
  patern = cnt[i]*(cnt[i]-1)//2
  total += patern
for j in range(n):
  tmp = total
  total -= cnt[arr[j]]*(cnt[arr[j]]-1)//2
  total += (cnt[arr[j]]-1)*(cnt[arr[j]]-2)//2
  print(total)
  total = tmp
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
if a, b, c < 10**5:
  if 4*a*b < (c-a-b)**2 and c-a-b >0:
    print("Yes")
  else:
    print("No")


Fixed submission:
a, b, c = map(int, input().split())
if c > a+b and 4*a*b < (c-a-b)**2:
  print("Yes")
else:
  print("No")
'''
浮動小数点は長い数を扱うと誤差が生じる
また、整数で計算しようとした時も√の中身は0以上であるという条件から
c > a+b　を忘れてはいけない
'''

Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
if a, b, c < 10**5:
  if 4*a*b < (c-a-b)**2:
    print("Yes")
  else:
    print("No")
else:
  if a+b-c < 2*(a**0.5)*(b**0.5) < c-a-b:
    print("Yes")
  else:
    print("No")

Fixed submission:
a, b, c = map(int, input().split())
if c > a+b and 4*a*b < (c-a-b)**2:
  print("Yes")
else:
  print("No")
'''
浮動小数点は長い数を扱うと誤差が生じる
また、整数で計算しようとした時も√の中身は0以上であるという条件から
c > a+b　を忘れてはいけない
'''
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
if int(A/0.08*0.1) == B :
    print(int(A/0.08))
else:
    print(-1)


Fixed submission:
S = input()
if S.find("A") == -1 or S.find("B") == -1:
    print("No")
else:
    print("Yes")

Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())
if int(A/0.08*0.1) == B :
    print(round(A/0.08))
else:
    print(-1)


Fixed submission:
S = input()
if S.find("A") == -1 or S.find("B") == -1:
    print("No")
else:
    print("Yes")