Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N=input()
N=int(N)
L=[]

def diff(L):
    total=0
    for i in range(len(L)-1):
        total+=abs(L[i+1]-L[i])
    return total
for i in range(N):
    A=input()
    L.append(int(A))
L.sort()
if len(L)>3:
    length=len(L)
    SL=L[:int(length/2)]
    LL=L[int(length/2):]
    result=[]
    result.append(SL[-1])
    SL.pop(-1)
    last=LL[0]
    LL.pop(0)
    while True:
        try:
            result.append(LL[-1])
            LL.pop(-1)
            result.append(SL[0])
            SL.pop(0)
        except:
            break

    result.append(last)
    print(diff(result))    
elif len(L)==3:
    all=[diff([L[0],L[1],L[2]]),diff([L[0],L[2],L[1]]),diff([L[1],L[0],L[2]]),diff([L[1],L[2],L[0]]),diff([L[2],L[0],L[1]]),diff([L[2],L[1],L[0]])]
    print(max(all))
elif len(L)==2:
    print(abs(L[0]-L[1]))


Fixed submission:
I=input()
if len(I)==2:
    print(I)
else:
    print(I[2]+I[1]+I[0])
Buggy python submission (verdict: Runtime Error):
I=input()
if I==1:
 print('hello world')
else:
  A=input()
  B=input()
  print(int(A)+int(B))


Fixed submission:
I=input()
if I=='1':
 print('Hello World')
else:
  A=input()
  B=input()
  print(int(A)+int(B))

Buggy python submission (verdict: Runtime Error):
I=input()
if I==1:
 print('hello world')
else:
  A=Input()
  B=Input()
  print(A+B)

Fixed submission:
I=input()
if I=='1':
 print('Hello World')
else:
  A=input()
  B=input()
  print(int(A)+int(B))
Buggy python submission (verdict: Runtime Error):
N,T=input().split()
min=1001
for i in range(N):
  cost,time=input().split()
  if time<=T and cost<min:
    min=cost
if min==1001:
  print('TLE')
else:
  print(min)

Fixed submission:
N,T=input().split()
min=1001
for i in range(int(N)):
  cost,time=input().split()
  if int(time)<=int(T) and int(cost)<min:
    min=int(cost)
if min==1001:
  print('TLE')
else:
  print(min)
Buggy python submission (verdict: Runtime Error):
n=int(input())
arr=list(map(int,input().split()))
arr=arr.sort()
s=0
for i in range(0,(2*n)-1,2):
  s+=arr[i]
print(s)

Fixed submission:
n=int(input())
arr=list(map(int,input().split()))
arr.sort()
s=0
for i in range(0,(2*n)-1,2):
  s+=arr[i]
print(s)
Buggy python submission (verdict: Runtime Error):
K = input()
print(K*ACL)

Fixed submission:
k = int(input())
print(k*'ACL')
Buggy python submission (verdict: Runtime Error):
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))

A = [0], B = [0]
for i in range(n):
    A.append(A[i] + a[i])
for i in range(m):
    B.append(B[i] + b[i])

ans, j = 0, m
for i in range(n+1):
    if A[i] > k:
        break
    while B[j] > k - A[i]:
        j -= 1
    ans = max(ans, i+j)
print(ans)

Fixed submission:
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))

A, B = [0], [0]
for i in range(n):
    A.append(A[i] + a[i])
for i in range(m):
    B.append(B[i] + b[i])

ans, j = 0, m
for i in range(n+1):
    if A[i] > k:
        break
    while B[j] > k - A[i]:
        j -= 1
    ans = max(ans, i+j)
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
def count(num):
    ans = 1
    x = 2
    while x * x <= num:
        cnt = 1
        while num % x == 0:
            cnt += 1
            num /= x
        ans *= cnt
        x += 1
    return ans * (1 + (num > 1))

n = int(input())
res = 0
for i in range(1, n+1):
    res += i * count(i)

print(res)

Fixed submission:
n = int(input())
res = 0
for i in range(1, n+1):
    x = n//i
    res += i*x*(x+1)/2

print(int(res))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s =input()
s = "0" + s
ans = 0
 
for i in range(1, n - 1):
    for j in range(i + 1 , n):
        if s[i] == s[j]:
            continue
        elif (s[i] == "R" and s[j] == "G") or (s[i] == "G" and s[j] == "R"):
            ans += s.count("B", j , n + 1)
            if 2 * j - i <= n:
                if s[2 *j - i] == "B":
                    ans -=1
        elif (s[i] == "R" and s[j] == "B") or (s[i] == "B" and s[j] == "R"):
            ans += s.count("G", j , n + 1)
            if 2 * j - i <= n:
                if s[2 *j - i] == "G":
                    ans -=1
        elif (s[i] == "B" and s[j] == "G") or (s[i] == "G" and s[j] == "B"):
            ans += s.count("R", j , n + 1)
            if 2 * j - i <= n:
                if s[2 *j - i] == "R":
                    ans -=1
