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

Fixed submission:
N = int(input())
xy = [list(map(int,input().split())) for i in range(N)]
x = [xy[i][0] for i in range(N)]
y = [xy[i][1] for i in range(N)]
if N == 1:
    print(1)
    exit()
else:
    ans = N
    for i in range(N):
        for j in range(N):
            if i == j:
                continue
            dx,dy = x[j]-x[i],y[j]-y[i]
            cnt = 0
            for k in range(N):
                for l in range(N):
                    if k == l:
                        continue
                    if dx == x[k]-x[l] and dy == y[k]-y[l]:
                        cnt += 1
            ans = min(ans,N-cnt)

print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
xy = [list(map(int,input().split())) for i in range(N)]
x = [xy[i][0] for i in range(N)]
y = [xy[i][1] for j in range(N)]
if N == 1:
    print(1)
    exit()
else:
    ans = N
    for i in range(N):
        for j in range(N):
            if i == j:
                continue
            dx,dy = x[j]-x[i],y[j]-y[i]
            cnt = 0
            for k in range(N):
                for l in range(N):
                    if k == l:
                        continue
                    if dx == x[k]-x[l] and dy == y[k]-y[l]:
                        cnt += 1
            ans = min(ans,N-cnt)

print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
xy = [list(map(int,input().split())) for i in range(N)]
cst = 1
xy.sort(key = lambda x:x[0])
keep = xy[0]
p = xy[1][0]-xy[0][0]
q = xy[1][1]-xy[0][1]
if N != 1:
    for i in range(1,N-1):
        if not(xy[i][0] == keep[0]+p and xy[i][1] == keep[1]+q):
            cst += 1
            p = xy[i+1][0] - xy[i][0]
            q = xy[i+1][1] - xy[i][1]
            keep = xy[i+1]
else:
    print(1)

print(cst)

Buggy submission (verdict: Runtime Error):
N = int(input())
xy = [list(map(int,input().split())) for i in range(N)]
cst = 1
keep = xy[0]
xy.sort(key = lambda x:x[0])
p = xy[1][0]-xy[0][0]
q = xy[1][1]-xy[0][1]
for i in range(1,N-1):
    if not(xy[i][0] == keep[0]+p and xy[i][1] == keep[1]+q):
        cst += 1
        p = xy[i+1][0] - xy[i][0]
        q = xy[i+1][1] - xy[i][1]
        keep = xy[i+1]

print(cst)
Problem p03047 (python)

Fixed submission:
N,K = map(int,input().split())
print(N-K+1)

Buggy submission (verdict: Runtime Error):
N = int(input())
s = [input() for i in range(N)]
ABcount = 0
for i in s:
    ABcount += i.count("AB")
bvva = 0
bvvv = 0
vvva = 0
for i in s:
    if i[0] == "B" and i[-1] == "A":
        bvva += 1
    elif i[0] == "B":
        bvvv += 1
    elif i[-1] == "A":
        vvva += 1
if vvva != 0:
    if bvvv != 0:
        print(ABcount+bvva+1+(min(vvva-1,bvvv-1)))
    else:
        print(ABcount+bvva)
else:
    if bvvv != 0:
        print(ABcount+bvva)
    else:
        print(max(ABcount+bvva-1),0)
Problem p03071 (python)

Fixed submission:
A,B = map(int,input().split())
X = max(A,B)
Y = min(A,B)
if X+Y >= 2:
    print(max(A,B)+max(max(A,B)-1,min(A,B)))
else:
    print(X+Y)

