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

Fixed submission:
# Setup
import sys
sys.setrecursionlimit(4100000)

a, b = [int(i) for i in input().split()]
c = [b-int(i) for i in input().split()]
import fractions
if a >= 2:
  temp = fractions.gcd(c[1],c[0])
  for i in range(2,a):
      temp = fractions.gcd(temp,c[i])
  print(abs(temp))
else:
  print(abs(c[0]))

Buggy submission (verdict: Runtime Error):
# Setup
import sys
sys.setrecursionlimit(4100000)

a, b = [int(i) for i in input().split()]
c = [b-int(i) for i in input().split()]
import fractions
import fractions
temp = fractions.gcd(c[1],c[0])
for i in range(2,a):
    temp = fractions.gcd(temp,c[i])
print(temp)
Problem p03282 (python)

Fixed submission:
S = input()
K = int(input())
 
if K == 1:
    print(S[0])
    exit()
else:
    for i in range(K):
        if S[i] != '1':
            print(S[i])
            exit()
print(1)

Buggy submission (verdict: Runtime Error):
s = str(input())
        k = int(input())
        for i in s:
            if i != "1":
                print(i)
                break
Problem p03759 (python)

Fixed submission:
a,b,c = map(int, input().split())
print('YES') if b - a == c - b else print('NO')

Buggy submission (verdict: Runtime Error):
import sys

a = int(input())
b = int(input())
c = int(input())

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

Buggy submission (verdict: Runtime Error):
a,b,c = int(input()), int(input()), int(input())

if b - a == c - a:
    print('YES')
else:
    print('NO')
Problem p03761 (python)

Fixed submission:
from collections import Counter as mset

n = int(input())
inputs = []
for i in range(n):
    inputs.append(input())

intersection = mset(inputs.pop(0))

for w in inputs:
    intersection = mset(w) & intersection

print(''.join(sorted(list(intersection.elements()))))

Buggy submission (verdict: Runtime Error):
from collections import Counter as mset

n = int(input())
intersection = input()
for i in range(n - 1):
    intersection = intersection & mset(input())

print(''.join(sorted(list(intersection.elements()))))
Problem p03773 (python)

Fixed submission:
a,b=map(int,input().split())
print((a + b) % 24)

Buggy submission (verdict: Runtime Error):
N,M = list(map(int, input().split()))
 
s = [list(map(int,input().split())) for i in range(n)]
c = [list(map(int,input().split())) for j in range(n)]
 
for t1 in s:
    l = list(map(lambda x: abs(t1[0] - x[0]) + abs(t1[1] - x[1]), c))
    print(l.index(min(l)) + 1)
Problem p02741 (python)

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]
z = input()
n = int(z) - 1
print(l[n])

Buggy 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]
z = input()
n = int(z) +1
print(l[n])

Buggy 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]
z = input()
print(l[z+1])
Problem p02882 (python)

Fixed submission:
from math import degrees,atan 
a,b,x=map(int,input().split())
print(degrees(atan((a*b*b)/(2*x))) if x <=a*a*b/2 else degrees(atan((2*b)/a-(2*x)/(a*a*a))))

Buggy submission (verdict: Runtime Error):
from math import degrees,atan 
a,b,x=map(int,input().split())
print(math.degrees(math.atan(a*b*b/2*x)) if x <=a*a*b/2 else math.degrees(math.atan(2*b/a-2*x/a*a*a)))
Problem p02921 (python)

Fixed submission:
s=input()
t=input()
cnt=0
for i in range(3):
	if s[i]==t[i]:
		cnt+=1
		continue
	else:
		continue
print(cnt)

Buggy submission (verdict: Runtime Error):
limit=int(input())
sum=((limit-1)*limit//2)
print(sum)
Problem p02923 (python)

Fixed submission:
N=int(input())
h=list(map(int,input().split()))
cnt=[]
l=0

if N==1:
	print(0)
	exit()

for n in range(1,N):
	if h[n-1]>=h[n]:
		l+=1
		if n==N-1:
			cnt.append(l)
			break
		continue
	elif h[n-1]<h[n]:
		cnt.append(l)
		l=0
		continue
print(max(cnt))

Buggy submission (verdict: Runtime Error):
N=int(input())
h=list(map(int,input().split()))
cnt=[]
l=0

for n in range(1,N):
	if h[n-1]>=h[n]:
		l+=1
		if n==N-1:
			cnt.append(l)
			break
		continue
	elif h[n-1]<h[n]:
		cnt.append(l)
		l=0
		continue
print(max(cnt))
Problem p03308 (python)

Fixed submission:
A =int(input())
l =list(map(int,input().split()))
s =(sorted(l))
print(s[-1]-s[0])

Buggy submission (verdict: Runtime Error):
 =int(input())
l =list(map(int,input().split()))
s =(sorted(l))
print(s[-1]-s[0])
Problem p03331 (python)

Fixed submission:
n=int(input())
val=10**5
for a in range(1,n):
	if sum(map(int,str(a)))+sum(map(int,str(n-a)))< val:
		val = sum(map(int,str(a))) + sum(map(int,str(n-a)))
print(val)

Buggy submission (verdict: Runtime Error):
n=int(input())
print(min(sum(map(int,str(a)))+sum(map(int,str(n-a))))) for a in range(1,n))
Problem p03369 (python)

