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

Fixed submission:
import math

def main():
  R = input()
  answer = float(R) * 2 * math.pi  
  print(answer)
  
if __name__ == '__main__':
  main()

Buggy submission (verdict: Runtime Error):
import math

def main():
  R = input()
  if 1 <= R <= 100:
    answer = float(R) * 2 / math.pi
  else:
    main()
  print(answer)
  
if __name__ == '__main__':
  main()

Buggy submission (verdict: Runtime Error):
R = input()
answer = R * 2 / 3.14
print(answer)

Buggy submission (verdict: Runtime Error):
def main():
  R = input()
  answer = R * 2 / 3.14
  print(answer)
  
if __name__ == '__main__':
  main()

Buggy submission (verdict: Runtime Error):
import math

def main():
  R = input()
  answer = R * 2 / 3.14
  print(answer)
  
if __name__ == '__main__':
  main()

Buggy submission (verdict: Runtime Error):
import math

def main():
  R = input()
  answer = R * 2 / math.pi
  print(answer)
  
if __name__ == '__main__':
  main()

Buggy submission (verdict: Runtime Error):
import math

def main():
  R = input()
  if 1 <= R <= 100:
    answer = R * 2 / math.pi
  else:
    main()
  print(answer)
  
if __name__ == '__main__':
  main()

Buggy submission (verdict: Runtime Error):
import numpy as np

def main():
  R = input()
  if 1 <= R <= 100:
    answer = R * 2 / np.pi
  else:
    main()
  print(answer)
  
if __name__ == '__main__':
  main()
Problem p02706 (python)

Fixed submission:
import math
import numpy as np

def main():
  N,M = (int(x) for x in input().split())
  A = [int(x) for x in input().split()]
  
  for i in range(M):
    N = N - A[i]
  
  if N < 0:
    print('-1')
  else:
    print(N)  
  
if __name__ == '__main__':
  main()

Buggy submission (verdict: Runtime Error):
import math
import numpy as np

def main():
  N,M = (int(x) for x in input().split())
  A = [int(x) for x in input().split(M)]
  
  for i in range(M):
    N = N - A[i]
  
  if N < 0:
    print('-1')
  else:
    print(N)  
  
if __name__ == '__main__':
  main()
Problem p03273 (python)

Fixed submission:
H,W = (int(i) for i in input().split())

a = [0 for i in range(H)]

for i in range(H):
    a[i] = list(input())

count = 0
check = []
n = 0
for i in range(H):
    for j in range(W):
        if a[i-n][j] == '#':
            count = 1
            break
    if count == 0:
        del a[i-n]
        n += 1
    count = 0

ck = []
n = 0
for i in range(W):
    for j in range(len(a)):
        if a[j][i] == '#':
            count = 1
            break
    if count == 0:
        ck.append(i)
    count = 0

for i in ck:
    for j in range(len(a)):
        del a[j][i-n]
    n += 1

ans = ''
for i in range(len(a)):
    for j in a[i]:
        ans += j
    print(ans)
    ans = ''

Buggy submission (verdict: Runtime Error):
H,W = (int(i) for i in input().split())

a = [0 for i in range(H)]

for i in range(H):
    a[i] = list(input())

count = 0
check = []
for i in range(H):
    for j in range(W):
        if a[i][j] == '#':
            count = 1
            break
    if count == 0:
        check.append(i)
    count = 0

for i in check:
    del a[i]

ck = []
for i in range(W):
    for j in range(len(a)):
        if a[j][i] == '#':
            count = 1
            break
    if count == 0:
        ck.append(i)
    count = 0

for i in ck:
    for j in range(len(a)):
        del a[j][i]

ans = ''
for i in range(len(a)):
    for j in a[i]:
        ans += j
    print(ans)
    ans = ''
Problem p03280 (python)

Fixed submission:
A,B = (int(i) for i in input().split())

S = (A-1)*(B-1)
print(S)

Buggy submission (verdict: Runtime Error):
A = int(input())
B = int(input())

