Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque,defaultdict
H,W = map(int,input().split())
s = [["#"]*(W+2)] + [list("#"+input()+"#") for _ in range(H)] + [["#"]*(W+2)]
Q = deque([(1,1,1)])
cnt = 0
for S in s[1:-1]:
    cnt += S.count(".")

while Q:
    x,y,d = Q.popleft()
    s[x][y] = "#"
    if x == H and y == W:
        route = d
        break
    for dx,dy in [(1,0),(-1,0),(0,1),(0,-1)]:
        if s[x+dx][y+dy] == ".":
            Q.append((x+dx,y+dy,d+1))
else:
    print(-1)
    exit()

print(cnt-route)


Fixed submission:
from collections import deque,defaultdict
H,W = map(int,input().split())
s = [["#"]*(W+2)] + [list("#"+input()+"#") for _ in range(H)] + [["#"]*(W+2)]
Q = deque([(1,1,1)])
cnt = 0
for S in s[1:-1]:
    cnt += S.count(".")

while Q:
    x,y,d = Q.popleft()
    s[x][y] = "#"
    if x == H and y == W:
        route = d
        break
    for dx,dy in [(1,0),(-1,0),(0,1),(0,-1)]:
        if s[x+dx][y+dy] == ".":
            Q.append((x+dx,y+dy,d+1))
            s[x+dx][y+dy] = "#"
else:
    print(-1)
    exit()

print(cnt-route)
Buggy python submission (verdict: Time Limit Exceeded):
def main():
    N,Y = map(int,input().split())
    Y //= 1000
    for i in range(N+1):
        for j in range(N+1-i):
            for k in range(N+1-i-j):
                if i+j+k == N and 10*i + 5*j + k == Y:
                    print(i,j,k)
                    exit()
    print(-1,-1,-1)

if __name__ == '__main__':
    main()


Fixed submission:
N,Y = map(int,input().split())
Y //= 1000
for i in range(N+1):
    for j in range(N+1-i):
        if 10*i + 5*j + 1*(N-i-j) == Y:
            print(i,j,N-i-j)
            exit()
print(-1,-1,-1)

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    N,Y = map(int,input().split())
    Y //= 1000
    for i in range(N+1):
        for j in range(N+1-i):
            for k in range(N+1-i-j):
                if i+j+k == N and 10*i + 5*j + k == Y:
                    print(i,j,k)
                    exit()
    print(-1,-1,-1)

if __name__ == '__main__':
    main()


Fixed submission:
N,Y = map(int,input().split())
Y //= 1000
for i in range(N+1):
    for j in range(N+1-i):
        if 10*i + 5*j + 1*(N-i-j) == Y:
            print(i,j,N-i-j)
            exit()
print(-1,-1,-1)
Buggy python submission (verdict: Runtime Error):
import math
x, y = map(int, input().split())
if math.gcd(x, y) == x:
	print(-1)
else:
	print(x)

Fixed submission:
x, y = map(int, input().split())
if x % y == 0:
    print(-1)
else:
    print(x)
Buggy python submission (verdict: Runtime Error):
n, k = map(int, raw_input().split())
sum = 0
array = []
for i in range(n):
    a, b = map(int, raw_input().split())
    sum += b
    if k <= sum:
        break
    for j in range(b):
        array.append(a)

array.sort()
print array[k]


Fixed submission:
n, k = map(int, raw_input().split())
counter = {}
for i in range(n):
    a, b = map(int, raw_input().split())
    if counter.has_key(a):
        counter[a] += b
    else:
        counter[a] = b

num = 0
for ele in sorted(counter.items()):
    num += ele[1]
    if k <= num:
        print ele[0]
        break
Buggy python submission (verdict: Runtime Error):
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# /home/remina/PycharmProjects/atcoder/C-TaxIncrease.py
#
import sys
import math


def calc_notaxincluded_min_from_tax8(tax8: int) -> int:
    notaxincluded_min = int(tax8 / 0.08)
    return notaxincluded_min


def calc_notaxincluded_max_from_tax8(tax8: int) -> int:
    notaxincluded_max = math.ceil((tax8 + 1) / 0.08)
    return notaxincluded_max


def calc_notaxincluded_min_from_tax10(tax10: int) -> int:
    notaxincluded_min = int(tax10 / 0.1)
    return notaxincluded_min