Fixed submission:
s=input()
t=s.count('o')
print(700+t*100)

Buggy submission (verdict: Runtime Error):
s=input()
t=count('o')
print(700+t*100)
Problem p03370 (python)

Fixed submission:
l=list(map(int,input().split()))
N = l[0]
X = l[1]
list_m = [int(input()) for x in range(N)]
list_m.sort()
s = sum(list_m)
r = X - s
for i in range(10**5):
	r -= list_m[0]
	if r < 0:
		lim = i 
		break
print(N + lim)

Buggy submission (verdict: Runtime Error):
=list(map(int,input().split()))
N = l[0]
X = l[1]
list_m = [int(input()) for x in range(N)]
list_m.sort()
s = sum(list_m)
r = X - s
for i in range(10**5):
	r -= list_m[0]
	if r < 0:
		lim = i 
		break
print(N + lim)
Problem p03408 (python)

Fixed submission:
n=int(input())
nl=[input() for i in range(n)]
m=int(input())
ml=[input() for i in range(m)]
nsl=list(set(nl))
mx=0
for x in range(len(nsl)):
	d=nl.count(nsl[x])-ml.count(nsl[x])
	if d>mx:mx=d
print(max(0,mx))

Buggy submission (verdict: Runtime Error):
n=int(input())
nl=[input() for i in range(n)]
m=int(input())
ml=[input() for i in range(n)]
nsl=list(set(nl))
mx=0
for x in range(len(nsl)):
	d=nl.count(nsl[x])-ml.count(nsl[x])
	if d>mx:mx=d
print(max(0,mx))

Buggy submission (verdict: Runtime Error):
from collections import*
c=Counter.most_common
n=int(input())
n_l =[int(input()) for i in range(n)]
m=int(input())
m_l =[int(input()) for i in range(m)]
d=n_l.c()[0][1]-m_l.c()[-1][1]
if d <=0:print(0)
else:print(d)

Buggy submission (verdict: Runtime Error):
from collections import*
c=Counter.most_common
n=int(input())
n_l =[input() for i in range(n)]
m=int(input())
m_l =[input() for i in range(m)]
d=n_l.c()[0][1]-m_l.c()[-1][1]
if d <=0:print(0)
else:print(d)
Problem p03471 (python)

Fixed submission:
n,y=map(int,input().split())
A,B,C=[-1,-1,-1]
f=True
for a in range(n+1):
	for b in range(n+1):
		if 10000*a+5000*b+1000*(n-a-b)==y and 0<=n-a-b<=n:
			A,B,C=[a,b,n-a-b]
			f=False
			break
	if f==False:
		break
print(A,B,C)

Buggy submission (verdict: Runtime Error):
n,y=map(int,input().split())
A,B,C=[-1,-1,-1]
f=True
for a in range(n+1):
	for b in range(n+1):
		if 10000*a+5000*b+1000*(n-a-b)==y and 0<=n-a-b<=n:
			A,B,C=[a,b,n-a-b]
			f=False
			break
	if f==False:
		break
print(A,B,C)
Problem p03478 (python)

Fixed submission:
N,A,B =map(int,input().split())
print(sum(i for i in range(N+1) if A <= sum(map(int,str(i))) <= B))

Buggy submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline
N,A,B=list(map(int,input(),split())
print(sum(i for i in range(N)) if A <= sum(map(int,str(i))) <= B))

Buggy submission (verdict: Runtime Error):
N,A,B =map(int,input().split())
print(sum(i for i in range(n+1) if A <= sum(map(int,str(i))) <= B))

Buggy submission (verdict: Runtime Error):
N,A,B = [map(int,input().split())]
print(sum(i for i in range(n+1)) if A <= sum(map(int,str(i))) <= B)

Buggy submission (verdict: Runtime Error):
N,A,B = [map(int,input().split())]
print(sum(i for i in range(n+1) if A <= sum(map(int,str(i))) <= B))
Problem p03493 (python)