S = (A-1)*(B-1)
print(S)
Problem p03284 (python)

Fixed submission:
N,K = (int(i) for i in input().split())

if N % K == 0:
    print(0)
else:
    print(1)

Buggy submission (verdict: Runtime Error):
N,M = (int(i) for i in input().split())
a = input()
s = a.split()
A = []
for i in range(N):
    A.append(int(s[i]))

count = 0
total = 0

for r in range(N):
    for j in range(int(r+1)):
        l = j
        total = 0
        while l <= r:
            total += A[l]
            if l == r:
                if total % M == 0:
                    count += 1
                    break
                else:
                    break
            else:
                l += 1
print(count)

Buggy submission (verdict: Runtime Error):
s = input("number of senbei:")
p = input("number of people:")
N = int(s)
K = int(p)

if N % K == 0:
    print(0)
else:
    print(1)

Buggy submission (verdict: Runtime Error):
s = input("number of senbei:")
p = input("number of people:")
N = int(s)
K = int(p)

member = []
for i in range(K):
    member.append(0)

n = N

if N <= K:
    for j in range(N):
        member[j] += 1
    print(member[0] - member[-1])
else:
    while n > 0:
        for l in range(K):
            member[l] += 1
        n = n - K
        if n >= K:
            continue
        elif 0 < n < K:
            for l in range(n):
                member[l] += 1
    print(member[0] - member[-1])
Problem p02899 (python)

Fixed submission:
import unittest


class TestC(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think([2, 3, 1]), [3, 1, 2])

    def test_2(self):
        self.assertEqual(think([1, 2, 3, 4, 5]), [1, 2, 3, 4, 5])

    def test_3(self):
        self.assertEqual(think([8, 2, 7, 3, 4, 5, 6, 1]), [8, 2, 4, 5, 6, 7, 3, 1])


def solve():
    a = read()
    result = think(a)
    write(result)


def read():
    n = read_int(1)[0]
    return read_int(n)


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(a):
    list_of_index_and_a = []
    for index, e in enumerate(a):
        list_of_index_and_a.append((index + 1, e))

    list_of_index_and_a.sort(key=lambda x: x[1])
    return [x[0] for x in list_of_index_and_a]


def write(result):
    print(' '.join(list(map(lambda x: str(x), result))))


if __name__ == '__main__':
    # unittest.main()
    solve()

Buggy submission (verdict: Runtime Error):
import unittest


class TestC(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think([2, 3, 1]), [3, 1, 2])

    def test_2(self):
        self.assertEqual(think([1, 2, 3, 4, 5]), [1, 2, 3, 4, 5])

    def test_3(self):
        self.assertEqual(think([8, 2, 7, 3, 4, 5, 6, 1]), [8, 2, 4, 5, 6, 7, 3, 1])


def solve():
    a = read()
    result = solve(a)
    write(result)


def read():
    n = read_int(1)[0]
    return read_int(n)


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(a):
    list_of_index_and_a = []
    for index, e in enumerate(a):
        list_of_index_and_a.append((index + 1, e))

    list_of_index_and_a.sort(key=lambda x: x[1])
    return [x[0] for x in list_of_index_and_a]


def write(result):
    print(result)


if __name__ == '__main__':
    # unittest.main()
    solve()
Problem p02988 (python)

Fixed submission:
import unittest


class TestB(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think([1, 3, 5, 4, 2]), 2)

    def test_2(self):
        self.assertEqual(think([9, 6, 3, 2, 5, 8, 7, 4, 1]), 5)


def solve():
    p = read()
    result = think(p)
    write(result)


def read():
    n = read_int(1)[0]
    return read_int(n)


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(data):
    n = len(data)
    count = 0
    for i in range(n):
        if i + 2 >= n:
            break
        if data[i] < data[i + 1] < data[i + 2] or data[i] > data[i + 1] > data[i + 2]:
            count += 1
    return count


def write(result):
    print(result)


if __name__ == '__main__':
    # unittest.main()
    solve()

