Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
aList = list(map(int, input().split()))
aLen = len(aList)
aSet = sorted(list(set(aList)))
aSum = 0
for a in aSet:
    aCount = aList.count(a)
    if aCount > a:
        aSum += aCount - a
    if aCount < a:
        aSum += aCount
    # aLen -= aCount
    # if a > aLen:
    #     aSum += aLen
    #     break

print(aSum)


Fixed submission:
n = int(input())
aList = list(map(int, input().split()))
aLen = len(aList)
aSet = sorted(list(set(aList)))
aSum = 0
for a in aSet:
    aCount = aList.count(a)
    if aCount > a:
        aSum += aCount - a
    if aCount < a:
        aSum += aCount
    aLen -= aCount
    if a > aLen:
        aSum += aLen
        break

print(aSum)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
aList = list(map(int, input().split()))
aSet = list(set(aList))
aSum = 0
for a in aSet:
    aCount = aList.count(a)
    if aCount > a:
        aSum += aCount - a
        continue
    if aCount == a:
        continue
    if aCount < a:
        aSum += aCount
        continue
print(aSum)


Fixed submission:
n = int(input())
aList = list(map(int, input().split()))
aLen = len(aList)
aSet = sorted(list(set(aList)))
aSum = 0
for a in aSet:
    aCount = aList.count(a)
    if aCount > a:
        aSum += aCount - a
    if aCount < a:
        aSum += aCount
    aLen -= aCount
    if a > aLen:
        aSum += aLen
        break

print(aSum)
Buggy python submission (verdict: Time Limit Exceeded):
import math
import sys
readline = sys.stdin.readline


def main():
    n, k = map(int, readline().rstrip().split())
    a = list(map(int, readline().rstrip().split()))
    setA = list(set(a))
    arr = [0] * len(setA)
    for l in range(len(setA)):
        arr[l] = a.count(setA[l])
    print(sum(sorted(arr, reverse=True)[k: len(arr)]))


if __name__ == '__main__':
    main()


Fixed submission:
import math
import sys
from collections import Counter
readline = sys.stdin.readline


def main():
    n, k = map(int, readline().rstrip().split())
    a = list(map(int, readline().rstrip().split()))
    c = Counter(a)
    print(sum(sorted(c.values(), reverse=True)[k: len(c)]))


if __name__ == '__main__':
    main()

Buggy python submission (verdict: Time Limit Exceeded):
import math
import sys
readline = sys.stdin.readline


def main():
    n, k = map(int, readline().rstrip().split())
    a = list(map(int, readline().rstrip().split()))
    setA = list(set(a))
    arr = []
    for l in setA:
        arr.append(a.count(l))
    print(sum(sorted(arr, reverse=True)[k: len(arr)]))


if __name__ == '__main__':
    main()

    

Fixed submission:
import math
import sys
from collections import Counter
readline = sys.stdin.readline


def main():
    n, k = map(int, readline().rstrip().split())
    a = list(map(int, readline().rstrip().split()))
    c = Counter(a)
    print(sum(sorted(c.values(), reverse=True)[k: len(c)]))


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
r, g = map(int, input().split())
print((r + g) / 2)


Fixed submission:
r, g = [int(input()) for _ in range(2)]
print(2*g - r)
Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline
n = int(input())
a = [int(input()) for _ in range(n)]
a.sort()
aSum = 0
cnt = 0
for i in range(n):
    aCnt = a.count(a[cnt])
    if aCnt % 2 == 1:
        aSum += 1
    cnt += aCnt
    if cnt >= n:
        break


print(aSum)


Fixed submission:
import sys
import collections
import bisect


def main():
    n = int(input())
    A = [int(input()) for _ in range(n)]
    c = collections.Counter(A)
    sumA = 0
    cKeys = c.keys()
    for cKey in cKeys:
        sumA += c[cKey] % 2
    print(sumA)


if __name__ == '__main__':
    main()

Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline

n = int(input())
a = []
for i in range(n):
    string = int(input())
    if a.count(string) == 0:
        a.append(string)
    else:
        a.remove(string)
print(len(a))


Fixed submission:
import sys
import collections
import bisect