print(ans)

Fixed submission:
n = int(input())
s = input()
s = "0" + s
ans = s.count("R") * s.count("G") * s.count("B")

for i in range(1,n):
    for j in range(i + 1, n + 1):
        if 2 * j - i <= n:
            if s[i] != s[j] and s[i] != s[2*j -i] and s[j] != s[2*j -i]:
                ans -= 1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s =input()
s = "0" + s
ans = 0

for i in range(1, n - 1):
    for j in range(i + 1 , n):
        if s[i] == s[j]:
            continue
        elif (s[i] == "R" and s[j] == "G") or (s[i] == "G" and s[j] == "R"):
            ans += s.count("B", j , n + 1)
            if 2 * j - i <= n:
                if s[2 *j - i] == "B":
                    ans -=1
        elif (s[i] == "R" and s[j] == "B") or (s[i] == "B" and s[j] == "R"):
            ans += s.count("G", j , n + 1)
            if 2 * j - i <= n:
                if s[2 *j - i] == "G":
                    ans -=1
        elif (s[i] == "B" and s[j] == "G") or (s[i] == "G" and s[j] == "B"):
            ans += s.count("R", j , n + 1)
            if 2 * j - i <= n:
                if s[2 *j - i] == "R":
                    ans -=1
print(ans)

Fixed submission:
n = int(input())
s = input()
s = "0" + s
ans = s.count("R") * s.count("G") * s.count("B")

for i in range(1,n):
    for j in range(i + 1, n + 1):
        if 2 * j - i <= n:
            if s[i] != s[j] and s[i] != s[2*j -i] and s[j] != s[2*j -i]:
                ans -= 1
print(ans)
Buggy python submission (verdict: Runtime Error):
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    pritn("No")

Fixed submission:
s = input()
if s[2] == s[3] and s[4] == s[5]:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
import numpy as np
n, k, q = map(int,input().split())
a=[int(input()) for i in range(q)]
a = np.asarray(a)
list = np.ones(n)*k
for i in range(q):
  list = list - 1
  list[a[i]-1] = list[a[i]-1] + 1
for i in range(n):
  if 0<list[i]:
    print('Yes')
  else:
    print('No')

Fixed submission:
import numpy as np
def main():
  n, k, q = map(int,input().split())
  a=[int(input()) for i in range(q)]
  a = np.asarray(a)
  list = np.ones(n)*k
  list = list - q
  for i in range(q):
    list[a[i]-1] = list[a[i]-1] + 1
  for i in range(n):
    if 0<list[i]:
      print('Yes')
    else:
      print('No')

if __name__ == '__main__':
  main()
Buggy python submission (verdict: Runtime Error):
s,t=map(str,input().split())
count=0
for i in range(3):
    if s[i]==t[i]:
        count=count+1
print(count)

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

Buggy python submission (verdict: Runtime Error):
s,t=input().split()
count=0
for i in range(3):
    if s[i]==t[i]:
        count=count+1
print(count)

Fixed submission:
s = input()
t = input()
count=0
for i in range(3):
    if s[i]==t[i]:
        count=count+1
print(count)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
c = b % a
if (b > 1) && (b < a):
    print(1)
elif b == 1:
    print(0)
else:
    print(c + 1)

Fixed submission:
a,b = map(int,input().split())
sum = 1
if ((b > 1) and (b < a)):
    print(1)
elif b == 1:
    print(0)
else:
    b = b - a
    while 0 < b:
        b = b - (a-1)
        sum=sum+1
    print(sum)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
sum = 0
for i in range(n):
    sum += i;
print(sum)

