Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
import sys
input=sys.stdin.readline
N=int(input())
a=list(map(int,input().split()))
fl=1
def absX(n):
	ab=abs(i-n)
	if ab==0:
		ab=1
	return ab
for i in range(min(a),max(a)+1):
	fl_=list(map(absX,a)).count(1)
	if fl_>fl:fl=fl_
print(fl)

Fixed submission:
from collections import*
import sys
input=sys.stdin.readline
n=int(input())
a=list(map(int,input().split()))
a=Counter(a)
cnt=1
for i in range(min(a),max(a)+1):
	cnt_=a[i-1]+a[i]+a[i+1]
	if cnt_>cnt:cnt=cnt_
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
import sys
input=sys.stdin.readline
N=int(input())
a=list(map(int,input().split()))
fl=1
def absX(n):
	ab=abs(X-n)
	if ab==0:
		ab=1
	return ab
for i in range(min(a),max(a)+1):
	X=i
	fl_=list(map(absX,a)).count(1)
	if fl_>fl:
		fl=fl_
print(fl)

Fixed submission:
from collections import*
import sys
input=sys.stdin.readline
n=int(input())
a=list(map(int,input().split()))
a=Counter(a)
cnt=1
for i in range(min(a),max(a)+1):
	cnt_=a[i-1]+a[i]+a[i+1]
	if cnt_>cnt:cnt=cnt_
print(cnt)

Buggy python submission (verdict: Runtime Error):
from collections import*
import sys
sys.stdin=input
n=int(input())
a=list(map(int,input().split()))
a=Counter(a)
cnt=1
for i in range(min(a),max(a)+1):
	cnt_=a[i-1]+a[i]+a[i+1]
	if cnt_>cnt:cnt=cnt_
print(cnt)

Fixed submission:
from collections import*
import sys
input=sys.stdin.readline
n=int(input())
a=list(map(int,input().split()))
a=Counter(a)
cnt=1
for i in range(min(a),max(a)+1):
	cnt_=a[i-1]+a[i]+a[i+1]
	if cnt_>cnt:cnt=cnt_
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
a=list(map(int,input().split()))
fl=0
def absX(n):
	ab=abs(X-n)
	if ab==0:
		ab=1
	return ab
for i in range(min(a),max(a)+1):
	X=i
	fl_=list(map(absX,a)).count(1)
	if fl_>fl:
		fl=fl_
print(fl)

Fixed submission:
from collections import*
import sys
input=sys.stdin.readline
n=int(input())
a=list(map(int,input().split()))
a=Counter(a)
cnt=1
for i in range(min(a),max(a)+1):
	cnt_=a[i-1]+a[i]+a[i+1]
	if cnt_>cnt:cnt=cnt_
print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
a=list(map(int,input().split()))
fl=0
def absX(n):
	ab=abs(X-n)
	if ab==0:
		ab=1
	return ab
for i in range(min(a),max(a)+1):
	X=i
	fl_=list(map(absX,a)).count(1)
	if fl_>fl:
		fl=fl_
print(fl)

Fixed submission:
from collections import*
import sys
input=sys.stdin.readline
n=int(input())
a=list(map(int,input().split()))
a=Counter(a)
cnt=1
for i in range(min(a),max(a)+1):
	cnt_=a[i-1]+a[i]+a[i+1]
	if cnt_>cnt:cnt=cnt_
print(cnt)
Buggy python submission (verdict: Runtime Error):
s = input()
l = len(s)
dif = 0
val=0
for i in range (l):
	if s[i] == 'A' and val==0:
			a = i	
			val=1
	if s[i] == 'Z':
		z = i
		dif = z-a
print(dif+1)

Fixed submission:
s = input()
le = len(s)
list_a = []
list_z = []
dif = 0
for i in range(le):
	if s[i] == 'A':
		list_a.append(i)
	elif s[i] == 'Z':
		list_z.append(i)
print(int(list_z[-1])-int(list_a[0])+1)

Buggy python submission (verdict: Runtime Error):
s = input()
l = len(s)
dif = 0
for i in range (l):
	if s[i] == 'A':
		a = i
	elif s[i] == 'Z':
		z = i
		dif = z-a