Buggy submission (verdict: Runtime Error):
import unittest


class TestB(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think([1, 3, 5, 4, 2]), 2)

    def test_2(self):
        self.assertEqual(think([9, 6, 3, 2, 5, 8, 7, 4, 1]), 5)


def solve():
    p = read()
    result = think(p)
    write(result)


def read():
    n = read_int(1)[0]
    return read_int(n)


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(data):
    n = len(data)
    count = 0
    for i in range(n):
        if i + 2 >= n:
            break
        if data[i] < data[i + 1] < data[i + 2]:
            count += 1
    return count


def write(result):
    print(result)


if __name__ == '__main__':
    unittest.main()
    # solve()
Problem p03171 (python)

Fixed submission:
def solve():
    a = read()
    result = think(a)
    write(result)


def read():
    n = read_int(1)[0]
    return read_int(n)


def read_int(n):
    return list(map(int, read_line().split(' ')))[:n]


def read_float(n):
    return list(map(float, read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(a):
    n = len(a)
    dp = [[None for x in range(n)] for y in range(n)]
    for i in range(len(dp)):
        dp[i][i] = a[i]
    for l in range(n - 2, -1, -1):
        for r in range(l + 1, n):
            dp[l][r] = max(a[l] - dp[l + 1][r], a[r] - dp[l][r - 1])
    return dp[0][n - 1]


def write(result):
    print(result)


if __name__ == '__main__':
    solve()

Buggy submission (verdict: Runtime Error):
def solve():
    a = read()
    result = think(a)
    write(result)


def read():
    n = read_int(1)[0]
    return read_int(n)


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_float(n):
    return list(map(lambda x: float(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(a):
    n = len(a)
    dp = [[None for x in range(n)] for y in range(n)]
    recursive_call(dp, a, 0, n - 1)
    return dp[0][n - 1]


def recursive_call(dp, a, l, r):
    n = len(dp)
    if dp[l][r] is not None:
        return dp[l][r]
    if l == r:
        dp[l][r] = a[l]
        return dp[l][r]
    dp[l][r] = max(a[l] - recursive_call(dp, a, l + 1, r), a[r] - recursive_call(dp, a, l, r - 1))
    return dp[l][r]


def write(result):
    print(result)


if __name__ == '__main__':
    solve()
Problem p03632 (python)

Fixed submission:
def solve():
    a, b, c, d = read()
    result = think(a, b, c, d)
    write(result)


def read():
    return read_int(4)


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(a, b, c, d):
    if b <= c or d <= a:
        return 0
    elif a <= c and d <= b:
        return d - c
    elif c <= a and b <= d:
        return b - a
    else:
        if a == c:
            return min(b, d) - a
        elif a < c:
            return abs(c - b)
        else:  # a > c
            return abs(d - a)


def write(result):
    print(result)


if __name__ == '__main__':
    solve()

Buggy submission (verdict: Runtime Error):
def solve():
    a, b, c, d = read()
    result = think(a, b, c, d)
    write(result)


def read():
    return read_int(4)


def read_int(n):
    return list(map(lambda x: int(x), read_line().split(' ')))[:n]


def think(a, b, c, d):
    if b <= c or d <= a:
        return 0
    elif a <= c and d <= b:
        return d - c
    elif c <= a and b <= d:
        return b - a
    else:
        if a == c:
            return min(b, d) - a
        elif a < c:
            return abs(c - b)
        else:  # a > c
            return abs(d - a)


def write(result):
    print(result)


if __name__ == '__main__':
    solve()
Problem p04029 (python)

Fixed submission:
n = int(input())
sum = 0
for i in range(n+1):
    sum = sum + i
    
print(sum)

Buggy submission (verdict: Runtime Error):
s =str(input())

if len(s) == 2:
    if s[0]==s[1]:
        sIndex = 1
        eIndex = 2
    else:
        sIndex = -1
        eIndex = -1
elif len(s)>2:
    sIndex=-1
    eIndex=-1
    for i in range(len(s)-2):
        par_str = s[i:i+3]
        if (par_str.count(par_str[0])>=2) | (par_str.count(par_str[1])>=2):
            sIndex = i + 1
            eIndex = i + 3
            break
    
ans = str(sIndex)+' '+str(eIndex)
print(ans)

Buggy submission (verdict: Runtime Error):
import numpy as np
 
N =int(input())
 
a = np.array([int(i) for i in input().split()])
 
a_min = min(a)
a_max =max(a)
ans = 0
 
for i in range(a_min,a_max+1):
    diff_a = a - i
    dummy = int(sum([i**2 for i in diff_a]))
    if i == a_min:
        ans = dummy
    elif i>a_min:
        if ans > dummy:
            ans = dummy
 
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
ans = 10**9
for ai in range(min(a),max(a)+1):
    w = 0
    for aj in a:
        w += (ai-aj)**2
    ans = min(w,ans)
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))
ans = 10**9
for ai in range(min(a),max(a)+1):
    w = 0
    for aj in ai:
        w += (ai-aj)**2
    ans = min(w,ans)
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split().strip()))
ans =10**9
for ai in range(min(a),max(a)+1):
    w = 0
    for aj in a:
        w += (ai-aj)**2
    ans = min(w,ans)
print(ans)

Buggy submission (verdict: Runtime Error):

n = int(input())
a = list(map(int,input().split().strip()))
ans =10**9
for ai in range(min(a),max(a)):
    w = 0
    for aj in ai:
        w += (ai-aj)**2
    ans = min(w,ans)
print(ans)

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split().strip()))
ans =10**9
for ai in range(min(a),max(a)):
    w = 0
    for aj in a:
        w += (ai-aj)**2
    ans = min(w,ans)