def calc_notaxincluded_max_from_tax10(tax10: int) -> int:
    notaxincluded_max = math.ceil((tax10 + 1) / 0.1)
    return notaxincluded_max


tax_8, tax_10 = map(int, sys.stdin.readline().split())
notax_min_from8 = calc_notaxincluded_min_from_tax8(tax_8)
notax_min_from10 = calc_notaxincluded_min_from_tax10(tax_10)
notax_max_from8 = calc_notaxincluded_max_from_tax8(tax_8)
notax_max_from10 = calc_notaxincluded_max_from_tax10(tax_10)

print(notax_min_from8)
print(notax_min_from10)
print(notax_max_fromA8)
print(notax_max_from10)


if (notax_min_from10 > notax_max_from8) or (notax_min_from8 > notax_min_from10):
    print(-1)
elif notax_min_from8 <= notax_min_from10:
    print(notax_min_from8)
else:
    print(notax_min_from10)


Fixed submission:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# /PycharmProjects/atcoder/C-TaxIncrease.py
#
A, B = map(int, input().split())
ans = -1
for i in range (1000 + 1):
    if (int(i*0.08) == A) and (int(i*0.10) == B):
        ans = i
        break
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-.py
#
import collections

n = int(input())
l = [str(input()) for i in range(n)]
# l = ["beat", "vet", "beet", "bed", "vet", "bet", "beet"]
c = collections.Counter(l)
number_of_words = len(c)
ans_before_sort = [c.most_common()[0][0]]

for i in range(number_of_words-1):
    if c.most_common()[i][1] == c.most_common()[i+1][1]:
        ans_before_sort.append(c.most_common()[i+1][0])
    else:
        break

ans_after_sort = sorted(ans_before_sort)
print('\n'.join(ans_after_sort))


Fixed submission:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-.py
#
import collections

n = int(input())
l = [str(input()) for i in range(n)]
# l = ["beat", "vet", "beet", "bed", "vet", "bet", "beet"]
c = collections.Counter(l)
number_of_words = len(c)
counted_list = c.most_common()
ans_before_sort = [counted_list[0][0]]

for i in range(number_of_words-1):
    if counted_list[i][1] == counted_list[i+1][1]:
        ans_before_sort.append(counted_list[i+1][0])
    else:
        break

ans_after_sort = sorted(ans_before_sort)
print('\n'.join(ans_after_sort))

Buggy python submission (verdict: Runtime Error):
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-.py
#
import collections

n = int(input())
l = [str(input()) for i in range(n)]
# l = ["beat", "vet", "beet", "bed", "vet", "bet", "beet"]
c = collections.Counter(l)
number_of_words = len(c)
ans_before_sort = [c.most_common()[0][0]]

for i in range(number_of_words):
    if c.most_common()[i][1] == c.most_common()[i+1][1]:
        ans_before_sort.append(c.most_common()[i+1][0])
    else:
        break

ans_after_sort = sorted(ans_before_sort)
print('\n'.join(ans_after_sort))


Fixed submission:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-.py
#
import collections

n = int(input())
l = [str(input()) for i in range(n)]
# l = ["beat", "vet", "beet", "bed", "vet", "bet", "beet"]
c = collections.Counter(l)
number_of_words = len(c)
counted_list = c.most_common()
ans_before_sort = [counted_list[0][0]]

for i in range(number_of_words-1):
    if counted_list[i][1] == counted_list[i+1][1]:
        ans_before_sort.append(counted_list[i+1][0])
    else:
        break

ans_after_sort = sorted(ans_before_sort)
print('\n'.join(ans_after_sort))
Buggy python submission (verdict: Runtime Error):
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-Snack.py
#
import math

a, b = map(int, input().split())
ans = int(a * b / math.gcd(a, b))
print(ans)


Fixed submission:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-Snack.py
#
from fractions import gcd