def main():
    n = int(input())
    A = [int(input()) for _ in range(n)]
    c = collections.Counter(A)
    sumA = 0
    cKeys = c.keys()
    for cKey in cKeys:
        sumA += c[cKey] % 2
    print(sumA)


if __name__ == '__main__':
    main()

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = []
for i in range(n):
    string = int(input())
    if a.count(string) == 0:
        a.append(string)
    else:
        a.remove(string)
print(len(a))


Fixed submission:
import sys
import collections
import bisect


def main():
    n = int(input())
    A = [int(input()) for _ in range(n)]
    c = collections.Counter(A)
    sumA = 0
    cKeys = c.keys()
    for cKey in cKeys:
        sumA += c[cKey] % 2
    print(sumA)


if __name__ == '__main__':
    main()

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = []
for i in range(n):
    string = input()
    if a.count(string) == 0:
        a.append(string)
    else:
        a.remove(string)
print(len(a))


Fixed submission:
import sys
import collections
import bisect


def main():
    n = int(input())
    A = [int(input()) for _ in range(n)]
    c = collections.Counter(A)
    sumA = 0
    cKeys = c.keys()
    for cKey in cKeys:
        sumA += c[cKey] % 2
    print(sumA)


if __name__ == '__main__':
    main()

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [int(input()) for i in range(n)]
b = list(set(a))
aSum = 0
for i in b:
    if a.count(i) % 2 == 1:
        aSum += 1
print(aSum)


Fixed submission:
import sys
import collections
import bisect


def main():
    n = int(input())
    A = [int(input()) for _ in range(n)]
    c = collections.Counter(A)
    sumA = 0
    cKeys = c.keys()
    for cKey in cKeys:
        sumA += c[cKey] % 2
    print(sumA)


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = sorted(list(map(int, input().split())), reverse=True)
swi = 0
s = [0, 0]
i = 0
while i < len(a):
    if a[i] == a[i + 1]:
        s[swi] = a[i]
        i += 1
        swi += 1
        if swi == 2:
            break
    i += 1

print(s[0] * s[1])


Fixed submission:
n = int(input())
a = sorted(list(map(int, input().split())), reverse=True)
swi = 0
s = [0, 0]
i = 0
while i < len(a) - 1:
    if a[i] == a[i + 1]:
        s[swi] = a[i]
        i += 1
        swi += 1
        if swi == 2:
            break
    i += 1

print(s[0] * s[1])
Buggy python submission (verdict: Runtime Error):
s = input()
print("Yes" if s[::-1]=s else "No")

Fixed submission:
s = input()
print("Yes" if s[::-1]==s else "No")
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = 1

for b in range(n):
    b = int(input())
    a = a*b//gcd(a, b)

print(a)


Fixed submission:
import fractions

n = int(input())
a = 1

for b in range(n):
    b = int(input())
    a = a*b//fractions.gcd(a, b)
print(a)

Buggy python submission (verdict: Runtime Error):
import math

n = int(input())
a = 1

for b in range(n):
    b = int(input())
    a = a*b//math.gcd(a, b)

print(a)


Fixed submission:
import fractions

n = int(input())
a = 1

for b in range(n):
    b = int(input())
    a = a*b//fractions.gcd(a, b)
print(a)

Buggy python submission (verdict: Runtime Error):
import math
from functools import reduce


def gcd(*numbers):
    return reduce(math.gcd, numbers)


def gcd_list(numbers):
    return reduce(math.gcd, numbers)


def lcm_base(x, y):
    return (x * y) // math.gcd(x, y)


def lcm(*numbers):
    return reduce(lcm_base, numbers, 1)


def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)


n = int(input())
t = list(set([int(input()) for _ in range(n)]))

print(lcm(*t))


Fixed submission:
import fractions

n = int(input())
a = 1

for b in range(n):
    b = int(input())
    a = a*b//fractions.gcd(a, b)
print(a)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
print("Possible" if(a % 3 == 0 and b % 3 == 0 (a+b) % 3 == 0) else "Impossible")