print(ans)
Problem p04032 (python)

Fixed submission:
s =str(input())

if len(s) == 2:
    if s[0]==s[1]:
        sIndex = 1
        eIndex = 2
    else:
        sIndex = -1
        eIndex = -1
elif len(s)>2:
    sIndex=-1
    eIndex=-1
    for i in range(len(s)-2):
        par_str = s[i:i+3]
        if (par_str.count(par_str[0])>=2) | (par_str.count(par_str[1])>=2):
            sIndex = i + 1
            eIndex = i + 3
            break
    
ans = str(sIndex)+' '+str(eIndex)
print(ans)

Buggy submission (verdict: Runtime Error):
s =str(input())

if len(s) == 2:
    if s[0]==s[1]:
        sIndex = 1
        eIndex = 2
    else:
        sIndex = -1
        eIndex = -1
elif len(s)>2:
    sIndex=-1
    eIndex=-1
    for i in range(len(s)):
        par_str = s[i:i+3]
        if (par_str.count(par_str[0])>=2) | (par_str.count(par_str[1])>=2):
            sIndex = i + 1
            eIndex = i + 3
            break
    
ans = str(sIndex)+' '+str(eIndex)
print(ans)
Problem p04043 (python)

Fixed submission:
a= list(map(int,input().strip().split()))
cnt5 = 0
cnt7 = 0
for i in range(3):
    if a[i] == 5:
        cnt5 += 1
    if a[i] == 7:
        cnt7 += 1

if cnt5==2 and cnt7 ==1:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
n,l = map(int ,input().strip().split())
s = [""]*n
for i in range(n):
    s[i]=input()
s.sort()
sol = ""
for i in s:
    sol += i
print(sol)

Buggy submission (verdict: Runtime Error):
n,l = map(int ,input())
s = [""]*n
for i in range(n):
    s[i]=input()
s.sort()
sol = ""
for i in s:
    sol +=i
print(sol)
Problem p02706 (python)

Fixed submission:
def resolve():
    a,b = map(int, input().split())
    A = list(map(int, input().split()))
    count = 0

    for c in range(b):
        count += A[c]
    
    result = a - count
    if result < 0:
        print("-1")
    else:
        print(result)
    
resolve()