Buggy submission (verdict: Runtime Error):
A,B = map(int,input().split())
print(max(A,B)+max(max(A-1,B),max(A,B-1))
Problem p03076 (python)

Fixed submission:
a = [int(input()) for i in range(5)]
A = []
for i in range(5):
    if a[i]%10!=0:
        A.append(10-a[i]%10)
        a[i] += 10-a[i]%10
 
A.sort()
print(sum(a)-A[-1] if len(A) != 0 else sum(a))

Buggy submission (verdict: Runtime Error):
a = [int(input()) for i in range(5)]
A = []
for i in range(5):
    if a[i]%10!=0:
        A.append(10-a[i]%10)
        a[i] += 10-a[i]%10

A.sort()
print(sum(a)-A[-1])
Problem p03085 (python)

Fixed submission:
b = input()
L = [["A","T"],["C","G"]]
for i in range(2):
    if b in L[i]:
        if L[i][0] == b:
            print(L[i][1])
        else:
            print(L[i][0])

Buggy submission (verdict: Runtime Error):
b = input()
if b == "A":
    print("T")
elif b == "T":
    print("A")
else b == "G":
    print("C")
else:
    print("G")
Problem p03206 (python)

Fixed submission:
# -*- coding: utf-8 -*-
D = int(input())
print("Christmas " + "Eve "*(25 - D))

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
D = int(input())
print("Christmas"+"Eve"*(D-25).split())

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
N = int(input)
print("Christmas" + "Eve"*(25 - n))

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
N = int(input)
print("Christmas" + "Eve"*(25 - n).split())

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
N = int(input)
print("Christmas" + "Eve"*(25 - n).split)
Problem p03210 (python)

Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
X = int(input())
def f(n):
  if (n == 3)or(n == 5)or(n == 7):
    return "YES"
  else:
    return "NO"
    
print("{}".format(f(X)))

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-
X = int(input())
def f(n):
  if n == 3,5,7:
    print("YES")
  else:
    print("NO")
    
print("{}".format(f(X)))

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-
X = int(input())
def f(n):
  if (n = 3) or (n = 5)or (n = 7):
    print("YES")
  else:
    print("NO")
    
print("{}".format(f(X)))
Problem p03219 (python)

Fixed submission:
#!usr/bin/env python
# -*- coding: utf-8 -*-
X , Y= map(int,input().split())
print("{}".format(X + Y // 2))

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
X,Y= "int(input())","int(input())"
print("{}".format(X + 2 //Y))

Buggy submission (verdict: Runtime Error):
#!usr/bin/env python
# -*- coding: utf-8 -*-
X , Y= int(input()), int(input())
print("{}".format(X + Y // 2))

Buggy submission (verdict: Runtime Error):
#!usr/bin/env python
# -*- coding: utf-8 -*-
X , Y = int(input()), int(input())
print("{}".format(X+Y//2))
Problem p03239 (python)

Fixed submission:
N,T = map(int,input().split())

ct = [list(map(int,input().split())) for i in range(N)]

c = []
t = []

for i in range(N):
    c.append(ct[i][0])
    t.append(ct[i][1])

minc = 10000

for i in range(len(c)):
    if t[i] <= T and c[i] < minc:
        minc = c[i]

if minc == 10000:
    print("TLE")
else:
    print(minc)

Buggy submission (verdict: Runtime Error):
N,T = map(int,input().split())
for i in range(N):
  c,t = map(int,input())
a = 1000
for i in range(N):
  if t <= T:
    a = min(a,c)
if a = 1000:
  print("TLE")
else:
  print(a)

Buggy submission (verdict: Runtime Error):
N,T = map(int,input().split())
for i in range(N):
  c,t = list(map(int,input()))
a = 1000
for i in range(N):
  if t <= T:
    a = min(a,c)
if a = 1000:
  print("TLE")
else:
  print(a)

Buggy submission (verdict: Runtime Error):
N,T = map(int,input().split())
c,t = [map(int,input()) for i in range(N)]
a = 1000
for i in range(N):
  if t <= T:
    a = min(a,c)
if a = 1000:
  print("TLE")
else:
  print(a)

Buggy submission (verdict: Runtime Error):
N,T = map(int,input().split())
dic = {}
for i in range(N):
    dic[int(input())] = int(input())
L = sorted(dic.dict_keys)
for i in range(N):
    if dic[i] <T:
        print(L[i])
        break
print("TLE")

Buggy submission (verdict: Runtime Error):
N,T = map(int,input().split())
a= [map(int,input().split()) for i in range(N)]
b = []
for i in range(N):
    b.append(a[i][0])
L = sorted(b)
i = 0
while i < N:
    if L[i] < T:
        print(L[i])
        break
    else:
        i = i+1
        continue
if i == N:
    print("TLE")

Buggy submission (verdict: Runtime Error):
N,T = map(int,input().split())
for i in range(N):
  dic  = {int(input()):int(input())}
a = sorted(dic.get())
for i in range(N):
  if dic[a[i]] <= T:
    print(a[i])
  else:
    continue
Problem p03251 (python)

Fixed submission:
N,M,X,Y = map(int,input().split())
x = list(map(int,input().split()))
y = list(map(int,input().split()))
x.append(X)
y.append(Y)
if min(y) >= max(x)+1:
  print("No War")
else:
  print("War")

Buggy submission (verdict: Runtime Error):
N,M,X,Y = map(int,input().split())
x = list(map(int,input().split()))
y = list(map(int,input().split()))
p = x.append(X)
q = y.append(Y)
if min(q) >= max(p):
  print("No War")
else:
  print("War")

Buggy submission (verdict: Runtime Error):
N,M,X,Y = map(int,input().split())
x = list(map(int,input().split() for i in range(N)))
y = list(map(int,input().split() for i in range(N)))
if min(y)-max(x) < 1:
  print("War")
else:
  print("No War")
Problem p03260 (python)

Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
A,B = map(int, input().split())
if (A == 2) or (B == 2):
  print("No")
else:
  print("Yes")

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-
A,B = map(int, input().split())
if (A = 2) or (B = 2):
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-
if (A = 2) or (B = 2):
  print("Yes")
else:
  print("No")
Problem p03261 (python)

Fixed submission:
N = int(input())
W = []
for i in range(N):
    W.append(str(input()))
ans = "No"
startwith = []
endwith = []
if len(set(W)) == len(W):
   for i in W:
       startwith.append(i[0])
       endwith.append(i[-1])
   startwith.pop(0)
   endwith.pop(-1)
   if startwith == endwith:
    ans = "Yes"

print(ans)

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
N = int(input())
a = [input() for i in range(N)]
for i in range(N):
  if a[i][len(a[i])]==a[i+1][0]:
    continue
  else:
    break
    print("No")
print("Yes")

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
N = int(input())
a = [input() for i in range(N)]
for i in range(N):
  if a[i][len(a[i])]=a[i+1][0]:
    continue
  else:
    break
    print("No")
print("Yes")
Problem p03262 (python)

Fixed submission:
N,X = map(int,input().split())
x = list(map(int,input().split()))

x.sort()

def gcd(x,y):
    X = max(x,y)
    Y = min(x,y)
    if Y == 0:
        return X
    else:
        return gcd(Y,X%Y)

keepgcd = 0
maxgcd = 10**9

if N >= 2:
   for i in range(N-1):
       keepgcd = gcd(abs(X-x[i+1]),abs(X-x[i]))
       if maxgcd > keepgcd:
          maxgcd = keepgcd
   print(maxgcd)
else:
    print(max(x[0],X)-min(x[0],X))

Buggy submission (verdict: Runtime Error):
import math

N,X = map(int,input().split())
x = list(map(int,input().split()))

x.append(X)

xsub = []

if N >= 2:
    for i in range(N-1):
         xsub.append(x[i+1]-x[i])

    A = []

    for i in range(N-2):
         A.append(math.gcd(xsub[i+1],xsub[i]))

    print(min(A))

else:
    print(abs(x[0]-X))

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

x.append(X)

xsub = []

if N >= 2:
    for i in range(N-1):
         xsub.append(x[i+1]-x[i])

else:
    print(abs(x[0]-X))

import math

A = []

for i in range(N-2):
    A.append(math.gcd(xsub[i+1],xsub[i]))

print(min(A))

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

x.append(X)

xsub = []

if N >= 2:
    for i in range(N-1):
         xsub.append(x[i+1]-x[i])

else:
    print(abs(x[0]-X))

import sympy

A = []

for i in range(N-2):
    A.append(sympy.gcd(xsub[i+1],xsub[i]))

print(min(A))
Problem p03264 (python)

Fixed submission:
# -*- coding: utf-8 -*-
K = int(input())
if K % 2 == 0:
  print((K//2)*(K//2))
elif K % 2 == 1:
  print(((K+1)//2)*((K-1)//2))

Buggy submission (verdict: Runtime Error):
x1,x2,y1,y2 = map(int,input().split())
x3 = x2 + (y1 - y2)
y3 = y2 + (x2 - x1)
x4 = y1 + (x2 - x1)
y4 = x1 + (y1 - y2)
print(x3,y3,x4,y4)

Buggy submission (verdict: Runtime Error):
x1,y1,x2,y2 = map(int,input().split())
x3 = y1 - y2
y3 = abs(x1 - x2)
x4 = abs(y2 - y3)
y4 = abs(x2 - x3)
print(x3,y3,x4,y4)
Problem p03280 (python)

Fixed submission:
# -*-  coding: utf-8 -*-
n,m=map(int,input().split())
print("{}".format((n-1)*(m-1)))

Buggy submission (verdict: Runtime Error):
A,B = map(int,input().aplir())
print((A-1)*(B-1))

Buggy submission (verdict: Runtime Error):
S = input()
K = int(input())
L = [int(i) for i in S]
count = 1
for i in L:
    if i != 1:
        if count <= K:
            print(i)
        else:
            print(1)
        exit()
    else:
        count += 1
print(1)
Problem p03281 (python)

Fixed submission:
N = int(input())
if N < 105:
  print(0)
elif 105 <= N < 135:
  print(1)
elif 135 <= N < 165:
  print(2)
elif 165 <= N < 189:
  print(3)
elif 189 <= N < 195:
  print(4)
else:
  print(5)

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
N = int(input())
b = []
def f(n):
  for i in range[N+1]:
    a = [] #約数の個数を入れていくリスト
    while n>1:
      if n // i == 0:
      a.append(1) #リストに1を追加
      i = i+1
      else:
      i = i+1:continue
        
while N>1:
  f(N) #関数の実行
  if sum(a) == 8:
  b.append(1)#条件を満たす数をリストイン
  a.clear()
  N = N-1
  else:
  N = N-1

print(sum(b))
Problem p03302 (python)

Fixed submission:
a,b = map(int,input().split())
if a+b == 15:
        print("+")
elif a*b == 15:
        print("*")
else:
        print("x")

Buggy submission (verdict: Runtime Error):
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush,heapify
from fractions import gcd
from copy import deepcopy
import math
import queue
import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys
sys.setrecursionlimit(100000) 
  
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[py] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)

def main(): #startline-------------------------------------------
    a,b = map(int,input().split())
    if a+b == 15:
        print("+")
    elif a*b == 15:
        print("*")
    else:
        print("x")
if __name__ == "__main__":
    main() #endline===============================================
Problem p03316 (python)

Fixed submission:
# -*- coding: utf-8 -*-
S = str(input())
L = []
for i in range(len(S)):
  L.append(int(S[i]))
M = sum(L)
if int(S) % M == 0:
  print("Yes")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
S = str(input())
L = []
for i in range(len(S)):
  L.append(S[i])
M = sum(L)
if int(S) % M == 0:
  print("Yes")
else:
  print("No")
Problem p03323 (python)

Fixed submission:
# -*- coding: utf-8 -*-
A,B =map(int,input().split())
if A <= 8 and B <= 8:
  print("Yay!")
else:
  print(":(")

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
A,B=map(int,input().split())
if A <= 8 and B <= 8:
  print(Yay!)
else:
  print(:()

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
A,B=map(int,input().split)
if A <= 8 and B <= 8:
  print("Yay!")
else:
  print(":(")

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
A,B=map(int,input().split)
if A <= 8 and B <= 8:
  print(Yay!)
else:
  print(:()
Problem p03338 (python)

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

A = []

for i in range(1,N+1):
    ans = 0
    X = S[:i]
    Y = S[i:len(S)+1]
    L = []
    M = []
    for j in range(len(X)):
        L.append(X[j])
    for k in range(len(Y)):
        M.append(Y[k])
    LS = set(L)
    for l in LS:
         if l in M:
            ans += 1

    A.append(ans)

print(max(A))

Buggy submission (verdict: Runtime Error):
N = int(input())
S = str(input())

for i in range(len(S)):
    a = []
    S_former = S[:i]
    S_latter = S[i:]
    for sub1 in S_former:
        if sub1 in S_latter:
           a.append(1)
           S_former.replace(sub1,"")
    b = sum(a)

print(max(b))
Problem p03339 (python)

Fixed submission:
N = int(input())
S = input()
W_count = 0
W_cumulative = []
for i in range(N):
    if S[i] == "W":
        W_count += 1
    W_cumulative.append(W_count)

ans = N
W_cumulative.insert(0,0)
for i in range(1,N+1):
    count = W_cumulative[i-1]
    count += N - W_cumulative[-1] - i + W_cumulative[i]
    ans = min(ans,count)

print(ans)

Buggy submission (verdict: Runtime Error):
8
WWWWWEEE
Problem p03352 (python)

Fixed submission:
# -*- coding; utd-8 -*-
X = int(input())
import math
a = [math.pow(i,j) for j in range(2,11) for i in range(1,32) if math.pow(i,j)<=X]
print(int(max(a)))

Buggy submission (verdict: Runtime Error):
# -*- coding; utd-8 -*-
X = int(input())
import math
a = [math.pow(i,j) for j in range(2,10) for i in range(1,32) if math.pow(i,j)<X]
print(int(max(a)))

Buggy submission (verdict: Runtime Error):
# -*- coding; utd-8 -*-
X = int(input())
import math
a = []
for i in range(1,32):
  a = [math.pow(i,j) for j in range(2,10) if math.pow(i,j)<X]
print(max(a))

Buggy submission (verdict: Runtime Error):
# -*- coding utf-8 -*-
X = int(input())
a = []
for i in range(11):
  a.append(j ** i for j in range(j ** i < 1000) if X > j**i)
b = []
for i in range(11;32):
  b.append(i ** 2 if X > i ** 2)
L = a+b
print(sum(L))
Problem p03360 (python)

Fixed submission:
# -*- coding: utf-8 -*-
A,B,C=map(int,input().split())
K = int(input())
S = max(A,B,C) #入力された整数の最大のものを選ぶ
L = [A,B,C] #入力された整数のリスト化
L.remove(S)
P = sum(L , S*2**K)
print(P)

Buggy submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
A,B,C = int(input())
K = int(input())
S = max(A,B,C) #入力された整数の最大のものを選ぶ
L = [A,B,C] #入力された整数のリスト化
L.remove(S)
L = sum(L + S)
Problem p03361 (python)

Fixed submission:
H,W = map(int,input().split())
s = [input() for i in range(H)]
precount = 0
for i in range(H):
    precount += s[i].count("#")
if precount == 0:
    print("Yes")
else:
    ans = "Yes"
    dx = [1,0,-1,0]
    dy = [0,1,0,-1]
    for i in range(H):
        for j in range(W):
            if s[i][j] == "#":
               count = 0
               for k in range(4):
                   nx = j+dx[k]
                   ny = i+dy[k]
                   if 0 <= nx < W and 0 <= ny < H:
                      if s[ny][nx] == "#":
                         count += 1
               if count == 0:
                  ans = "No"

    print(ans)

Buggy submission (verdict: Runtime Error):
H,W = map(int,input().split())
s = [input() for i in range(H)]
precount = 0
for i in range(H):
    precount += s[i].count("#")
if precount == 0:
    print("Yes")
else:
    ans = "Yes"
    dx = [1,0,-1,0]
    dy = [0,1,0,-1]
    for i in range(H):
        for j in range(W):
            if s[i][j] == "#":
               count = 0
               for k in range(4):
                   nx = j+dx[k]
                   ny = i+dy[k]
                   if 0 <= nx < W and 0 <= ny < H:
                      if s[ny][nx] == "#":
                         count += 1
               if count == 0:
                  ans = "No"

print(ans)

Buggy submission (verdict: Runtime Error):
H,W = map(int,input().split())
s = [input() for i in range(H)]
ans = "No"
dx = [1,0,-1,0]
dy = [0,1,0,-1]
for i in range(0,H):
    for j in range(0,W):
        for k in range(4):
            nx = i+dx[k]
            ny = j+dy[k] 
            if s[i][j] == "#":
                if 0 <= nx < W and 0 <= ny < H:
                   if s[nx][ny] == "#":
                    ans = "Yes"

print(ans)

Buggy submission (verdict: Runtime Error):
H,W = map(int,input().split())
s = [input() for i in range(H)]
ans = "No"
dx = [1,0,-1,0]
dy = [0,1,0,-1]
for i in range(0,H):
    for j in range(0,W):
        for k in range(4):
            nx = i+dx[k]
            ny = i+dy[k] 
            if s[i][j] == "#":
                if 0 <= nx < W and 0 <= ny < H:
                   if s[nx][ny] == "#":
                    ans = "Yes"

print(ans)

Buggy submission (verdict: Runtime Error):
H,W = map(int,input().split())
s = [input() for i in range(H)]
ans = "No"
dx = [1,0,-1,0]
dy = [0,1,0,-1]
for i in range(0,H):
    for j in range(0,W):
        for k in range(4):
            nx = i+dx[k]
            ny = i+dy[k] 
            if s[i][j] == "#":
                if 0 <= nx < W and 0 <= ny < H:
                   if s[nx][ny] == "#":
                    ans = "Yes"

print(ans)

Buggy submission (verdict: Runtime Error):
H,W = map(int,input().split())
s = [input() for i in range(H)]
ans = "No"
for i in range(1,W-1):
    for j in range(1,H-1):
        if s[i][j] == "#":
            if s[i][j-1] == "#" or s[i][j+1] == "#" or s[i+1][j] == "#" or s[i-1][j] == "#":
                ans = "Yes"

print(ans)
Problem p03369 (python)

Fixed submission:
# -*- coding: utf-8 -*-
S = str(input())
T = S.count("o")
print("{}".format(700 + 100 * T))

Buggy submission (verdict: Runtime Error):
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush
from fractions import gcd
from copy import deepcopy
import math
import queue
#import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys

sys.setrecursionlimit(100000) 
  
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

def factorial(i):
    if i == 1:
        return 1
    else:
        return i*factorial(i-1)
 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[py] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)




def main(): #startline--------------------------------------------
    n,c = map(int,input().split())
    xv = [list(map(int,input().split())) for i in range(n)]
    x = [xv[i][0] for i in range(n)]
    v = [xv[i][1] for i in range(n)]
    r1,r2,l1,l2 = [0]*(n+1),[0]*(n+1),[0]*(n+1),[0]*(n+1)
    ans = 0
    dis = 0
    for i in range(n):
        r1[i+1] = r1[i]+v[i]-(x[i]-dis)
        r2[i+1] = r2[i]+v[i]-2*(x[i]-dis)
        dis = x[i]
    dis = c
    for i in reversed(range(n)):
        l1[n-i] = l1[n-i-1]+v[i]-(dis-x[i])
        l2[n-i] = l1[n-i-1]+v[i]-2*(dis-x[i])
        dis = x[i]
    for i in range(n):
        l1[i+1] = max(l1[i+1],l1[i])
        r1[i+1] = max(r1[i+1],r1[i])
    for i in range(n+1):
        ans = max(ans,max(r2[i]+l1[n-i],l2[i]+r1[n-i]))
    print(ans)
if __name__ == "__main__":
    main() #endline===============================================

Buggy submission (verdict: Runtime Error):
S = str(input())
o=100
x=0
T = 700 + S
print(T)