Fixed submission:
s = input()
print(s.count('1'))

Buggy submission (verdict: Runtime Error):
N = int(input())
a = list(map(int, input().split()))
point = 0
while True:
	A =[x % 2 for x in a]
	if A.count(0) != N:
		break
	 = [x // 2 for x in a]
	point += 1
print(point)
Problem p03494 (python)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
 
count = 0
flag = True
while flag:
    for i in range(len(a)):
        if a[i] % 2 == 1:
            flag = False
        else:
            a[i] //= 2
    count += 1
 
print(count - 1)

Buggy submission (verdict: Runtime Error):
N = int(input())
a = list(map(int, input().split()))
point = 0
while True:
	for i in range(len(a)):
		if a[i] % 2 == 1:
			break
		else:
			point += 1
			a[i] //= 2
	print(point-1)
    break
Problem p03495 (python)

Fixed submission:
from collections import*
n,k=[int(i) for i in input().split()]
l=input().split()
a=Counter(l)
ca=a.most_common()
val=len(set(l))
s=0
if val < k:
	k=val
for i in range(k):
	s +=ca[i][1]
print(n-s)

Buggy submission (verdict: Runtime Error):
from collections import*
n,k=[int(i) for i in input().split()]
l=input().split()
a=Counter(l)
ca=a.most_common()
val=len(set(l))
s=0
if val < k:
	k=val
for i in range(k):
	s +=ca[i][1]
print(n-s)
Problem p03502 (python)

Fixed submission:
n = input()
print("Yes" if int(n) % sum(map(int,n)) == 0 else "No")

Buggy submission (verdict: Runtime Error):
N = input()
sum=0
for i in range(len(N)):
	sum += int(i)
print('Yes' if int(N) // sum == 0 else 'No')

Buggy submission (verdict: Runtime Error):
N = input()
sum=0
for i in range(int(N)):
	sum += int(i)
print('Yes' if int(N) // sum == 0 else 'No')

Buggy submission (verdict: Runtime Error):
N = input()
sum=0
for i in range(int(N)):
	sum += int(i)
print('Yes' if int(N) // sum == 0 else 'No')
Problem p03611 (python)

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 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)
Problem p03814 (python)

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 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)

Buggy 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)
Problem p02742 (python)

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 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)
Problem p02817 (python)

Fixed submission:
def main():
	s,t =input().split()
	print(t+s)
main()

Buggy submission (verdict: Runtime Error):
def main():
	s,t =input().split
	print(t+s)
main()
Problem p02741 (python)

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 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])
Problem p02741 (python)

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 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")
Problem p02742 (python)

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 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))
Problem p02898 (python)

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 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)

Buggy 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)

Buggy 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)

Buggy 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)

Buggy 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)
Problem p02899 (python)

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 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)))
Problem p02909 (python)

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

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

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

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 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)
Problem p02911 (python)

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 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')

Buggy 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')

Buggy 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')
Problem p02744 (python)

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 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");
    }
  }
}
Problem p02741 (python)

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 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])
Problem p02952 (python)

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 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
Problem p02953 (python)

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 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")
Problem p03035 (python)

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

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

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

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

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

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

Fixed submission:
IN=input()
print("A"if IN=="T" else "C" if IN=="G" else "T" if IN=="A" else "G")

Buggy 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)
Problem p03086 (python)

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 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)
Problem p03206 (python)

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

Buggy submission (verdict: Runtime Error):
from sys import stdin
d=int(stdin.readline().rstrip())
extent=" Eve"*(25-d)
print(f"Christmas{extent}")
Problem p03486 (python)

Fixed submission:
a,b=input(), input()
aa=[A for A in a]
aa.sort()
bb=[B for B in b]
bb.sort(reverse=1)
print("No" if aa>=bb else "Yes")

Buggy submission (verdict: Runtime Error):
in1.sort() = [c for c in input()]
in2.sort(reversed=1) = [c for c in input()]
print("Yes" if in1<in2 else "No")

Buggy submission (verdict: Runtime Error):
print("Yes" if [c for c in input()].sort()<[c for c in input()].sort(reversed=1) else "No")

Buggy submission (verdict: Runtime Error):
print("Yes" if [c for c in input()].sort()<[c for c in input()].sort(reversed=1) else "No"
Problem p02741 (python)

Fixed submission:
# coding: utf-8

num_array = [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]

k = int(input())

print("{}".format(num_array[k-1]))

Buggy submission (verdict: Runtime Error):
# coding: utf-8

num_array = [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("{}".format(num_array[k-1]))