a, b = map(int, input().split())
ans = int(a * b // gcd(a, b))
print(ans)

Buggy python submission (verdict: Runtime Error):
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-Snack.py
#
import math

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


def lcm(a: int, b: int) -> int:
    return a * b / math.gcd(a, b)


print(int(lcm(a, b)))


Fixed submission:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-Snack.py
#
from fractions import gcd

a, b = map(int, input().split())
ans = int(a * b // gcd(a, b))
print(ans)
Buggy python submission (verdict: Runtime Error):
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-RemainderMinimization.py
#
import math
a, b, c, d = map(int, input().split())
cd_lcm = (c * d) // math.gcd(c, d)
ab_c = b//c - (a-1)//c
ab_d = b//d - (a-1)//d
ab_cd_both = b//cd_lcm - (a-1)//cd_lcm
ab_cd_either = ab_c + ab_d - ab_cd_both
ab_cd_neither = b-a+1 - ab_cd_either

print(ab_cd_neither)


Fixed submission:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-RemainderMinimization.py
#
# import math
from fractions import gcd
a, b, c, d = map(int, input().split())
# cd_lcm = (c * d) // math.gcd(c, d)
cd_lcm = (c * d) // gcd(c, d)
ab_c = b//c - (a-1)//c
ab_d = b//d - (a-1)//d
ab_cd_both = b//cd_lcm - (a-1)//cd_lcm
ab_cd_either = ab_c + ab_d - ab_cd_both
ab_cd_neither = b-a+1 - ab_cd_either

print(ab_cd_neither)

Buggy python submission (verdict: Runtime Error):
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-RemainderMinimization.py
#
import math
a, b, c, d = map(int, input().split())
cd_lcm = (c * d) // math.gcd(c, d)
ab_c = b//c - (a-1)//c
ab_d = b//d - (a-1)//d
ab_cd_both = b//cd_lcm - (a-1)//cd_lcm
ab_cd_either = ab_c + ab_d - ab_cd_both
ab_cd_neither = b-a+1 - ab_cd_either
# print("cd_lcm ab_cd_either {} {}".format(cd_lcm, ab_cd_either))

print(ab_cd_neither)


Fixed submission:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-RemainderMinimization.py
#
# import math
from fractions import gcd
a, b, c, d = map(int, input().split())
# cd_lcm = (c * d) // math.gcd(c, d)
cd_lcm = (c * d) // gcd(c, d)
ab_c = b//c - (a-1)//c
ab_d = b//d - (a-1)//d
ab_cd_both = b//cd_lcm - (a-1)//cd_lcm
ab_cd_either = ab_c + ab_d - ab_cd_both
ab_cd_neither = b-a+1 - ab_cd_either

print(ab_cd_neither)

Buggy python submission (verdict: Runtime Error):
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-RemainderMinimization.py
#
import math
a, b, c, d = map(int, input().split())
cd_lcm = (c * d) // math.gcd(c, d)
ab_c = b//c - (a-1)//c
ab_d = b//d - (a-1)//d
ab_cd_both = b//cd_lcm - (a-1)//cd_lcm
ab_cd_either = ab_c + ab_d - ab_cd_both
ab_cd_neither = b-a+1 - ab_cd_either
# print("cd_lcm ab_cd_either {} {}".format(cd_lcm, ab_cd_either))

print(ab_cd_neither)


Fixed submission:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-RemainderMinimization.py
#
# import math
from fractions import gcd
a, b, c, d = map(int, input().split())
# cd_lcm = (c * d) // math.gcd(c, d)
cd_lcm = (c * d) // gcd(c, d)
ab_c = b//c - (a-1)//c
ab_d = b//d - (a-1)//d
ab_cd_both = b//cd_lcm - (a-1)//cd_lcm
ab_cd_either = ab_c + ab_d - ab_cd_both
ab_cd_neither = b-a+1 - ab_cd_either

print(ab_cd_neither)
Buggy python submission (verdict: Runtime Error):
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-RectangleCutting.py
#
w, h, x, y = map(int, input().split())
if x == w or y == h:
    print(0, 0)
    exit()

left = x * h
right = (w - x) * h
up = w * (h - y)
# down = w * y
area = left
cutting = 0
print("left, right, up, down : {} {} {} {}".format(left, right, up, down))

if left == right:
    area = left
elif up == down:
    area = up
elif left < right:
    if up < down:
        if left == up:
            area = left
            cutting = 1
        elif left < up:
            area = left
        else:
            area = up
    else:
        if left == down:
            area = left
            cutting = 1
        elif left < down:
            area = left
        else:
            area = down
else:
    if up < down:
        if right == up:
            area = right
            cutting = 1
        elif right < up:
            area = right
        else:
            area = up
    else:
        if right == down:
            area = right
            cutting = 1
        elif right < down:
            area = right
        else:
            area = down

print(area, cutting)

Fixed submission:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-RectangleCutting.py
#
w, h, x, y = map(int, input().split())
cutting = 0
if w == 2 * x and h == 2 * y:
  cutting += 1
print(w*h/2, cutting)
Buggy python submission (verdict: Time Limit Exceeded):
n, m = map(int, input().split())
can_through = ["1" for _ in range(n)]
# cnt = 0

for i in range(m):
    l, r = map(int, input().split())
    # for j in range(1, n+1):
    #     if can_through[j-1]:
    #         if l <= j <= r:
    #             pass
    #         else:
    #             can_through[j-1] = False

    # print(can_through[:2])
    # print(can_through[2:])
    can_through[:l-1] = "0"*(l-1)
    # print(can_through)
    can_through[r:n] = "0"*(n-r)

    # print(can_through)

print(can_through.count("1"))

Fixed submission:
N, M = map(int, input().split())
ans = 0
L, R = 0, 100000

for i in range(M):
    Ltmp, Rtmp = map(int, input().split())
    L, R = max(L, Ltmp), min(R, Rtmp)

print(max(0, R - L + 1))

Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-Prison.py
#
n, m = map(int, input().split())
can_through = [True for _ in range(n)]
cnt = 0

for i in range(m):
    l, r = map(int, input().split())
    for j in range(1, n+1):
        if can_through[j-1]:
            if l <= j <= r:
                pass
            else:
                can_through[j-1] = False
    # print(can_through)

for j in range(n):
    if can_through[j]:
        cnt += 1

print(cnt)


Fixed submission:
N, M = map(int, input().split())
ans = 0
L, R = 0, 100000

for i in range(M):
    Ltmp, Rtmp = map(int, input().split())
    L, R = max(L, Ltmp), min(R, Rtmp)

print(max(0, R - L + 1))

Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-Prison.py
#
n, m = map(int, input().split())
can_through = [True for _ in range(n)]
cnt = 0

for i in range(m):
    l, r = map(int, input().split())
    for j in range(1, n+1):
        if l <= j <= r:
            pass
        else:
            can_through[j-1] = False
    # print(can_through)

for j in range(n):
    if can_through[j]:
        cnt += 1

print(cnt)


Fixed submission:
N, M = map(int, input().split())
ans = 0
L, R = 0, 100000

for i in range(M):
    Ltmp, Rtmp = map(int, input().split())
    L, R = max(L, Ltmp), min(R, Rtmp)

print(max(0, R - L + 1))
Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-GuessTheNumber.py
#
k, s = map(int, input().split())
pattern = 0

for x in range(min(k+1, s+1)):
    x_tmp = x
    for y in range(min(k+1, s+1-x_tmp)):
        y_tmp = y
        for z in range(min(k+1, s+1-x_tmp-y_tmp)):
            if x_tmp + y_tmp + z == s:
                pattern += 1

print(pattern)

Fixed submission:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-GuessTheNumber.py
#
k, s = map(int, input().split())
pattern = 0

if s == 0 or s == 1:
    print(1)
    exit()

if s <= k:
    print((s+2)*(s+1)//2)
    exit()

# elif 2*k < s <= 3*k:
#     for i in range(k+1):
#         x = k - i
#         y = k
#         z = s - x - y
#         if z <= k:
#             pattern += (y - z + 1)
#         else:
#             break

for x in range(k+1):
    for y in range(k+1):
        z = s - x - y
        if 0 <= z <= k:
            pattern += 1


# for x in range(k+1):
#     x_tmp = x
#     for y in range(x_tmp, k+1):
#         y_tmp = y
#         for z in range(y_tmp, s+1-x_tmp-y_tmp):
#             if x_tmp + y_tmp + z == s:
#                 if x_tmp == y_tmp == z:
#                     pattern += 1
#                 elif x_tmp == y_tmp or x_tmp == z or y_tmp == z:
#                     pattern += 3
#                 else:
#                     pattern += 6
#                 break

print(pattern)

Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-GuessTheNumber.py
#
k, s = map(int, input().split())
pattern = 0

for x in range(k+1):
    for y in range(k+1):
        for z in range(k+1):
            if x + y + z == s:
                pattern += 1

print(pattern)

Fixed submission:
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-GuessTheNumber.py
#
k, s = map(int, input().split())
pattern = 0

if s == 0 or s == 1:
    print(1)
    exit()

if s <= k:
    print((s+2)*(s+1)//2)
    exit()

# elif 2*k < s <= 3*k:
#     for i in range(k+1):
#         x = k - i
#         y = k
#         z = s - x - y
#         if z <= k:
#             pattern += (y - z + 1)
#         else:
#             break

for x in range(k+1):
    for y in range(k+1):
        z = s - x - y
        if 0 <= z <= k:
            pattern += 1


# for x in range(k+1):
#     x_tmp = x
#     for y in range(x_tmp, k+1):
#         y_tmp = y
#         for z in range(y_tmp, s+1-x_tmp-y_tmp):
#             if x_tmp + y_tmp + z == s:
#                 if x_tmp == y_tmp == z:
#                     pattern += 1
#                 elif x_tmp == y_tmp or x_tmp == z or y_tmp == z:
#                     pattern += 3
#                 else:
#                     pattern += 6
#                 break

print(pattern)
Buggy python submission (verdict: Runtime Error):
X=int(input())
year = 0
deposit = 100 
while  deposit < x :
    deposit = deposit*101//100
    year += 1
print(year) 


Fixed submission:
X=int(input())
year = 0
deposit = 100 
while  deposit < X :
    deposit = deposit*101//100
    year += 1
print(year)

Buggy python submission (verdict: Runtime Error):
X=int(input())
year = 0
deposit = 100 
while  deposit < x :
    deposit+=deposit*101//100
    year += 1
print(year) 


Fixed submission:
X=int(input())
year = 0
deposit = 100 
while  deposit < X :
    deposit = deposit*101//100
    year += 1
print(year)
Buggy python submission (verdict: Time Limit Exceeded):
import collections
N=int(input())
S = [str(input()) for _ in range(N)]
c = collections.Counter(S)
most = []
for i in c.most_common():
    if i[1]==c.most_common()[0][1]:
        most.append(i[0])
most.sort()
for i in most:
    print(i)

Fixed submission:
import collections
N=int(input())
S = [str(input()) for _ in range(N)]
c = collections.Counter(S)
most = []
most_num=c.most_common()[0][1]
for i in c.most_common():
    if i[1]==most_num:
        most.append(i[0])
most.sort()
for i in most:
    print(i)
Buggy python submission (verdict: Runtime Error):
X,Y=map(int,input().split())
if X==1 :
    x=300000
elif X==2 :
    x=200000
elif X==3 :
    x=100000
if Y==1 :
    y=300000
elif Y==2 :
    y=200000
elif Y==3 :
    y=100000
if X==1 and Y==1 :
    print(x+y+400000)
else :
    print(x+y)

Fixed submission:
X,Y=map(int,input().split())
if X==1 :
    x=300000
elif X==2 :
    x=200000
elif X==3 :
    x=100000
else :
    x=0
if Y==1 :
    y=300000
elif Y==2 :
    y=200000
elif Y==3 :
    y=100000
else :
    y=0
if X==1 and Y==1 :
    print(x+y+400000)
else :
    print(x+y)

Buggy python submission (verdict: Runtime Error):
X,Y=map(int,input().split())
if X==1 :
    x=300000
elif X==2 :
    x=200000
elif X==3 :
    x=100000
if Y==1 :
    y=300000
elif Y==2 :
    y=200000
elif Y==3 :
    y=100000
if X==1 and Y==1 :
    print(x+y+400000)
else :
    print(x+y)

Fixed submission:
X,Y=map(int,input().split())
if X==1 :
    x=300000
elif X==2 :
    x=200000
elif X==3 :
    x=100000
else :
    x=0
if Y==1 :
    y=300000
elif Y==2 :
    y=200000
elif Y==3 :
    y=100000
else :
    y=0
if X==1 and Y==1 :
    print(x+y+400000)
else :
    print(x+y)
Buggy python submission (verdict: Runtime Error):
D=input()
if D=25 :
    print('Christmas')
elif D=24 :
    print('Christmas Eve')
elif D=23 :
    print('Christmas Eve Eve')
elif D=22 :
    print('Christmas Eve Eve Eve')

Fixed submission:
D=int(input())
if D==25 :
    print('Christmas')
elif D==24 :
    print('Christmas Eve')
elif D==23 :
    print('Christmas Eve Eve')
elif D==22 :
    print('Christmas Eve Eve Eve')
Buggy python submission (verdict: Runtime Error):
S=list(input())
X=753
ans=0
for i in range(0,8,1) :
    for j in range(0,8,1) :
        if int(S[i]) == j :
            demo = int(S[i]+S[i+1]+S[i+2])
            if demo >= ans :
                ans = demo
print(abs(X-ans))

Fixed submission:
s = input()
ans = 9999
for i in range(len(s)-2):
  ans = min(ans,abs( int(s[i:i+3]) - 753 ))
print(ans)
Buggy python submission (verdict: Runtime Error):
# -*- coding: <encoding name> -*-

n = int(input())
total = 0
for i in range(1, n + 1):
	if (i % 3) != 0 and (i % 5) != 0:
		total +=
print(total)


Fixed submission:
# -*- coding: <encoding name> -*-

n = int(input())
total = 0
for i in range(1, n + 1):
	if (i % 3) != 0 and (i % 5) != 0:
		total += i
print(total)

Buggy python submission (verdict: Runtime Error):
# -*- coding: <encoding name> -*-

n = int(input())
total = 0
for i in range(1, n + 1):
	if i % 3 != 0 and i % 5 != 0:
		total +=
print(total)


Fixed submission:
# -*- coding: <encoding name> -*-

n = int(input())
total = 0
for i in range(1, n + 1):
	if (i % 3) != 0 and (i % 5) != 0:
		total += i
print(total)
Buggy python submission (verdict: Runtime Error):
# -*- coding: <encoding name> -*-

x = int(input())
print(1000 * (x // 500) + 5 * (x % 500 // 5)

Fixed submission:
# -*- coding: <encoding name> -*-

x = int(input())
print(1000 * (x // 500) + 5 * (x % 500 // 5))
Buggy python submission (verdict: Runtime Error):
# -*- coding: <encoding name> -*-

s = input()
s_former = s[:(len(s) - 1) // 2]
s_latter = s[(len(s) + 3) // 2 - 1:]
print('Yes' if s == s[::-1] and s_former == s_former[::-1] and s_latter == s_latter[::-1] else 'No')
v

Fixed submission:
S = input()
N = len(S)
S1 = S[0:(N-1)//2]
S2 = S[(N+3)//2-1:N+1]
print("Yes" if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1] else "No")

Buggy python submission (verdict: Runtime Error):
# -*- coding: <encoding name> -*-

s = input()
s_former = s[:(len(s) - 1) / 2]
s_latter = s[(len(s) + 3) / 2 - 1:]
print('Yes' if s == s[::-1] and s_former == s_former[::-1] and s_latter == s_latter[::-1] else 'No')


Fixed submission:
S = input()
N = len(S)
S1 = S[0:(N-1)//2]
S2 = S[(N+3)//2-1:N+1]
print("Yes" if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1] else "No")

Buggy python submission (verdict: Runtime Error):
# -*- coding: <encoding name> -*-

s = input()
s_former = s[:(len(s) - 1) / 2 + 1]
s_latter = s[(len(s) + 3) / 2 + 1:]
print('Yes' if s == s[::-1] and s_former == s_former[::-1] and s_latter == s_latter[::-1] else 'No')


Fixed submission:
S = input()
N = len(S)
S1 = S[0:(N-1)//2]
S2 = S[(N+3)//2-1:N+1]
print("Yes" if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1] else "No")

Buggy python submission (verdict: Runtime Error):
# -*- coding: <encoding name> -*-

s = input()
s_former = s[:(n - 1) / 2 + 1]
s_latter = s[(n + 3) / 2 + 1:]
print('Yes' if s == s[::-1] and s_former == s_former[::-1] and s_latter == s_latter[::-1] else 'No')


Fixed submission:
S = input()
N = len(S)
S1 = S[0:(N-1)//2]
S2 = S[(N+3)//2-1:N+1]
print("Yes" if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1] else "No")

Buggy python submission (verdict: Runtime Error):
# -*- coding: <encoding name> -*-

s = input()
s_former = s[:(n - 1) / 2 + 1]
s_latter = s[(n + 3) / 2 + 1:]
print('Yes' if s == s[::-1] and s_former == s_former[::-1] and s_latter == s_latter[::-1])


Fixed submission:
S = input()
N = len(S)
S1 = S[0:(N-1)//2]
S2 = S[(N+3)//2-1:N+1]
print("Yes" if S == S[::-1] and S1 == S1[::-1] and S2 == S2[::-1] else "No")