Fixed submission:
n = int(input())
print(n*(n-1)//2)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
sum = 0
for i in range(n):
    sum = sum + i;
print(sum)

Fixed submission:
n = int(input())
print(n*(n-1)//2)
Buggy python submission (verdict: Runtime Error):
A = list(map(int, input().split()))
B = list(map(int, input().split()))
T = list(map(int, input().split()))
abs(A[0]-B[0])/abs(T[0]*(A[1]-B[1]))

if (B[1]-A[1])>=0:
    print('NO')
elif abs(A[0]-B[0])<abs(T[0]*(A[1]-B[1])):
    print('YES')
else:
    print('NO')

Fixed submission:
A = list(map(int, input().split()))
B = list(map(int, input().split()))
T = int(input())
x=abs(A[0]-B[0])
v=A[1]-B[1]

if v*T>=x:
    print('YES')
else:
    print('NO')
Buggy python submission (verdict: Time Limit Exceeded):
num=int(input())
i = list(map(int, input().split()))
ans=1
for n in range(num):
    ans = ans*i[n]
if ans > 10**18:
    ans=-1
print(ans)

Fixed submission:
num=int(input())
i = list(map(int, input().split()))
if 0 in i:
    print(0)
else:
    ans=1
    for n in range(num):
        ans=ans*i[n]
        if ans > 10**18:
            ans=-1
            break
    print(ans)
Buggy python submission (verdict: Runtime Error):
num1 = int(input())
num2 = int(input())
seki = num1 * num2
print(seki)

Fixed submission:
a, b = map(int, input(). split())
print(a*b)
Buggy python submission (verdict: Runtime Error):
K = int(input())
s = "
for i in range(K):
  s += "ACL"
print(s)

Fixed submission:
K = int(input())
s = ""
for i in range(K):
  s += "ACL"
print(s)
Buggy python submission (verdict: Runtime Error):
N = int(input())
count = 0
for i in range(N):
    di_1, di_2 = int(input().split())
    if di_1 == di_2:
        count += 1
    else:
        count = 0
if count >= 3:
    print("Yes")
else:
    print("No")

Fixed submission:
N = int(input())
count = 0
count_max = count
for i in range(N):
    di_1, di_2 = [int(i) for i in input().split()]
    if di_1 == di_2:
        count += 1
    else:
        count_max = max([count_max, count])
        count = 0
count_max = max([count_max, count])
if count_max >= 3:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
a, b, c, d = [int(i) for i in input()]
print(max([a * d, a * c, b * c, b * d]))

Fixed submission:
a, b, c, d = [int(i) for i in input().split()]
print(max([a * d, a * c, b * c, b * d]))
Buggy python submission (verdict: Runtime Error):
N = int(input())
n = 10 ** 9 + 7
A_n = [int(i) % n for i in input().split()]
A_n_mod = sum([(A_n[i] * A_n[j]) % n for i in range(N-1) for j in range(i+1, N, 1)])
res = A_n_mod % n
print(res)

Fixed submission:
D, T, S = [int(i) for i in input().split()]
t = D / S
if t > T:
    print('No')
else:
    print('Yes')
Buggy python submission (verdict: Runtime Error):
S = input()
counts = [0]
if "R" in S:
  counts.appned(1)
if "RR" in S:
  counts.append(2)
if "RRR" in S:
  counts.append(3)
print(max(counts))

Fixed submission:
S = input()
counts = [0]
if "R" in S:
  counts.append(1)
if "RR" in S:
  counts.append(2)
if "RRR" in S:
  counts.append(3)
print(max(counts))
Buggy python submission (verdict: Runtime Error):
x = input()
if x >= 30:
  print("Yes")
else:
  print("No)

Fixed submission:
x = int(input())
if x>= 30:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
import math
n, d = input().split()
points = []
for i in range(n):
  points.append([int(x) for x in input().split()])
print(len([p for p in points if math.sqrt(p[0]**2+p[1]**2) <= d]))

Fixed submission:
import math
n, d = [int(i) for i in input().split()]
points = []
for i in range(n):
  points.append([int(x) for x in input().split()])
print(len([p for p in points if math.sqrt(p[0]**2+p[1]**2) <= d]))
Buggy python submission (verdict: Runtime Error):
s = input().split()[1]
print(s.count("ABC"))

Fixed submission:
s = input()
s = input()
print(s.count("ABC"))

Buggy python submission (verdict: Runtime Error):
s = input().split()[1]
s.count("ABC")

Fixed submission:
s = input()
s = input()
print(s.count("ABC"))
Buggy python submission (verdict: Time Limit Exceeded):
from math import gcd
from functools import lru_cache
@lru_cache(maxsize = None)


def gcdx(x,y,z):
    return gcd(gcd(x,y),z)
n = int(input())
a = 0
longp = []

for i in range(1,n+1):
    for j in range(1,n+1):
        for p in range(1,n+1):
            a += gcdx(i,j,p)
           
print(a)

Fixed submission:
from math import gcd

def gcdx(x,y,z):
    return gcd(gcd(x,y),z)
n = int(input())
a = 0
longp = []

for i in range(1,n+1):
    for j in range(1,n+1):
        for p in range(1,n+1):
            a += gcdx(i,j,p)
           
print(a)

Buggy python submission (verdict: Runtime Error):
from functools import lru_cache
    @lru_cache(maxsize = None)
from math import gcd

def gcdx(x,y,z):
    return gcd(gcd(x,y),z)
n = int(input())
a = 0
longp = []

for i in range(1,n+1):
    for j in range(1,n+1):
        for p in range(1,n+1):
            a += gcdx(i,j,p)
           
print(a)


Fixed submission:
from math import gcd

def gcdx(x,y,z):
    return gcd(gcd(x,y),z)
n = int(input())
a = 0
longp = []

for i in range(1,n+1):
    for j in range(1,n+1):
        for p in range(1,n+1):
            a += gcdx(i,j,p)
           
print(a)

Buggy python submission (verdict: Time Limit Exceeded):
from math import gcd

def gcdx(x,y,z):
    return gcd(gcd(x,y),z)
n = int(input())
a = 0
longp = []

for i in range(1,n+1):
    for j in range(1,n+1):
        for p in range(1,n+1):
            a += gcdx(i,j,p)
           
print(a)



Fixed submission:
from math import gcd

def gcdx(x,y,z):
    return gcd(gcd(x,y),z)
n = int(input())
a = 0
longp = []

for i in range(1,n+1):
    for j in range(1,n+1):
        for p in range(1,n+1):
            a += gcdx(i,j,p)
           
print(a)
Buggy python submission (verdict: Runtime Error):
arr=list(map(int,input().split())
n=arr[0]
m=arr[1]
if n==m:
  print("Yes")
else:
  print("No")


Fixed submission:
arr=list(map(int,input().split()))
n=arr[0]
m=arr[1]
if n==m:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
n=int(input())
m=int(input())
if n==m:
  print("Yes")
else:
  print("No")


Fixed submission:
arr=list(map(int,input().split()))
n=arr[0]
m=arr[1]
if n==m:
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
n=int(intpu())
m=int(input())
if n==m:
  print("Yes")
else:
  print("No")

Fixed submission:
arr=list(map(int,input().split()))
n=arr[0]
m=arr[1]
if n==m:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
import math

a, b, h, m = map(int, input().split())

#c = (h/6 - m/360)*math.pi
c = 11.0/360.0*(60*h+m)*pi
x = math.sqrt(a * a + b * b - 2 * a * b * math.cos(c))
print(x)

#double c = (h/6 - m/360)*pi;
#x = sqrt(a * a + b * b - 2 * a * b * cos(c));
#cout << fixed << setprecision(15) << x << endl;


Fixed submission:
import math

a, b, h, m = map(int, input().split())

#c = (h/6 - m/360)*math.pi
c = 11.0/360.0*(60*h+m)*math.pi
x = math.sqrt(a * a + b * b - 2 * a * b * math.cos(c))
print(x)

#double c = (h/6 - m/360)*pi;
#x = sqrt(a * a + b * b - 2 * a * b * cos(c));
#cout << fixed << setprecision(15) << x << endl;
Buggy python submission (verdict: Runtime Error):
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
        
a = input().split()
N = int(a[0])
M = int(a[1])
tm = int(0)
tmp = int(0)


k = [input().split() for i in range(M)]

uf = UnionFind(N)

for i in range(M):
    tm = int(k[i][0])
    tmp = int(k[i][1])
    uf.union(tm, tmp)
    tm = 0
    tmp = 0

print(int(uf.group_count()) - 1)


Fixed submission:
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
        
a = input().split()
N = int(a[0])
M = int(a[1])
tm = int(0)
tmp = int(0)


k = [input().split() for i in range(M)]

uf = UnionFind(N+1)

for i in range(M):
    tm = int(k[i][0])
    tmp = int(k[i][1])
    uf.union(tm, tmp)
    tm = 0
    tmp = 0

print(int(uf.group_count()) - 2)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = [int(s) for s in input().split()]
ans = int(0)
temp = int(0)
MOD = int(1000000007)
for i in range(N-1):
  temp = sum(a[i+1:N])
  temp = temp % MOD
  temp = temp * a[i]
  temp = temp % MOD
  ans += temp
  ans = ans % MOD
print(ans)

Fixed submission:
N = int(input())
a = [int(s) for s in input().split()]
ans = int(0)
temp = int(0)
MOD = int(1000000007)
sumari = sum(a)

for i in range(N-1):
  sumari = sumari - a[i] 
  temp = sumari % MOD
  temp = temp * a[i]
  temp = temp % MOD
  ans += temp
  ans = ans % MOD
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
a = [int(s) for s in input().split()]
b = int(0)

for i in range(N):
  if a[i] <= a[int(i+1)]:
    pass
  else:
    b = b + (a[i] - a[int(i+1)])
    a[int(i+1)] = a[i]

print(b)

Fixed submission:
N = int(input())
a = [int(s) for s in input().split()]
b = int(0)

for i in range(N-1):
  if a[i] <= a[int(i+1)]:
    pass
  else:
    b = b + (a[i] - a[int(i+1)])
    a[int(i+1)] = a[i]

print(b)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = [int(s) for s in input().split()]
b = a[0]
c = str("")
for i in range(1,N):
  b = b ^ a[i]
c = str(b ^ a[0])
for i in range(1, N):
  c = c + " " + str(b ^ a[i])
print(c)

Fixed submission:
N = int(input())
a = [int(s) for s in input().split()]
b = a[0]
c = []
for i in range(1,N):
  b = b ^ a[i]

for i in range(N):
  c.append(str(b ^ a[i]))
 
d = ' '.join(c)

print(d)
Buggy python submission (verdict: Time Limit Exceeded):
import collections
# Your code her
a = int(input())
b = [int(s) for s in input().split()]
b = sorted(b)
mod = int(1000000)
d = {}
e = collections.Counter(b)
X = int(0)
ans = int(0)

for i in range(a):
    if d.get(b[i]) == None:
        X = b[i]
        while X <= (mod-b[i]):
            X += b[i]
            d[X] = 1
        X = 0
    else:
        pass

for i in range(a):
    if e.get(b[i]) == 1:
        if d.get(b[i]) == None:
            ans += 1

print(ans)

Fixed submission:
import collections
# Your code her
a = int(input())
b = [int(s) for s in input().split()]
b = sorted(b)
mod = int(1000000)
d = {}
e = collections.Counter(b)
X = int(0)
ans = int(0)

for i in range(a):
    if d.get(b[i]) == None:
        if e.get(b[i]) != 1:
            d[b[i]] = 1
        X = b[i]
        while X <= (mod-b[i]):
            X += b[i]
            d[X] = 1
        X = 0
    else:
        pass

for i in range(a):
    if d.get(b[i]) == None:
        ans += 1

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
# coding: utf-8
import collections
# Your code her
a = int(input())
b = [int(s) for s in input().split()]
b = sorted(b)
mod = int(1000000)
c = []
d = tuple(c)
e = collections.Counter(b)
X = int(0)
ans = int(0)

for i in range(a):
    if (b[i] in d) is False:
        X = b[i]
        while X <= (mod-b[i]):
            X += b[i]
            c.append(X)
        d = tuple(c)
        X = 0
    else:
        pass

for i in range(a):
    if e.get(b[i]) == 1:
        if (b[i] in d) is False:
            ans += 1

print(ans)

Fixed submission:
import collections
# Your code her
a = int(input())
b = [int(s) for s in input().split()]
b = sorted(b)
mod = int(1000000)
d = {}
e = collections.Counter(b)
X = int(0)
ans = int(0)

for i in range(a):
    if d.get(b[i]) == None:
        if e.get(b[i]) != 1:
            d[b[i]] = 1
        X = b[i]
        while X <= (mod-b[i]):
            X += b[i]
            d[X] = 1
        X = 0
    else:
        pass

for i in range(a):
    if d.get(b[i]) == None:
        ans += 1

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

Fixed submission:
a = input().split()
print(int(a[0]) * int(a[1]))
Buggy python submission (verdict: Runtime Error):
# coding: utf-8
a = input()
if a = "Sunny":
  print("Cloudy")
elif a = "Cloudy":
  print("Rainy")
else:
  print("Sunny")

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

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

Fixed submission:
a = input()
if a == "Sunny":
  print("Cloudy")
elif a == "Cloudy":
  print("Rainy")
else:
  print("Sunny")
Buggy python submission (verdict: Runtime Error):
a = input().split()
b = input()
c = int(0)

for i in range(int(a[0])):
  if int(b[i]) <= 9 and int(b[i]) >= 0:
    pass
  else:
    c = 1

if b[int(a[0])] != "-":
  c = 1

for i in range(int(a[0]) + 1, int(a[0]) + int(a[1]) + 1):
  if int(b[i]) <= 9 and int(b[i]) >= 0:
    pass
  else:
    c = 1

if c == 1:
  print("No")
else:
  print("Yes")

Fixed submission:
a = input().split()
b = input()
c = int(0)

for i in range(int(a[0])):
  if b[i] == "-":
    c = 1
  else:
    pass

if b[int(a[0])] != "-":
  c = 1

for i in range(int(a[0]) + 1, int(a[0]) + int(a[1]) + 1):
  if b[i] == "-":
    c = 1
  else:
    pass

if c == 1:
  print("No")
else:
  print("Yes")