print(dif+1)

Fixed submission:
s = input()
le = len(s)
list_a = []
list_z = []
dif = 0
for i in range(le):
	if s[i] == 'A':
		list_a.append(i)
	elif s[i] == 'Z':
		list_z.append(i)
print(int(list_z[-1])-int(list_a[0])+1)
Buggy python submission (verdict: Time Limit Exceeded):
k,s=list(map(int,input().split()))
print([x+y+z for x in range(k+1) for y in range(k+1) for z in range(k+1)].count(s))

Fixed submission:
k,s=list(map(int,input().split()))
print([x+y+s-(x+y) for x in range(k+1) for y in range(k+1) if 0<= s-x-y <= k].count(s))
Buggy python submission (verdict: Runtime Error):

h, w = map(int, input().split())
if h == 1 or w == 1:
  print(1)
else:

  if w % 2 == 0:
      a = (w//2) * 2
      if h % 2 == 0:
          count = a * (h//2)
      else:
          count = a * (h//2)
          count += a // 2

  else:
      a = (w//2) * 2 + 1
      if h % 2 == 0:
          count = a * (h//2)
      else:
          count = a * (h//2)
          count += a//2+1

  print(count)
  h, w = map(int, input().split())
  if w % 2 == 0:
      a = (w//2) * 2
      if h % 2 == 0:
          count = a * (h//2)
      else:
          count = a * (h//2)
          count += a // 2

  else:
      a = (w//2) * 2 + 1
      if h % 2 == 0:
          count = a * (h//2)
      else:
          count = a * (h//2)
          count += a//2+1

  print(count)

Fixed submission:
h, w = map(int, input().split())
if h == 1 or w == 1:
  print(1)
else:
  if w % 2 == 0:
      a = (w//2) * 2
      if h % 2 == 0:
          count = a * (h//2)
      else:
          count = a * (h//2)
          count += a // 2
  else:
      a = (w//2) * 2 + 1
      if h % 2 == 0:
          count = a * (h//2)
      else:
          count = a * (h//2)
          count += a//2+1

  print(count)
Buggy python submission (verdict: Runtime Error):
def main():
	n=int(input())
	a=list(map(int, input().split()))
	count = 0
	while count==0:
		for i in range(n):
			if  a.count(a[i])> 1:
				count+=1
				print('NO')
				break
			else:
				continue
	if count==0:
		print('YES')
main()

Fixed submission:
def main():
	s,t = map(str,input().split())
	a, b = map(int, input().split())
	u= input()
	if u==s:
		print(str(a-1),str(b))
	else:
		print(str(a),str(b-1))
main()
Buggy python submission (verdict: Runtime Error):
#AtCorder
def main():
	a,b=map(int, input().split())
	for i in range(a)
	if a*10**b <=b*10**a:
		print(str(a)*b)
	else:
		print(str(b)*a)
main()

Fixed submission:
#AtCorder
def main():
	a,b=map(int, input().split())
	if a <=b:
		print(str(a)*b)
	else:
		print(str(b)*a)
main()
Buggy python submission (verdict: Runtime Error):
def main():
	s,t =input().split
	print(t+s)
main()

Fixed submission:
def main():
	s,t =input().split()
	print(t+s)
main()
Buggy python submission (verdict: Runtime Error):
l = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
i = int(input())
print(l[i])


Fixed submission:
l = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
i = int(input())
print(l[i-1])
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int, input().split(" "))

if a == b and a!=c:
    print("Yes")
elif a == c and a!=b:
    print("Yes")
elif b == c and b != a:
    print("Yes")  
else:
    print("No")


Fixed submission:
a,b,c = map(int, input().split(" "))

if a == b and a!=c:
    print("Yes")
elif a == c and a!=b:
    print("Yes")
elif b == c and b != a:
    print("Yes")  
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
a,b,c = map(int, input().split(" "))

if a == b and a!=c:
    print("Yes")
elif a == c and a!=b:
    print("Yes")
elif b == c and b != a:
    print("Yes")  
else:
    print("No")


Fixed submission:
a,b,c = map(int, input().split(" "))

if a == b and a!=c:
    print("Yes")
elif a == c and a!=b:
    print("Yes")
elif b == c and b != a:
    print("Yes")  
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
s, t = input().split()
a, b = map(int, input().split())
u = input()
if u == s:
    print(str(a)-1+" "+str(b))
else:
    print(str(a)+" "+str(b-1))


Fixed submission:
s, t = input().split()
a, b = map(int, input().split())
u = input()
if u == s:
    print(str(a-1)+" "+str(b))
else:
    print(str(a)+" "+str(b-1))
Buggy python submission (verdict: Runtime Error):
from fractions import gcd
 
c,d = [int(i) for i in readline().split()]
 
print(c*d//gcd(c,d))

Fixed submission:
a,b = input().split()
a,b = int(a), int(b)
x = max(a,b)
y = min(a,b)
t = 0
if x % y == 0:
    t = y
else:
    while x % y != 0:
        z = x%y
        x = y
        y = z
    t = z

glm = a * b /t
print(round(glm))

Buggy python submission (verdict: Runtime Error):
import math
a,b = input().split()
a,b = int(a), int(b)
gcd = int(math.gcd(a,b))
glm = a * b /gcd
print(round(glm))

Fixed submission:
a,b = input().split()
a,b = int(a), int(b)
x = max(a,b)
y = min(a,b)
t = 0
if x % y == 0:
    t = y
else:
    while x % y != 0:
        z = x%y
        x = y
        y = z
    t = z

glm = a * b /t
print(round(glm))
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())

if A == 1 and B ==2:
  return 3
elif A == 1 and B ==3:
  return 2
elif A == 2 and B ==1:
  return 3
elif A == 2 and B ==3:
  return 1
elif A == 3 and B ==1:
  return 2
else:
  return 1

Fixed submission:
A = int(input())
B = int(input())
 
if A == 1 and B ==2:
  print(3)
elif A == 1 and B ==3:
  print(2)
elif A == 2 and B ==1:
  print(3)
elif A == 2 and B ==3:
  print(1)
elif A == 3 and B ==1:
  print(2)
else:
  print(1)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int, input().split())
if ((((c-a-b)**2) > (4*a*b)) & (c-a-b > 0)):
  print("Yes")
else:
  print("No")


Fixed submission:
K = int(input())
L = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(L[K-1])
Buggy python submission (verdict: Runtime Error):
h,w = map(int, input().split())
k = h*w
if (h-1)(w-1)==0:
  print(1)
else:
  print(k-int(k/2))


Fixed submission:
h,w = map(int, input().split())
k = h*w
if (h-1)*(w-1)==0:
  print(1)
else:
  print(k-int(k/2))
Buggy python submission (verdict: Runtime Error):
r = None
N = int(input())
if (N % 2)=0:
  r = 1/2
else:
  r = (N+1) / (N*2)
print(r)

Fixed submission:
r = None
N = int(input())
if (N % 2)==0:
  r = 1/2
else:
  r = (N+1) / (N*2)
print(r)
Buggy python submission (verdict: Runtime Error):
N,K = map(int, input().split()))
h = list(map(int, input().split()))
r = 0
for j in range(N):
  if int(h[j]) >= K:
    r += 1
print(r)


Fixed submission:
N,K = list(map(int, input().split()))
h = list(map(int, input().split()))
r = 0
for j in range(N):
  if int(h[j]) >= K:
    r += 1
print(r)

Buggy python submission (verdict: Runtime Error):
N,K = input().split()
N = int(N)
K = int(K)
h = [input().split()]
r = 0
for j in range(N):
  if int(h[j]) >= K:
    r += 1
print(r)


Fixed submission:
N,K = list(map(int, input().split()))
h = list(map(int, input().split()))
r = 0
for j in range(N):
  if int(h[j]) >= K:
    r += 1
print(r)

Buggy python submission (verdict: Runtime Error):
N,K = input().split()
N = int(N)
K = int(K)
h = [int(input()) for i in range(N)]
r = 0
for j in range(N):
  if h[j] >= K:
    r += 1
print(r)


Fixed submission:
N,K = list(map(int, input().split()))
h = list(map(int, input().split()))
r = 0
for j in range(N):
  if int(h[j]) >= K:
    r += 1
print(r)

Buggy python submission (verdict: Runtime Error):
N,K = int(input()).split()
h = [int(input()) for i in range(N)]
r = 0
for j in range(N):
  if h[j] >= K:
    r += 1
print(r)


Fixed submission:
N,K = list(map(int, input().split()))
h = list(map(int, input().split()))
r = 0
for j in range(N):
  if int(h[j]) >= K:
    r += 1
print(r)

Buggy python submission (verdict: Runtime Error):
N,K = int(input().split())
h = [int(input()) for i in range(N)]
r = 0
for j in range(N):
  if h[j] >= K:
    r += 1
print(r)

Fixed submission:
N,K = list(map(int, input().split()))
h = list(map(int, input().split()))
r = 0
for j in range(N):
  if int(h[j]) >= K:
    r += 1
print(r)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
B = [0 for i in range(N)]
for j in range(N):
  B[A[j]] = j+1
print(' '.join(map(str, B)))

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
B = [0 for i in range(N)]
for j in range(N):
  B[A[j]-1] = j+1
print(' '.join(map(str, B)))
Buggy python submission (verdict: Runtime Error):
import 
S = input()
if S == "Sunny":
  print("Cloudy")
elif S == "Cloudy":
  print("Rainy")
else:
  print("Sunny")


Fixed submission:
S = input()
if S == "Sunny":
  print("Cloudy")
elif S == "Cloudy":
  print("Rainy")
else:
  print("Sunny")

Buggy python submission (verdict: Runtime Error):
S = imput()
if S == "Sunny":
  print("Cloudy")
elif S == "Cloudy":
  print("Rainy")
else:
  print("Sunny")

Fixed submission:
S = input()
if S == "Sunny":
  print("Cloudy")
elif S == "Cloudy":
  print("Rainy")
else:
  print("Sunny")
Buggy python submission (verdict: Runtime Error):
s = input()
j = 'Yes'
for i in range(len(s)):
  if (s[i] == 'U') or (s[i] == 'D'):
    continue
  if (s[i] % 2) == 0:
    if (s[i] == 'L'):
      continue
    else:
      j = 'No'
      break
  if (s[i] % 2) == 1:
    if (s[i] == 'R'):
      continue
    else:
      j = 'No'
      break
print(j)

Fixed submission:
s = input()
j = 'Yes'
for i in range(len(s)):
  if (s[i] == 'U') or (s[i] == 'D'):
    continue
  if (i % 2) == 0:
    if (s[i] == 'R'):
      continue
    else:
      j = 'No'
      break
  if (i % 2) == 1:
    if (s[i] == 'L'):
      continue
    else:
      j = 'No'
      break
print(j)
Buggy python submission (verdict: Runtime Error):
n, k, q = map(int, input().split())
inl = [int(x) for x in range(q)]
chl = [0] * n
for z in inl:
  chl[z-1] += 1
for y in chl:
  if y > (q-k):
    print('Yes')
  else:
    print('No')


Fixed submission:
n, k, q = map(int, input().split())
inl = [int(input()) for x in range(q)]
chl = [0] * n
for z in inl:
  chl[z-1] += 1
for y in range(n):
  if chl[y] > (q-k):
    print('Yes')
  else:
    print('No')

Buggy python submission (verdict: Runtime Error):
n, k, q = map(int, input().split())
inl = [int[x] for x in range(q)]
chl = [0] * n
for z in inl:
  chl[z-1] += 1
for y in chl:
  if y > (q-k):
    print('Yes')
  else:
    print('No')


Fixed submission:
n, k, q = map(int, input().split())
inl = [int(input()) for x in range(q)]
chl = [0] * n
for z in inl:
  chl[z-1] += 1
for y in range(n):
  if chl[y] > (q-k):
    print('Yes')
  else:
    print('No')

Buggy python submission (verdict: Runtime Error):
n, k, q = map(int, input.split())
inl = [int[x] for x in range(q)]
chl = [0] * n
for z in inl:
  chl[z-1] += 1
for y in chl:
  if y > (q-k):
    print('Yes')
  else:
    print('No')


Fixed submission:
n, k, q = map(int, input().split())
inl = [int(input()) for x in range(q)]
chl = [0] * n
for z in inl:
  chl[z-1] += 1
for y in range(n):
  if chl[y] > (q-k):
    print('Yes')
  else:
    print('No')
Buggy python submission (verdict: Runtime Error):
    import java.io.BufferedReader;
    import java.io.IOException;
    import java.io.InputStream;
    import java.io.InputStreamReader;
    import java.math.BigInteger;
    import java.util.StringTokenizer;

public class Main {
  private static class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;

    public FastScanner(InputStream in) {
      reader = new BufferedReader(new InputStreamReader(in));
      tokenizer = null;
    }

    public String next() {
      if (tokenizer == null || !tokenizer.hasMoreTokens()) {
        try {
          tokenizer = new StringTokenizer(reader.readLine());
        } catch (IOException e) {
          throw new RuntimeException(e);
        }
      }
      return tokenizer.nextToken();
    }

    public String nextLine() {
      if (tokenizer == null || !tokenizer.hasMoreTokens()) {
        try {
          return reader.readLine();
        } catch (IOException e) {
          throw new RuntimeException(e);
        }
      }

      return tokenizer.nextToken("\n");
    }

    public long nextLong() {
      return Long.parseLong(next());
    }

    public int nextInt() {
      return Integer.parseInt(next());
    }

    public double nextDouble() {
      return Double.parseDouble(next());
    }

    public int[] nextIntArray(int n) {
      int[] a = new int[n];
      for (int i = 0; i < n; i++)
        a[i] = nextInt();
      return a;
    }

    public long[] nextLongArray(int n) {
      long[] a = new long[n];
      for (int i = 0; i < n; i++)
        a[i] = nextLong();
      return a;
    }
  }

  public static void main(String[] args) {
    FastScanner sc = new FastScanner(System.in);
    long a = sc.nextLong();
    long b = sc.nextLong();
    long c = sc.nextLong();
    long d = c - a - b;
    if (d > 0 && 4 * a * b < d * d) {
      System.out.println("Yes");
    } else {
      System.out.println("No");
    }
  }
}

Fixed submission:
def DFS(word,n):
    if len(word)==N:
        return print(word)
    else:
        for i in range(n+1):
            DFS(word+chr(97+i),n+1 if i==n else n)


N=int(input())
DFS("",0)
Buggy python submission (verdict: Runtime Error):
a=map(int,"1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51".split())
b=int(input())
print(a[b-1])

Fixed submission:
a=[1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
b=int(input())
print(a[b-1])
Buggy python submission (verdict: Runtime Error):
n=input()
count=0
if n.len()==1:
  count=int(n)
else:
  count+=9
  if n.len()==3:
    count+=(int(n)//100)*100+int(n)%100+1
  else:
    count+=900
    if n.len()==5:
      count+=(int(n)//10000)*10000+int(n)%10000+1


Fixed submission:
n=input()
count=0
if len(n)==1:
  count=int(n)
if len(n)==2:
  count+=9
if len(n)==3:
    count+=(int(n)//100-1)*100+int(n)%100+10
if len(n)==4:
    count+=909
if len(n)==5:
      count+=(int(n)//10000-1)*10000+int(n)%10000+910
if len(n)==6:
      count+=90909
print(count)
Buggy python submission (verdict: Runtime Error):
n=int(input())
h=map(int,input().split())
if n==1:
  print("Yes")
else:
  for i in range(n-1):
    if h[i]>h[i+1]+1:
      print("No")
    else:
      print("Yes")

Fixed submission:
n=int(input())
h=list(map(int,input().split()))
if n==1:
  print("Yes")
else:
  min=0
  for i in range(n):
    if h[i]>min:
      min=h[i]-1
    if h[i]<min:
      print("No")
      break
  else:
      print("Yes")
Buggy python submission (verdict: Runtime Error):
a,b=map(int,input())
if a<13:
  if 5<a:
    print(b/2)
  else:
    print(0)
else:
  print(b)


Fixed submission:
a,b=map(int,input().split())
if a<13:
  if 5<a:
    print(b//2)
  else:
    print(0)
else:
  print(b)

Buggy python submission (verdict: Runtime Error):
a,b=map(int,input())
if a<13:
  if 5<a:
  print(b/2)
  else:
    print(0)
else:
  print(b)

Fixed submission:
a,b=map(int,input().split())
if a<13:
  if 5<a:
    print(b//2)
  else:
    print(0)
else:
  print(b)
Buggy python submission (verdict: Runtime Error):
a=int(input())
if(0<a%100<13):
  if(0<a//100<13):
    print("AMBIGUOUS")
  else:
    print("MMYY")
else:
    if(0<a//100<13):
      print("YYMM")
    else:
      print("NA")


Fixed submission:
n,k=map(int,input().split())
s=list(input())
t=s.pop(k-1)
s.insert(k-1,t.lower())
print("".join(s))

Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
s=list(input())
t=s.pop(k-1)
s.insert(k-1,t.lower())
print("".join(s)

Fixed submission:
n,k=map(int,input().split())
s=list(input())
t=s.pop(k-1)
s.insert(k-1,t.lower())
print("".join(s))

Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
s=input()
t=s.pop(k-1)
s.insert(k-1,t.lower())
print(s)

Fixed submission:
n,k=map(int,input().split())
s=list(input())
t=s.pop(k-1)
s.insert(k-1,t.lower())
print("".join(s))

Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split)
s=input()
t=s.pop(k-1)
s.insert(k-1,t.lower())
print(s)

Fixed submission:
n,k=map(int,input().split())
s=list(input())
t=s.pop(k-1)
s.insert(k-1,t.lower())
print("".join(s))

Buggy python submission (verdict: Runtime Error):
n,k=map(int,input())
s=input()
t=s.pop(k-1)
s.insert(k-1,t.lower())
print(s)

Fixed submission:
n,k=map(int,input().split())
s=list(input())
t=s.pop(k-1)
s.insert(k-1,t.lower())
print("".join(s))
Buggy python submission (verdict: Runtime Error):
a=int(input())
if(0<a%100<13):
  if(0<a//100<13):
    print("AMBIGUOUS")
  else:
    print("MMYY")
  else:
    if(0<a//100<13):
      print("YYMM")
    else:
      print("NA")

Fixed submission:
a=int(input())
if(0<a%100<13):
  if(0<a//100<13):
    print("AMBIGUOUS")
  else:
    print("YYMM")
else:
    if(0<a//100<13):
      print("MMYY")
    else:
      print("NA")
Buggy python submission (verdict: Runtime Error):
a=map(int,input().split())
print(max([2*a[0]-1,2*a[1]-1,a[0]+a[1]]))

Fixed submission:
a=list(map(int,input().split()))
print(max([2*a[0]-1,2*a[1]-1,a[0]+a[1]]))

Buggy python submission (verdict: Runtime Error):
a=map(int,input().split())
print(max([2*a[0]-1,2*a[1]-1,a[0]+a[1]])

Fixed submission:
a=list(map(int,input().split()))
print(max([2*a[0]-1,2*a[1]-1,a[0]+a[1]]))
Buggy python submission (verdict: Runtime Error):
s=input()
count1=0
for i in range(0,len(s)-1,2):
  if s[i]=='0':
    count+=1
  if s[i+1]=='1':
    count+=1
if len(s)%2==1:
  if s[len(s)-1]=='0':
    count+=1
print(min(count,len(s)-count))

Fixed submission:
s=input()
count=0
for i in range(0,len(s)-1,2):
  if s[i]=='0':
    count+=1
  if s[i+1]=='1':
    count+=1
if len(s)%2==1:
  if s[len(s)-1]=='0':
    count+=1
print(min(count,len(s)-count))
Buggy python submission (verdict: Runtime Error):
print((int(input())+1)//sorted([input() for _ in range(5)])+5)

Fixed submission:
a=sorted([int(input()) for _ in range(5)])
print("Yay!" if a[4]-a[0]<=int(input()) else ":(")

Buggy python submission (verdict: Runtime Error):
a=sorted([int(input()) for _ in range(5)])
ls=sorted([a[i+1]-a[i] for i in range(4)])
print("Yay!" if ls[4]<input() else ":(")

Fixed submission:
a=sorted([int(input()) for _ in range(5)])
print("Yay!" if a[4]-a[0]<=int(input()) else ":(")
Buggy python submission (verdict: Runtime Error):
S = input()
L=len(S)
longest=0
for i in range(L):
  for j in range(i+1):
    DUP=S[j:i]
    DUP=DUP.replace("A","#")
    DUP=DUP.replace("T","#")
    DUP=DUP.replace("G","#")
    DUP=DUP.replace("C","#")
    count=0
    for a in range(len(DUP)):
      if DUP[a]=="#":
        count+=1
      else:
        break
    else:
      longest=max(longest,count)
print(longest)
S = input()
L=len(S)
longest=0
for i in range(L):
  for j in range(i+1):
    DUP=S[j:i+1]
    DUP=DUP.replace("A","#")
    DUP=DUP.replace("T","#")
    DUP=DUP.replace("G","#")
    DUP=DUP.replace("C","#")
    count=0
    for a in range(len(DUP)):
      if DUP[a]=="#":
        count+=1
      else:
        break
    else:
      longest=max(longest,count)
print(longest)


Fixed submission:
IN=input()
print("A"if IN=="T" else "C" if IN=="G" else "T" if IN=="A" else "G")
Buggy python submission (verdict: Runtime Error):
S = input()
L=len(S)
longest=0
for i in range(L):
  for j in range(i+1):
    DUP=S[j:i]
    DUP=DUP.replace("A","#")
    DUP=DUP.replace("T","#")
    DUP=DUP.replace("G","#")
    DUP=DUP.replace("C","#")
    count=0
    for a in range(len(DUP)):
      if DUP[a]=="#":
        count+=1
      else:
        break
    else:
      longest=max(longest,count)
print(longest)
S = input()
L=len(S)
longest=0
for i in range(L):
  for j in range(i+1):
    DUP=S[j:i+1]
    DUP=DUP.replace("A","#")
    DUP=DUP.replace("T","#")
    DUP=DUP.replace("G","#")
    DUP=DUP.replace("C","#")
    count=0
    for a in range(len(DUP)):
      if DUP[a]=="#":
        count+=1
      else:
        break
    else:
      longest=max(longest,count)
print(longest)


Fixed submission:
S = input()
L=len(S)
longest=0
for i in range(L):
  for j in range(i+1):
    DUP=S[j:i+1]
    DUP=DUP.replace("A","#")
    DUP=DUP.replace("T","#")
    DUP=DUP.replace("G","#")
    DUP=DUP.replace("C","#")
    count=0
    for a in range(len(DUP)):
      if DUP[a]=="#":
        count+=1
      else:
        break
    else:
      longest=max(longest,count)
print(longest)
Buggy python submission (verdict: Time Limit Exceeded):
a,b=[int(x) for x in input().split()]
if a>b:
  a,b=b,a
tmp=0
for p in range(a,b+1):
  tmp^=p
print(tmp)


Fixed submission:
a,b=[int(x)for x in input().split()]
if a>b :
  a,b=b,a
l=a%4
m=b%4
tmp=0
for p in range(a,a+4-l):
  tmp^=p
for p in range(b-m,b+1):
  tmp^=p
print(tmp)
Buggy python submission (verdict: Runtime Error):
from sys import stdin
d=int(stdin.readline().rstrip())
extent=" Eve"*(25-d)
print(f"Christmas{extent}")

Fixed submission:
from sys import stdin
d=int(stdin.readline().rstrip())
extent="Eve "*(25-d)
print("Christmas",extent)