Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
a=input()
n=len(a)
dupli=0
from itertools import combinations
for i,j in combinations(range(n),2):
    if a[i]==a[j]:
        dupli+=1
print(n*(n-1)//2-dupli+1)

Fixed submission:
a=input()
n=len(a)
dupli=0
from collections import Counter
c=Counter(a)
for word,num in c.most_common():
    dupli+=num*(num-1)//2
print(n*(n-1)//2-dupli+1)

Buggy python submission (verdict: Time Limit Exceeded):
a=input()
n=len(a)
dupli=0
from itertools import combinations
for i,j in combinations(range(n),2):
    if a[i:j+1]==a[i:j+1][::-1]:
        dupli+=1
    elif j-i>2 and a[i]==a[j]:
        dupli+=1
print(n*(n-1)//2-dupli+1)

Fixed submission:
a=input()
n=len(a)
dupli=0
from collections import Counter
c=Counter(a)
for word,num in c.most_common():
    dupli+=num*(num-1)//2
print(n*(n-1)//2-dupli+1)

Buggy python submission (verdict: Time Limit Exceeded):
a=input()
n=len(a)
ansset=[a]
from itertools import combinations
for i,j in combinations(range(n),2):
    tmp=a[:i]+a[i:j+1][::-1]+a[j+1:]
    if tmp not in ansset:
        ansset.append(tmp)
print(len(set(ansset)))

Fixed submission:
a=input()
n=len(a)
dupli=0
from collections import Counter
c=Counter(a)
for word,num in c.most_common():
    dupli+=num*(num-1)//2
print(n*(n-1)//2-dupli+1)

Buggy python submission (verdict: Time Limit Exceeded):
a=input()
n=len(a)
ansset=[a]
from itertools import combinations
for i,j in combinations(range(n),2):
    ansset.append(a[:i]+a[i:j+1][::-1]+a[j+1:])
print(len(set(ansset)))

Fixed submission:
a=input()
n=len(a)
dupli=0
from collections import Counter
c=Counter(a)
for word,num in c.most_common():
    dupli+=num*(num-1)//2
print(n*(n-1)//2-dupli+1)
Buggy python submission (verdict: Runtime Error):
H,W=[int(x) for x in input().split()]
N=int(input())
a=[int(x) for x in input().split()]
s=""
for i in range(N):
    s=s+str(i+1)*a[i]
for l in range(H):
    if l%2==0:
        print(" ".join(s[W*l:W*(l+1)]))
    else:
        print(" ".join(s[W*l:W*(l+1)][::-1]))

Fixed submission:
i=[int(x)-1 for x in input().split()]
print(i[0]*i[1])

Buggy python submission (verdict: Runtime Error):
input(sum([int(x)-1 for x in input().split()]))

Fixed submission:
i=[int(x)-1 for x in input().split()]
print(i[0]*i[1])
Buggy python submission (verdict: Time Limit Exceeded):
N,M=[int(x) for x in input().split()]
set1=set()
setn=set()
for i in [None]*M:
    ipt=[int(x) for x in input().split()]
    if 1 in ipt:
        set1 = set1.union(ipt)
    if N in ipt:
        setn = setn.union(ipt)
if set1 & setn:
    print("POSSIBLE")
else:
    print("IMPOSSIBLE")

Fixed submission:
N,M=[int(x) for x in input().split()]
set1=[]
setn=[]
for i in [None]*M:
    ipt=[int(x) for x in input().split()]
    if 1 in ipt:
        set1 += ipt
    if N in ipt:
        setn += ipt
if set(set1) & set(setn):
    print("POSSIBLE")
else:
    print("IMPOSSIBLE")

Buggy python submission (verdict: Runtime Error):
set1=set()
setn=set()
for i in [None]*M:
    ipt=[int(x) for x in input().split()]
    if 1 in ipt:
        set1 = set1.union(ipt)
    if N in ipt:
        setn = setn.union(ipt)
if set1.symmetric_difference(setn):
    print("POSSIBLE")
else:
    print("IMPOSSIBLE")

Fixed submission:
N,M=[int(x) for x in input().split()]
set1=[]
setn=[]
for i in [None]*M:
    ipt=[int(x) for x in input().split()]
    if 1 in ipt:
        set1 += ipt
    if N in ipt:
        setn += ipt
if set(set1) & set(setn):
    print("POSSIBLE")
else:
    print("IMPOSSIBLE")
Buggy python submission (verdict: Runtime Error):
A,B=map(int,input().split())
if A%3==0 pr B%3==0 or (A+B)%3==0:
    print("Possible")
else:
    print("Impossible")


Fixed submission:
A,B=map(int,input().split())
if A%3==0 or B%3==0 or (A+B)%3==0:
    print("Possible")
else:
    print("Impossible")
Buggy python submission (verdict: Time Limit Exceeded):
input()
n=[int(x) for x in input().split()]
b=[]
for i in n:
    b.append(i)
    b=b[::-1]
print(" ".join([str(i) for i in b]))

Fixed submission:
input()
n=[x for x in input().split()]
nb=n[::-1]
bs=n[::2]
if len(nb)%2==0:
    be=nb[::2]
else:
    be=nb[1::2]
if len(n)==1:
    print(n[0])
else:
    ans=be+bs
    if len(n)%2!=0:
        ans=ans[::-1]
    print(" ".join(ans))
Buggy python submission (verdict: Runtime Error):
X A B = map(int,input().split())

if A-B>=0:
    print("delicious")
else:
    if X+A-B>=0:
        print("safe")
    else:
        print("dangerous")


Fixed submission:
X,A,B = map(int,input().split())

if A-B>=0:
    print("delicious")
else:
    if X+A-B>=0:
        print("safe")
    else:
        print("dangerous")
Buggy python submission (verdict: Time Limit Exceeded):
from collections import Counter
N,K = map(int,input().split())
tmp = Counter()
for i in range(N):
    a,b = map(int,input().split())
    tmp.update([a]*b)

print(sorted(tmp.elements())[K-1])

Fixed submission:
n,k=[int(x) for x in input().split()]
s=[]
for i in [None]*n:
    a,b=[int(x) for x in input().split()]
    s.append((a,b))
s=sorted(s,key=lambda x : x[0])
for i in s:
    if i[1]>=k:
        print(i[0])
        break
    else:
        k-=i[1]

Buggy python submission (verdict: Time Limit Exceeded):
N,K = map(int,input().split())
lit =  []
for i in range(N):
    a,b = map(int,input().split())
    lit.extend([a for x in range(b)])
lit.sort()
print(lit[K-1])

Fixed submission:
n,k=[int(x) for x in input().split()]
s=[]
for i in [None]*n:
    a,b=[int(x) for x in input().split()]
    s.append((a,b))
s=sorted(s,key=lambda x : x[0])
for i in s:
    if i[1]>=k:
        print(i[0])
        break
    else:
        k-=i[1]
Buggy python submission (verdict: Runtime Error):
num=[]
for i in [0]*2:
    num.append(int(input()))
if num[0]>num[1]:
    print("GREATER")
elif num[0]=num[1]:
    print("EQUAL")
else:
    print("LESS")

Fixed submission:
num=[]
for i in [0]*2:
    num.append(int(input()))
if num[0]>num[1]:
    print("GREATER")
elif num[0]==num[1]:
    print("EQUAL")
else:
    print("LESS")
Buggy python submission (verdict: Runtime Error):
a,b,c=[int(x) for x in input().split()]
if  b−a==c−b:
    print("YES")
else:
    print("NO")

Fixed submission:
a,b,c=[int(x) for x in input().split()]
if  b-a==c-b:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Time Limit Exceeded):
n,m=[int(x) for x in input().split()]
x=[int(x) for x in input().split()]
y=[int(x) for x in input().split()]
from itertools import product
mod=10**9+7
ans=0
for i,j in product(range(1,n),range(1,m)):
    ans=ans+(x[i]-x[i-1])*(y[j]-y[j-1])*i*(n-i)*j*(m-j)
print(ans%mod)

Fixed submission:
n,m=[int(x) for x in input().split()]
x=[int(x) for x in input().split()]
y=[int(x) for x in input().split()]
mod=10**9+7
ans=0
ysum=0
for j in range(1,m):
    ysum+=(y[j]-y[j-1])*j*(m-j)
for i in range(1,n):
    ans=ans+(x[i]-x[i-1])*i*(n-i)*ysum
print(ans%mod)

Buggy python submission (verdict: Time Limit Exceeded):
n,m=[int(x) for x in input().split()]
x=[int(x) for x in input().split()]
y=[int(x) for x in input().split()]
from itertools import product
mod=10**9+7
ans=0
for i,j in product(range(1,n),range(1,m)):
    ans=(ans+(x[i]-x[i-1])*(y[j]-y[j-1])*i*(n-i)*j*(m-j))%mod
print(ans)

Fixed submission:
n,m=[int(x) for x in input().split()]
x=[int(x) for x in input().split()]
y=[int(x) for x in input().split()]
mod=10**9+7
ans=0
ysum=0
for j in range(1,m):
    ysum+=(y[j]-y[j-1])*j*(m-j)
for i in range(1,n):
    ans=ans+(x[i]-x[i-1])*i*(n-i)*ysum
print(ans%mod)

Buggy python submission (verdict: Time Limit Exceeded):
n,m=[int(x) for x in input().split()]
X=[int(x) for x in input().split()]
Y=[int(x) for x in input().split()]
from itertools import product,combinations
mod=10**9+7
ans=0
for x,y in product(combinations(X,2),combinations(Y,2)):
    ans=(ans+(x[1]-x[0])*(y[1]-y[0]))%mod
print(ans)

Fixed submission:
n,m=[int(x) for x in input().split()]
x=[int(x) for x in input().split()]
y=[int(x) for x in input().split()]
mod=10**9+7
ans=0
ysum=0
for j in range(1,m):
    ysum+=(y[j]-y[j-1])*j*(m-j)
for i in range(1,n):
    ans=ans+(x[i]-x[i-1])*i*(n-i)*ysum
print(ans%mod)
Buggy python submission (verdict: Runtime Error):
a,b=[int(x) for x in input().split()]
if (a=="H" and b="D") or (a=="D" and b=="H"):
    print("D")
else:
    print("H")

Fixed submission:
a,b=[x for x in input().split()]
if (a=="H" and b=="D") or (a=="D" and b=="H"):
    print("D")
else:
    print("H")
Buggy python submission (verdict: Runtime Error):
import sys
N = int(input())
ipt = list(input())
stR = ["S" for i in range(N)]

def sheep(stg):
     return stg
def wolf(stg):
    if stg == "S":
        return "W"
    else:
        return "S"
def modN (i):
    return i%N
def check ( num1,num2 ):
    
    for i in range(N+2):
        if stR[modN(i+1)] == "S" and ipt[modN(i+1)]=="o"  :
            stR[modN(i+2)]=sheep(stR[modN(i)])
        elif stR[modN(i+1)] == "W" and ipt[modN(i+1)]=="x":
            stR[modN(i+2)]=sheep(stR[modN(i)])
        else:
            stR[modN(i+2)]=wolf(stR[modN(i)])
    
    if stR[0]==num1 and stR[1]==num2:
        print("".join(stR))
        return True
    else:
        return False

if check("S","W"):
    sys.exit()
else:
    stR[0]="W"
    if check("W","W"):
        sys.exit()
    else:
        stR[1]="S"
        if check("W","S"):
            sys.exit()
        else:
            stR[0]="S"
            if check("S","S"):
                sys.exit()
            else:
                print(-1)

Fixed submission:
N = int(input())
print(N*800-200*(N//15))
Buggy python submission (verdict: Runtime Error):
if A == B:
    print("Draw")
elif A == 1:
    print("Alice")
elif B == 1:
    print("Bob")
elif A > B:
    print("Alice")
else:
    print("Bob")

Fixed submission:
(A,B) = [int(x) for x in input().split()]
if A == B:
    print("Draw")
elif A == 1:
    print("Alice")
elif B == 1:
    print("Bob")
elif A > B:
    print("Alice")
else:
    print("Bob")
Buggy python submission (verdict: Runtime Error):
n,a,b=[int(x) for x in input().split()]
ans=0
for i in range(n-1):
    ans+=max(a*(x[i+1]-x[i]),b)
print(ans)

Fixed submission:
n,a,b=[int(x) for x in input().split()]
x=[int(x) for x in input().split()]
ans=0
for i in range(n-1):
    ans+=min(a*(x[i+1]-x[i]),b)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
a,b,x=[int(x) for x in input().split()]
ans=0
for i in range(a,b+1):
    if i%x==0:
        ans+=1
print(ans)

Fixed submission:
a,b,x=[int(x) for x in input().split()]
print(b//x-(a-1)//x)
Buggy python submission (verdict: Runtime Error):

ini = int(input().split(" ")[0])
negaset = [int(x) for x in input().split(" ")]
okset = sorted([str(i) for i in range (10) if i not in negaset]) 
#print(ini,okset)

for p in itertools.product(okset,repeat = 5):
    stp = int("".join(p))
    if stp >= ini:
        print(stp)
        break

Fixed submission:
# coding: utf-8
# Here your code !
ipt = input().split(" ")
j,k =0,0
for i in [ int(i) for i in ipt]:
    if i == 5:
        k += 1
    elif i==7:
        j += 1
#    print(ipt,i,k,j)

if j == 1 and k == 2:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
import itertools
ini = int(input().split(" ")[0])
negaset = [int(x) for x in input().split(" ")]
okset = sorted([str(i) for i in range (10) if i not in negaset]) 
#print(ini,okset)

for p in itertools.product(okset,repeat = 5):
    stp = int("".join(p))
    if stp >= ini:
        print(stp)
        break

Fixed submission:
# coding: utf-8
# Here your code !
ipt = input().split(" ")
j,k =0,0
for i in [ int(i) for i in ipt]:
    if i == 5:
        k += 1
    elif i==7:
        j += 1
#    print(ipt,i,k,j)

if j == 1 and k == 2:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# Here your code !
import itertools
ini = int(input().split(" ")[0])
negaset = [int(x) for x in input().split(" ")]
okset = sorted([str(i) for i in range (10) if i not in negaset]) 
#print(ini,okset)

for p in itertools.product(okset,repeat = 5):
    stp = int("".join(p))
    if stp >= ini:
        print(stp)
        break

Fixed submission:
# coding: utf-8
# Here your code !
ipt = input().split(" ")
j,k =0,0
for i in [ int(i) for i in ipt]:
    if i == 5:
        k += 1
    elif i==7:
        j += 1
#    print(ipt,i,k,j)

if j == 1 and k == 2:
    print("YES")
else:
    print("NO")

Buggy python submission (verdict: Runtime Error):
# coding: utf-8
# Here your code !
ipt = input().split(" ")
j,k =0,0
for i in ipt:
    if i == 5:
        k +=1
    elif i==7:
        j += 1

if J == 1 & K == 2:
    print("YES")
else:
    print("NO")

Fixed submission:
# coding: utf-8
# Here your code !
ipt = input().split(" ")
j,k =0,0
for i in [ int(i) for i in ipt]:
    if i == 5:
        k += 1
    elif i==7:
        j += 1
#    print(ipt,i,k,j)

if j == 1 and k == 2:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
# coding: utf-8

N = input()
A = input()

N = int(N)
A = int(A)

flag = 0

if N % 500 == 0:
    print('YES')
    flag = 1
else:
    for i in range(10000 // 500):
        sum_ = 500 * i

        if sum_ > N:
            x = i - 1
            break

for i in range(A):
    y = 500 * x + i

    if N == y:
        print('YES')
        flag = 1

if flag == 0:
    print('NO')


Fixed submission:
# coding: utf-8

N = input()
A = input()

N = int(N)
A = int(A)

if N % 500 <= A:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
s = input()
s[:4] = '2017'
print(s)

Fixed submission:
s = input()
print(s.replace('2017', '2018'))
Buggy python submission (verdict: Runtime Error):
s = input()
 print(700 + 100 * s.count("o"))

Fixed submission:
s = input()
 
print(700 + 100 * s.count("o"))
Buggy python submission (verdict: Runtime Error):
s = str(input())
s[3] = "7"
print(s)


Fixed submission:
s = str(input())
s = "2018/01" + s[7:10]
print(s)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
print(math.floor((a+b)/2))

Fixed submission:
import math
a, b = map(int, input().split())
print(math.ceil((a+b)/2))

Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
c = a*b/2
c = math.ceil(c)
print(c)

Fixed submission:
import math
a, b = map(int, input().split())
print(math.ceil((a+b)/2))

Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
print(math.ceil(a*b/2))

Fixed submission:
import math
a, b = map(int, input().split())
print(math.ceil((a+b)/2))

Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
print(math.floor(a*b/2))

Fixed submission:
import math
a, b = map(int, input().split())
print(math.ceil((a+b)/2))
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
print(a+b+c)

Fixed submission:
a = str(input())
print(int(a[0]) + int(a[1]) + int(a[2]))
Buggy python submission (verdict: Runtime Error):
#NとXの読み込み
n, x = input().split()
n = int(n)
x = int (x)
m = []
i_min = 0 
result = 0

#m1からmnまでの読み込み
for i in range(n):
 m.append(int(input())
#全種類ひとつずつ作る
for i in range(len(m)):
 x = x - m[i]
 result = result + 1
#リストの中の最小値を突き止める
for i in range(len(m)):
 if m[i_min] > m[i]:
   i_min = i
#i_minを作れるだけ作る
for i in range(x):
 if x >= m[i_min]:
  result = result + 1
  x = x - m[i_min]
 else:
  break
#印刷
print(result)

Fixed submission:
n, x = input().split()
n = int(n)
x = int(x)
m = []
i_min = 0
result = 0

for i in range(n):
 m.append(int(input()))

for i in range(len(m)):
 x = x - m[i]
 result = result + 1

for i in range(len(m)):
 if m[i_min] > m[i]:
  i_min = i

for i in range(x):
 if x >= m[i_min]:
  result = result + 1
  x = x - m[i_min]
 else:
  break

print(result)
Buggy python submission (verdict: Runtime Error):
print(input().count(1))

Fixed submission:
S = input()

count = 0

for s in S:
  if s == "1":
    count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
n = int(input())
nums = list(map(int, input().split()))

count = 0

while all(num%2 == 0 for num in nums):
  nums = [num/2 for num in nums]
  count += 1

print(num)

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

count = 0

while all(num%2 == 0 for num in nums):
  nums = [num/2 for num in nums]
  count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
s = map(int, input().split())

if s%4 == 0:
  print("YES")
else:
  print("NO")

Fixed submission:
a, b, c = input().split()
num = int(a+b+c)

if num % 4 == 0:
    print('YES')
else:
    print('NO')

Buggy python submission (verdict: Runtime Error):
s = input().split()
num = int(s)

if num % 4 == 0:
  print('YES')
else:
  print('NO')

Fixed submission:
a, b, c = input().split()
num = int(a+b+c)

if num % 4 == 0:
    print('YES')
else:
    print('NO')

Buggy python submission (verdict: Runtime Error):
num = map(int, input().split())

if num % 4 == 0:
  print('YES')
else:
  print('NO')

Fixed submission:
a, b, c = input().split()
num = int(a+b+c)

if num % 4 == 0:
    print('YES')
else:
    print('NO')
Buggy python submission (verdict: Runtime Error):
a=int(input())
b=int(input())

c=(a+b-1)/2+1
print(int(c))

Fixed submission:
a, b=map(int,input().split())
print((a+b+1)//2)

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

c=(a+b)/2
print(int(c))

Fixed submission:
a, b=map(int,input().split())
print((a+b+1)//2)
Buggy python submission (verdict: Runtime Error):
s=list(map(int,input().split()))
c=0
if s[0]==1:
    c+=1
if s[1]==1:
    c+=1
if s[2]==1:
    c+=1

print(c)


Fixed submission:
import re

s=re.findall(r"1",input())
print(len(s))

Buggy python submission (verdict: Runtime Error):
s=input().split()
c=0
if s[0]==1:
    c+=1
if s[1]==1:
    c+=1
if s[2]==1:
    c+=1

print(c)

Fixed submission:
import re

s=re.findall(r"1",input())
print(len(s))
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if a * b % 2 == 0:
    print ("Even")
else:
    print("Odd")

Fixed submission:
a,b = map(int,input().split())
if a * b % 2 == 0:
    print ("Even")
else:
    print("Odd")
Buggy python submission (verdict: Runtime Error):
n = int(input())
nums = [int(i) for i in input().split()]
ans = 0
while True:
    if [i for i in nums if i % 2 == 1]:
        break
    nums = [i//2 for i in nums]
    ans += 1
print(ans)

Fixed submission:
s = input()
print(s.count('1'))
Buggy python submission (verdict: Runtime Error):
def f(n):
    return sum(map(int,　str(n)))

X = int(input())

if X % f(X) == 0:
    print('Yes')
else:
    print('No')

Fixed submission:
def f(n):
  return sum(map(int, str(n)))

X = int(input())

if X % f(X) == 0: 
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
def f(n):
    return sum(map(int,str(n)))

X = int8(input())

if X % f(X) == 0:
    print('Yes')
else:
    print('No')

Fixed submission:
def f(n):
  return sum(map(int, str(n)))

X = int(input())

if X % f(X) == 0: 
  print("Yes")
else:
  print("No")

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

total = 0
for i in range(1,n+1):
    total += N[i]

    if N % total == 0:
        print('Yes')
    else:
        print('No')


Fixed submission:
def f(n):
  return sum(map(int, str(n)))

X = int(input())

if X % f(X) == 0: 
  print("Yes")
else:
  print("No")

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

total = 0
for i in range(1,n+1):
    total += N

    if N % total == 0:
        print('Yes')
    else:
        print('No')


Fixed submission:
def f(n):
  return sum(map(int, str(n)))

X = int(input())

if X % f(X) == 0: 
  print("Yes")
else:
  print("No")

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

total = 0
for i in range(len(N)):
    total += N
    
    if N % sum(int(input())) == 0:
        print('Yes')
    else:
        print('No')

Fixed submission:
def f(n):
  return sum(map(int, str(n)))

X = int(input())

if X % f(X) == 0: 
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
N = int(input())
def if_test:
    if N % sum(int(input())) == 0:
        print('Yes')
    else:
        print('No')

Fixed submission:
def f(n):
  return sum(map(int, str(n)))

X = int(input())

if X % f(X) == 0: 
  print("Yes")
else:
  print("No")

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

    if N / sum(int(input())) == 0:
        print('Yes')
    else:
        print('No')

Fixed submission:
def f(n):
  return sum(map(int, str(n)))

X = int(input())

if X % f(X) == 0: 
  print("Yes")
else:
  print("No")

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

Fixed submission:
def f(n):
  return sum(map(int, str(n)))

X = int(input())

if X % f(X) == 0: 
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
S = input()
a = 700
if S[0] ++ "o":
  a += 100
if S[1] ++ "o":
  a += 100
if S[2] ++ "o":
  a += 100
print(a)


Fixed submission:
S = input()
a = 700
if S[0] == "o":
  a += 100
if S[1] == "o":
  a += 100
if S[2] == "o":
  a += 100
print(a)
Buggy python submission (verdict: Runtime Error):
a = input()
print(a[0]+len(a)+a[-1])

Fixed submission:
a = input()
print(a[0]+str(len(a)-2)+a[-1])

Buggy python submission (verdict: Runtime Error):
a = input()
s = a.length
print(a[0]+int(s)+a[-1])

Fixed submission:
a = input()
print(a[0]+str(len(a)-2)+a[-1])
Buggy python submission (verdict: Runtime Error):
p = int(input())
if p % 2 == 1:
	print("Odd")
else:
	print("Even")

Fixed submission:
p = input().split()
s = int(p[0]) * int(p[1])

if s % 2 == 1:
	print("Odd")
else:
	print("Even")

Buggy python submission (verdict: Runtime Error):
i = input().split()
j = i[0] * i[1]
if j % 2 == 0:
  print("Even")
else:
  print("Odd")

Fixed submission:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a, b = map(int, input().split())
c = a * b
if c % 2 == 0:
  print("Even")
else:
  print("Odd")

Buggy python submission (verdict: Runtime Error):
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a, b = map(int, input().split())
c = a * b
if c % 2 = 0:
  print("Even")
else:
  print("Odd")

Fixed submission:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
a, b = map(int, input().split())
c = a * b
if c % 2 == 0:
  print("Even")
else:
  print("Odd")
Buggy python submission (verdict: Runtime Error):
import math
a, b = map(int, input().split)
c = int(str(a)+str(b))
if math.sqrt(c) % 2 == 0:
  print("Yes")
else:
  print("No")

Fixed submission:
import math
a, b = map(int, input().split())
c = int(str(a)+str(b))
if math.sqrt(c) - int(math.sqrt(c))== 0:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
import math
a, b = map(int, input().split)
c = int(str(a)+str(b))
if math.sqrt(c) % 2 == 0:
  Yes
else:
  No

Fixed submission:
import math
a, b = map(int, input().split())
c = int(str(a)+str(b))
if math.sqrt(c) - int(math.sqrt(c))== 0:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
i = lits(map(int, input().split()))
j = i[0] * i[1]
if j % 2 == 0:
  print(j / 2)
else:
  print(int(j/2)+1)

Fixed submission:
i = list(map(int, input().split()))
j = i[0] + i[1]
if j % 2 == 0:
  print(int(j / 2))
else:
  print(int(j/2)+1)

Buggy python submission (verdict: Runtime Error):
i = lits(map(int, input().split()))
j = i[0] * i[1]
if j % 2 == 0:
  print(j / 2)
else:
  print(int (j/2)+1)

Fixed submission:
i = list(map(int, input().split()))
j = i[0] + i[1]
if j % 2 == 0:
  print(int(j / 2))
else:
  print(int(j/2)+1)
Buggy python submission (verdict: Runtime Error):
i[0] = int(input())
i[1] = int(i[0] / 10)
i[2] = int(i[1] / 10)
i[1] = i[1] - i[2] * 10
i[0] = i[0] - i[1] * 10 - i[2] * 100
s = i[0] + i[1] + i[2]
print(s)

Fixed submission:
i = {}
i[0] = int(input())
i[1] = int(i[0] / 10)
i[2] = int(i[1] / 10)
i[1] = i[1] - i[2] * 10
i[0] = i[0] - i[1] * 10 - i[2] * 100
s = i[0] + i[1] + i[2]
print(s)