Fixed submission:
a, b = map(int, input().split())
sign = a % 3 == 0 or b % 3 == 0 or (a+b) % 3 == 0
print("Possible" if sign else "Impossible")
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
b = a[0::2][::-1]
c = a[1::2]

b.extend(c)
print(*b[::-1] if n % 2 == 0 else *b)


Fixed submission:
n = int(input())
a = list(map(int, input().split()))
b = a[0::2][::-1]
c = a[1::2]

b.extend(c)
if n % 2 == 0:
    b = b[::-1]
print(*b)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
print("GREATER" if a > b else "LESS" if a < b else "EQUAL")


Fixed submission:
a, b = [int(input()) for _ in range(2)]
print("GREATER" if a > b else "LESS" if a < b else "EQUAL")
Buggy python submission (verdict: Runtime Error):
def start(l):
    for i in range(1, l-1):
        if S_list[i] == "A":
            return i + 1


def finish(l):
    for i in range(1, l-1):
        if S_list[l - i] == "Z":
            return l - i + 1


S_list = list(input())
l = len(S_list)
print(finish(l) - start(l) + 1)

Fixed submission:
x = int(input())
if x < 1200:
    print('ABC')
else:
    print('ARC')
Buggy python submission (verdict: Runtime Error):
def start(l):
    for i in range(1, l-1):
        if S_list[i] == "A":
            return i + 1


def finish(l):
    for i in range(1, l-1):
        if S_list[l - i] == "Z":
            return l - i + 1


S_list = list(input())
l = len(S_list)
print(finish(l) - start(l) + 1)

Fixed submission:
S_list = list(input())
l = len(S_list)
for i in range(l):
    if S_list[i] == "A":
        start = i
        break
for i in range(l):
    if S_list[i] == "Z":
        finish = i


print(finish - start + 1)

Buggy python submission (verdict: Runtime Error):
def start(l):
    for i in range(1, l):
        if S_list[i] == "A":
            return i


def finish(l):
    for i in range(1, l):
        if S_list[l - i] == "Z":
            return l - i


S_list = list(input())
l = len(S_list)
start(l)
finish(l)
print(finish(l) - start(l) + 1)

Fixed submission:
S_list = list(input())
l = len(S_list)
for i in range(l):
    if S_list[i] == "A":
        start = i
        break
for i in range(l):
    if S_list[i] == "Z":
        finish = i


print(finish - start + 1)
Buggy python submission (verdict: Time Limit Exceeded):
K,S = map(int,input().split())
cnt= 0

for x in range(0,K+1):
    for y in range(0,K+1):
        for z in range(0,K+1):
            if ((x + y + z )== S):
                cnt += 1
                if((x + y + z )>S):
                    break

print(cnt)

Fixed submission:
K,S = map(int,input().split())
cnt= 0

for x in range(0,K+1):
    for y in range(0,K+1):
        if(0 <= S - x - y and S - x - y <= K):
            cnt += 1

print(cnt)

Buggy python submission (verdict: Time Limit Exceeded):
K,S = map(int,input().split())
cnt= 0

for x in range(0,K+1):
    for y in range(0,K+1):
        for z in range(0,K+1):
            if ((x + y + z )== S):
                cnt += 1

print(cnt)

Fixed submission:
K,S = map(int,input().split())
cnt= 0

for x in range(0,K+1):
    for y in range(0,K+1):
        if(0 <= S - x - y and S - x - y <= K):
            cnt += 1

print(cnt)

Buggy python submission (verdict: Runtime Error):
K=int(input())
S=int(input())
cnt= 0

for x in range(0,K+1):
    for y in range(0,K+1):
        for z in range(0,K+1):
            if ((x + y + z )== S):
                cnt += 1

print(cnt)

Fixed submission:
K,S = map(int,input().split())
cnt= 0

for x in range(0,K+1):
    for y in range(0,K+1):
        if(0 <= S - x - y and S - x - y <= K):
            cnt += 1

print(cnt)
Buggy python submission (verdict: Runtime Error):
A, op, B = map(int, input().split())

if op == "+":
    print(A + B)

if op == "-":
    print(A - B)


Fixed submission:
A, op, B = map(str, input().split())

if op == "+":
    print(int(A) + int(B))