Buggy submission (verdict: Runtime Error):
def resolve():
    a,b = map(int, input().split())
    A = list(map(int, input().split()))
    count = 0

    for c in range(b):
        count += A[c]
    
    print(a - count)
    
 resolve()
Problem p03071 (python)

Fixed submission:
a,b=map(int,input().split())
coin = 0
for i in range(0,2):
    if a > b:
        coin += a
        a = a-1
    elif b > a:
        coin += b
        b = b-1
    else:
        coin += a
        a = a-1
print(coin)

Buggy submission (verdict: Runtime Error):
coin = 0
for i in range(0,2):
    if a > b:
        coin += a
        a = a-1
    elif b > a:
        coin += b
        b = b-1
    else:
        coin += a
        a = a-1
print(coin)
Problem p03447 (python)

Fixed submission:
x,a,b = [int(input()) for i in range(3)]
print((x-a)%b)

Buggy submission (verdict: Runtime Error):
x,a,b = [int(input()) for i in range(3)]
print((x-a)%bå)
Problem p02705 (python)

Fixed submission:
import numpy as np

def calculate_length(radius):
    return 2.0 * radius * np.pi

if __name__ == "__main__":
    radius = int(input())
    print(calculate_length(radius))

Buggy submission (verdict: Runtime Error):
import numpy as np

def calculate_length(int radius):
    return 2.0 * radius * np.pi

if __name__ == "__main__":
    radius = int(input())
    print(calculate_rength(radius))
Problem p02811 (python)

Fixed submission:
def is_much_money(num_of_coin, yen):
  if num_of_coin * 500 >= yen:
    return "Yes"
  else:
    return "No"
 
if __name__ == "__main__":
    num_of_coin, yen = input().split()
    judgement = is_much_money(int(num_of_coin), int(yen))
    print(judgement)

Buggy submission (verdict: Runtime Error):
def is_much_money(num_of_coin, yen):
  if num_of_coin * 500 >= yen:
    return "Yes"
  else:
    return "No"

if __name__ == "__main__":
    num_of_coin, yen = int(input().split())
    judgement = is_much_mony(num_of_coin, yen)
    print(judgement)
Problem p02705 (python)

Fixed submission:
import math

R = int(input())

print (float(R*2*math.pi))

Buggy submission (verdict: Runtime Error):
import math
 
R = int(input())
 
print float(R*2*math.pi())

Buggy submission (verdict: Runtime Error):
import math

R = int(input())

print R*2*math.pi()

Buggy submission (verdict: Runtime Error):
import math

R = input()

print R * 2 *math.pi()
Problem p02706 (python)

Fixed submission:
import math

n, m = map(int, input().split())
a = list(map(int, input().split()))

if (n-sum(a)) < 0:
    print(-1)
else:
    print(n-sum(a))

Buggy submission (verdict: Runtime Error):
N, M = int(input().split())
A = input.split()
total = 0
for i in range(A):
    total = total+A[i]

if total <= N:
    print (N - total)
else:
    print ("-1")

Buggy submission (verdict: Runtime Error):
N = int(input())
M = int(input())
total = 0
 
for i in range(M):
    A = int(input())
    total = total+A
 
if total <= N:
    print (N - total)
else:
    print ("-1")

Buggy submission (verdict: Runtime Error):
N = int(input())
M = int(input())
total = 0

for i in range(M):
    A = int(input())
    total = total+A

if total <= N:
    print (N - total)
else:
    print (-1)

Buggy submission (verdict: Runtime Error):
N = int(input())
M = int(input())
total = 0

for i in range(M):
  	A = int(input())
    total = total + A
    
if total <= N:
    print (N - total)
else:
  	print "-1"
Problem p02747 (python)

Fixed submission:
S = raw_input()

length = len(S)
if length % 2 == 0:
  if S.count('hi')==length/2:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
S = raw_input()

length = len(S)
if length % 2 == 0:
  if n.count('hi')==length/2:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Buggy submission (verdict: Runtime Error):
S = input()
if 'hi' in S:
    print 'Yes'
elif:
    print 'No'
Problem p03737 (python)

Fixed submission:
s1,s2,s3 = input().split()
print(s1[0].capitalize() + s2[0].capitalize() + s3[0].capitalize())

Buggy submission (verdict: Runtime Error):
A = int(input())
B = int(input())
if A > B:
    print('GREATER')
elif A < B:
    print('LESS')
else:
    print('EQUAL')

Buggy submission (verdict: Runtime Error):
A = int(input())
B = int(input())
if A > B:
  print("GREAT")
elif A < B:
  print("LESS")
else:
  print("EQUAL")

Buggy submission (verdict: Runtime Error):
s1,s2,s3 = map(int,input().split())
print(s1[0].capitalize() + s2[0].capitalize() + s3[0].capitalize())

Buggy submission (verdict: Runtime Error):
s1,s2,s3 = map(int,input().split())
print(s1[0].capitalize() + s2[0].capitalize() + s3[0]capitalize())
Problem p03273 (python)

Fixed submission:
h, w = map(int, input().split())
a = [''] * h
for i in range(h):
	a[i] = input()

row = [False] * h
col = [False] * w
for i in range(h):
	for j in range(w):
		if a[i][j] == '#':
			row[i] = True
			col[j] = True

for i in range(h):
	if row[i]:
		for j in range(w):
			if col[j]:
				print(a[i][j], end = '')
		print()

Buggy submission (verdict: Runtime Error):
h, w = map(int, input().split())
a = [[input()] for _ in range(h)]
row = [False] * h
col = [False] * w
for i in range(h):
    for j in range(w):
        if a[i][j] == '#':
            row[i] = True
            col[j] = True
for i in range(h):
    if row[i]:
        for j in range(w):
            if col[j]:
                print(a[i][j], end='')
        print()

Buggy submission (verdict: Runtime Error):
h, w = map(int, input().split())
a = [[input().split()] for _ in range(h)]
row = [False] * h
col = [False] * w
for i in range(h):
    for j in range(w):
        if a[i][j] == '#':
            row[i] = True
            col[j] = True
for i in range(h):
    if row[i]:
        for j in range(w):
            if col[j]:
                print(a[i][j], end='')
        print()
Problem p03281 (python)

Fixed submission:
n = int(input())
a = 0
if n >= 105:
    a += 1
if n >= 135:
    a += 1
if n >= 165:
    a += 1
if n >= 189:
    a += 1
if n >= 195:
    a += 1
print(a)

Buggy submission (verdict: Runtime Error):
n = int(input())
int a = 0
if n >= 105:
    a += 1
if n >= 165:
  a += 1
if n >= 195:
  a += 1
print(a)

Buggy submission (verdict: Runtime Error):
n = int(input().split())
if n >= 105:
    print(1)
else:
  print(0)
Problem p03293 (python)

Fixed submission:
s = input()
t = input()
for _ in range(len(t)):
  if s == t:
    print("Yes")
    exit()
  t = t[-1] + t[:-1]
print("No")

Buggy submission (verdict: Runtime Error):
s = input()
t = input()
t2 = t[-1] + t[1:]
while t2 != t:
  if s == t2:
    print("yes")
    return 0
  t2 = t[-1] + t[1:]
print("no")

Buggy submission (verdict: Runtime Error):
import copy
s = input()
t = input()
t2 = t[-1] + t[1:]
while t2 != t:
  if s = t2:
    print("yes")
    return 0
  t2 = t[-1] + t[1:]
print("no")
Problem p03294 (python)

Fixed submission:
_ = input()
a = list(map(int,input().split()))
print(sum(a) - len(a))

Buggy submission (verdict: Runtime Error):
n = int(input())
a = [int(input()) - 1 for _ in range(n)]
print(sum(a))
Problem p03455 (python)

Fixed submission:
a = input().split()
if int(a[0])* int(a[1]) % 2 == 0:
  print("Even")
else:
  print("Odd")

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