if op == "-":
    print(int(A) - int(B))
Buggy python submission (verdict: Runtime Error):
import collections


def main():
    s = list(input())
    if s.count("C") == 0 or s.count("F") == 0:
        print("No")
        return

    if s.index("C") == len(s) - 1:
        print("No")
        return

    print("Yes" if s.index("C") < s.index("F", s.index("C")) else "No")


if __name__ == '__main__':
    main()


Fixed submission:
import collections


def main():
    s = list(input())
    if s.count("C") == 0 or s.count("F") == 0:
        print("No")
        return

    clen, flen = 0, 0
    for i in range(len(s)):
        if clen == 0:
            if s[i] == "C":
                clen = i
        if s[i] == "F":
            flen = i
    print("Yes" if flen > clen else "No")


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
width, height, x, y = map(float,　input().split())

center_x = width/2
center_y = height/2

label = 0
if x === center_x && y === center_y:
    s = width * height/2
    label = 1

print(s, label)


Fixed submission:
width, height, x, y = map(float,input().split())

center_x = width/2
center_y = height/2

s = width * height/2
label = 0
if x == center_x and y == center_y:
    label = 1

print(s, label)
Buggy python submission (verdict: Runtime Error):
n, a, b, c, d = map(int,input().split())
s = input()

if c<d:
    s = list(s)
    h = s[b:d]
    for i in range(1,len(h)):
        if "##" in h:
            print("No")
            break
    else:
        hh = s[a:c]
        for i in range(1,len(hh)):
            if "##" in hh:
                print("No")
                break
        else:
            print("Yes")
else:
    if "..." in s[a:d]:
        h = s[a:c]
        for i in range(1,len(h)):
            if h[i]==h[i-1] and h[i]=="#":
                print("No")
                break
        else:
            hh = s[b:d]
            for i in range(1,len(hh)):
                if hh[i]==hh[i-1] and hh[i]=="#":
                    print("No")
                    break
            else:
                print("Yes")
    else:
        s = list(s)
        h = s[b:d]
        for i in range(1,len(h)):
            if h[i]==h[i-1] and h[i]=="#":
                print("No")
                break
        else:
            print("No")





Fixed submission:
a, p = map(int,input().split())
print((3*a+p)//2)
Buggy python submission (verdict: Runtime Error):
n, k = map(int,input().split())

import math
import decimal

x = decimal.Decimal(0)

for i in range(n):
    e = math.floor(math.log2(k//(i+1)))+1
    print(e)
    x += decimal.Decimal(1/(n*(2**e)))
print(x)

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

import math
x=0

for i in range(n):
    if i+1<k:
        e = math.ceil(math.log2(k/(i+1)))
        
        x += 1/(n*(2**e))
    else:
        x+= 1/n
print(x)
Buggy python submission (verdict: Runtime Error):
n k = map(int,input().split())
print(n-k+1)

Fixed submission:
n, k = map(int,input().split())
print(n-k+1)
Buggy python submission (verdict: Runtime Error):
a, b, t = map(int()input())
print((t//a)*b)

Fixed submission:
a,b,t = map(int,input().split())
print((t//a)*b)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int,input().split()))

import math

s = []
m = a[0]

for i in range(math.floor(math.sqrt(m))+3):
	if m%(i+1)==0:
		if (i+1) not in s:
			s.append(i+1)
		if m//(i+1) not in s:
			s.append(n//(i+1))
s.reverse()

for i in s:
    for j in range(len(a)):
        if a[j]%i>0:
            break
    else:
        print(i)
        break
    

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

import math

s = []
m = a[0]

for i in range(math.floor(math.sqrt(m))+3):
	if m%(i+1)==0:
		if (i+1) not in s:
			s.append(i+1)
		if m//(i+1) not in s:
			s.append(m//(i+1))
s.sort()
s = reversed(s)

for i in s:
    for j in range(len(a)):
        if a[j]%i>0:
            break
    else:
        print(i)
        break
Buggy python submission (verdict: Runtime Error):
n,m = map(int,input().split())

x=0

for i in range(m//n):
	if m%(i+1)==0 and m//(i+1)>n-1:
		x=max(x,i+1)
print(x)




Fixed submission:
n = int(input())

if n ==1:
	print("Hello World")
else:
	a = int(input())
	b = int(input())
	print(a+b)
Buggy python submission (verdict: Runtime Error):
n = int(input())
v = list(map(int,input().split()))
a = [v[i] for i in range(n) if i%2==0]
b = [v[i] for i in range(n) if i%2==1]

x = 0
y = 0
p=0
q=0

for i in range(10**5):
    if x<a.count(i):
        p=i
        x=a.count(i)
    if y<b.count(i):
        q=i
        y=b.count(i)

print(n-x-y)

Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

input = raw_input()

result = " "
for i in range(0, 3):
    if input[i] == "1":
        result += "9"
    elif input[i] == "9":
        result += "1"
    else:
        result += input[i]

print int(result)

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

m = 1110 - n

print m

Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

input = raw_input()

result = " "
for i in range(0, 3):
    if input[i] == "1":
        result += "9"
    elif input[i] == "9":
        result += "1"
    else:
        result += input[i]

print int(result)

Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python
# -*- coding: utf-8 -*-

input = raw_input()

result = ""
for i in range(0, 3):
    if input[i] == "1":
        result += "9"
    else input[i] == "9":
        result += "1"
    else:
        result += input[i]

print int(result)


Fixed submission:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

input = raw_input()

result = " "
for i in range(0, 3):
    if input[i] == "1":
        result += "9"
    elif input[i] == "9":
        result += "1"
    else:
        result += input[i]

print int(result)
Buggy python submission (verdict: Runtime Error):
import collections

n = int(input())
v = list(map(int,input().split()))
a = [v[i] for i in range(n) if i%2==0]
b = [v[i] for i in range(n) if i%2==1]

a = collections.Counter(a)
b = collections.Counter(b)

A = a.most_common()[:2]
B = b.most_common()[:2]
if A[0][0]==B[0][0]:
    print(n-max(A[0][1]+B[1][1],A[1][1]+B[0][1]))
else:
    print(n-A[0][1]-B[0][1])

Fixed submission:
import collections

n = int(input())
v = list(map(int,input().split()))
a = [v[i] for i in range(n) if i%2==0]
b = [v[i] for i in range(n) if i%2==1]

a = collections.Counter(a)
b = collections.Counter(b)

A = a.most_common()[:2]
A.append(("x",0))
B = b.most_common()[:2]
B.append(("x",0))
if A[0][0]==B[0][0]:
    print(n-max(A[0][1]+B[1][1],A[1][1]+B[0][1]))
else:
    print(n-A[0][1]-B[0][1])

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

v = list(map(int,input().split()))

s = []
t = []


import collections

for i in range(0,n//2,2):
	s.append(v[i])
for i in range(1,n//2,2):
	t.append(v[i])

S = Counter(s)
	
T = Counter(t)

x = S.most_common()[0][0]  #sの最頻値

y = S.most_common()[1][0]  #sの2番目に多いやつ

z = T.most_common()[0][0]　

w = T.most_common()[1][0]

if x!=z:
	print(n-S.most_common()[0][1]-T.most_common()[0][1])
elif y>w:
	print(n-S.most_common()[0][1]-S.most_common()[1][1])
else:
	print(n-S.most_common()[0][1]-T.most_common()[1][1])


Fixed submission:
import collections

n = int(input())
v = list(map(int,input().split()))
a = [v[i] for i in range(n) if i%2==0]
b = [v[i] for i in range(n) if i%2==1]

a = collections.Counter(a)
b = collections.Counter(b)

A = a.most_common()[:2]
A.append(("x",0))
B = b.most_common()[:2]
B.append(("x",0))
if A[0][0]==B[0][0]:
    print(n-max(A[0][1]+B[1][1],A[1][1]+B[0][1]))
else:
    print(n-A[0][1]-B[0][1])

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

v = list(map(int,input().split()))

s = []
t = []


import collections

for i in range(0,n,2):
	s.append(v[i])
for i in range(1,n,2):
	t.append(v[i])

S = Counter(s)
	
T = Counter(t)

x = S.most_common()[0][0]  #sの最頻値

y = S.most_common()[1][0]  #sの2番目に多いやつ

z = T.most_common()[0][0]　

w = T.most_common()[1][0]

if x!=z:
	print(n-S.most_common()[0][1]-T.most_common()[0][1])
elif y>w:
	print(n-S.most_common()[0][1]-S.most_common()[1][1])
else:
	print(n-S.most_common()[0][1]-T.most_common()[1][1])


Fixed submission:
import collections

n = int(input())
v = list(map(int,input().split()))
a = [v[i] for i in range(n) if i%2==0]
b = [v[i] for i in range(n) if i%2==1]

a = collections.Counter(a)
b = collections.Counter(b)

A = a.most_common()[:2]
A.append(("x",0))
B = b.most_common()[:2]
B.append(("x",0))
if A[0][0]==B[0][0]:
    print(n-max(A[0][1]+B[1][1],A[1][1]+B[0][1]))
else:
    print(n-A[0][1]-B[0][1])
Buggy python submission (verdict: Runtime Error):
k = int(input())

if k % 2 == 0:
     print((k//2)**2)
else:
     print((k//2)*((k//2)+1)

Fixed submission:
k = int(input())

if k % 2 == 0:
    print((k//2)**2)
else:
    print((k//2)*((k//2)+1))

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


if k % 2 == 0:
     print((k//2)**2)
else:
     print((k//2)*((k//2)+1)


Fixed submission:
k = int(input())

if k % 2 == 0:
    print((k//2)**2)
else:
    print((k//2)*((k//2)+1))

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


if K % 2 == 0:
     print((K//2)**2)
else:
     print((K//2)*((K//2)+1)


Fixed submission:
k = int(input())

if k % 2 == 0:
    print((k//2)**2)
else:
    print((k//2)*((k//2)+1))

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


if K % 2 == 0:
	print((K//2)**2)
else:
	print((K//2)*((K//2)+1)

Fixed submission:
k = int(input())

if k % 2 == 0:
    print((k//2)**2)
else:
    print((k//2)*((k//2)+1))

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

if K%2 == 0:
	print ((K//2)**2)
else:
	print ((K//2)*((K//2)+1)


Fixed submission:
k = int(input())

if k % 2 == 0:
    print((k//2)**2)
else:
    print((k//2)*((k//2)+1))

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

if K%2 == 0:
	print ((K//2)**2)
else:
	print (((K//2)*((K//2)+1))


Fixed submission:
k = int(input())

if k % 2 == 0:
    print((k//2)**2)
else:
    print((k//2)*((k//2)+1))

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


if K%2 == 0:
	print ((K//2)**2)
else:
	print ((K//2)*((K//2)+1)


Fixed submission:
k = int(input())

if k % 2 == 0:
    print((k//2)**2)
else:
    print((k//2)*((k//2)+1))

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


if K%2 == 0:
	print(K//2)*(K//2)
else:
	print(K*K-1)//4


Fixed submission:
k = int(input())

if k % 2 == 0:
    print((k//2)**2)
else:
    print((k//2)*((k//2)+1))

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


if K%2 == 0:
	print(K/2)*(K/2)
else:
	print(K*K-1)/4


Fixed submission:
k = int(input())

if k % 2 == 0:
    print((k//2)**2)
else:
    print((k//2)*((k//2)+1))

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


if K%2 = 0:
	print(K/2)*(K/2)
else:
	print(K*K-1)/4


Fixed submission:
k = int(input())

if k % 2 == 0:
    print((k//2)**2)
else:
    print((k//2)*((k//2)+1))

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

ans=0

if K%2 = 0:
	ans=(K/2)*(K/2)
else:
	ans=(K*K-1)/4

print(ans)

Fixed submission:
k = int(input())

if k % 2 == 0:
    print((k//2)**2)
else:
    print((k//2)*((k//2)+1))
Buggy python submission (verdict: Runtime Error):
n, i = map(int,input().split())
print (N+i-1)

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

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

print u N-i+1

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

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

print u N-i+1

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

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

print u N-i+1

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

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

print N-i+1

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

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

print(N-i+1)

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