Problem:


Score : 100 points

Problem Statement

Find the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive). The order does not matter.

Constraints

2\leq K\leq 100

K is an integer.

Input

Input is given from Standard Input in the following format:

K

Output

Print the number of ways to choose a pair of an even number and an odd number from the positive integers between 1 and K (inclusive).

Sample Input 1

3

Sample Output 1

2

Two pairs can be chosen: (2,1) and (2,3).

Sample Input 2

6

Sample Output 2

9

Sample Input 3

11

Sample Output 3

30

Sample Input 4

50

Sample Output 4

625



Sample input:
3


Sample output:
2

Submission status: Accepted

Solution code:
n=input()
O=0
E=0
for i in range (0,int(n)):
    if i%2==0 :
        E+=1
    else:
        O+=1
print (O*E)

Submission status: Accepted

Solution code:
k = input()
k = int(k)
even = 0
odd = 0
if k >= 2 and k <= 100 :
    for i in range(1, k+1) :
        if i % 2 == 0 :
            even += 1
        else :
            odd += 1

print (even*odd)

Submission status: Accepted

Solution code:
k= int(input())
if k% 2 == 0:
    print(int((k/2)**2))

elif k%2 ==1:

    print((k//2)* (k-k//2))

Submission status: Accepted

Solution code:
a=int(input())
print(int(a*a/2/2))

Submission status: Accepted

Solution code:
k = int(input())

odd = k//2 + bool(k%2)
even = k//2

print(odd*even)

Submission status: Accepted

Solution code:
K = int(input())

even = 0
odd = 0

for i in range(1, K + 1):
    if i % 2 == 0:
        even += 1
    else:
        odd += 1

print(even * odd)

Submission status: Accepted

Solution code:
k=int(input())
count=0
if k>= 2:
    for i in range(2,k+1):
        for j in range(1,k+1):
             if i%2==0 and j%2!=0:
                count+=1
    print(count)

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

Solution code:
k = int(input())
n = k // 2
m = k - n
print(int(n*m))

Submission status: Accepted

Solution code:
import math
K = int(input())


if K % 2 == 0:
    print(int(pow(K/2,2)))
else:
    print(int(((K-1)/2) * ((K+1)/2)))

Submission status: Accepted

Solution code:
k=int(input())
Even=0
Odd=0
for i in range (k) :
    if i%2==0:
        Even+=1
    else :
        Odd+=1

print(Even*Odd)

Submission status: Accepted

Solution code:
k = int(input())
if 2<=k<=100:
 n = k // 2
 m = k - n
print(int(n*m))

Submission status: Accepted

Solution code:
# Pair
k = int(input())
print((k // 2) * (k // 2 + k % 2))

Submission status: Accepted

Solution code:
K = int(raw_input())
print K / 2 * (K / 2 + K % 2)

Submission status: Accepted

Solution code:
k = int(input())
ressult = (k//2) * (k//2 + k%2)
print(ressult)

Submission status: Accepted

Solution code:
k=int(input())
if k%2==0:
    ki=int(k/2)
    gu=int(k/2)
else:
    ki=int(k/2)+1
    gu=int(k/2)
print(ki*gu)

Submission status: Accepted

Solution code:
k=int(input())
count=0
for i in range (2,k+1,1):
    for j in range (k+1):
        if i%2==0 and j%2==1:
            count+=1

print(count)

Submission status: Accepted

Solution code:
import math

n = int( input())

print( math.ceil(n/2) * math.floor(n/2))

Submission status: Accepted

Solution code:
k = int(input())
x = [i for i in range(1, k+1) if i & 1 == 0]
y = [i for i in range(1, k+1) if i & 1 == 1]
print(len(x)*len(y))

Submission status: Accepted

Solution code:
# coding: utf-8

if __name__ == "__main__":
    K = int(input())
    if K % 2 == 0:
        print(int(K/2)**2)
    else:
        print(int(K/2)*int(K/2+1))

Submission status: Accepted

Solution code:
k =int(input())
ans = 0
for i in range(k+1):
	t = i // 2
	ans += t
print(ans)

Submission status: Accepted

Solution code:
k = int(input())
if k % 2 == 0:
    print((k // 2)**2)
else:
    print((k - (k // 2)) * (k // 2))

Submission status: Accepted

Solution code:
n=int(input())
e=int(n/2)
if n%2:
	o=int(n/2+1)
else:
	o=int(n/2)
	
print (o*e)

Submission status: Accepted

Solution code:
k = int(input())

odd = []
even = []
for i in range(1, k + 1):
    if i % 2 == 0:
        even.append(i)
    else:
        odd.append(i)

ans = len(even) * len(odd)
print(ans)

Submission status: Accepted

Solution code:
x = int(input())
a = x//2
b = x - a
print(a*b)

Submission status: Accepted

Solution code:
K=int(input())

odd=0
even=0

for i in range(K):
	if i%2==0:
		even+=1
	else:
		odd+=1

print(even*odd)

Submission status: Accepted

Solution code:
K = int(input())

odd = 0
even = 0

for i in range(K):
    if i % 2 == 0:
        even += 1
    else:
        odd += 1

print(even * odd)

Submission status: Accepted

Solution code:
def solve(k):
    p = k / 2
    return (k - p) * p

assert solve(3) == 2
assert solve(6) == 9
assert solve(11) == 30
assert solve(50) == 625
print solve(input())

Submission status: Accepted

Solution code:
import math
x=int(input())

print(math.ceil(x/2)*(x//2))

Submission status: Accepted

Solution code:
K = int(input())

list = [x for x in range(1,K+1)]

list_odd = list[1::2]
list_even = list[0::2]

cnt = 0

for i in list_odd:
    for j in list_even:
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
k = int(input())

a = k//2
b = (k+1)//2

print(a*b)

Submission status: Accepted

Solution code:
#coding: utf-8
K = int(input())
print((K//2)*(K//2+1) if K%2!=0 else (K//2)**2)

Submission status: Accepted

Solution code:
n=int(input())
m=n//2
print((n-m)*m)

Submission status: Accepted

Solution code:
from itertools import combinations

K = int(input())
num = list(combinations(list(range(1, K+1)), 2))
ans = list(filter(lambda x: sum(x)%2 != 0, num))
print(len(ans))

Submission status: Accepted

Solution code:
num = int(input())
even = 0
odd = 0
for n in range(num):
    if n % 2 == 0:
        even += 1
    else:
        odd += 1

print(even*odd)

Submission status: Accepted

Solution code:
n = int(input())

even = n // 2
odd = n - even

answer = odd * even
print(answer)

Submission status: Accepted

Solution code:
n = int(input())
l = range(1, n + 1)
gu = l[1::2]
ki = l[::2]
print(len(gu) * len(ki))

Submission status: Accepted

Solution code:
K=int(input());print(K//2*int(K/2+0.5))

Submission status: Accepted

Solution code:
K = int(input())

even = []
odd  = []
for i in range(K):
    if i % 2 == 0:
        even.append(i)
    else:
        odd.append(i)
        
print(len(even) * len(odd))

Submission status: Accepted

Solution code:
K = int(input())

a = K // 2
b = K - a

print(a * b)

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

Solution code:
k = int(input())
if k%2 == 0:
    print((k//2)*(k//2))
else:
    print((k//2)*(k//2+1))

Submission status: Accepted

Solution code:
# coding:utf-8

n = int(input())

a = n//2

print(a*(n-a))

Submission status: Accepted

Solution code:
k = int(input())
ans = (k//2)**2 if k%2 == 0 else k//2 * (k//2+1)
print(ans)

Submission status: Accepted

Solution code:
k = int(input())
if k % 2 == 0:
    print((k//2)**2)
else:
    print((k//2) * (k//2+1))

Submission status: Accepted

Solution code:
n=int(input())

print((n//2)*((n+1)//2))

Submission status: Accepted

Solution code:
n=int(input())
a=0
if(n%2==0):
    print(n//2*n//2)
else:
    print((n+1)//2*(n-1)//2)

Submission status: Accepted

Solution code:
import math
n = int(input())
print(int(math.floor(n/2) * math.ceil(n/2)))

Submission status: Accepted

Solution code:
K = int(input())
even = 0
odd = 0

for i in range(1,K+1):
	if i%2 == 0:
		even += 1
	else:
		odd += 1

print(even*odd)

Submission status: Accepted

Solution code:
k = int(input())
print(( k // 2 ) * ( k - k // 2 ))

Submission status: Accepted

Solution code:
k = int(input())

ans = 0

if k % 2 == 0:
    ans = (k // 2) * (k // 2)

else:
    ans = (k // 2) * (k // 2 + 1)

print(ans)

Submission status: Accepted

Solution code:
K = int(input())
count = 0

for i in range(2, K+1, 2):
    for j in range(1, K+1, 2):
        count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

Solution code:
k = int(input())
even = k//2
odd = k - even
print(even*odd)

Submission status: Accepted

Solution code:
k = int(input())
print(int(k/2)*int((k+1)/2))

Submission status: Accepted

Solution code:
n =int(input())
print(len([i for i in range(1,n+1) if i % 2 == 1])*len([i for i in range(1,n+1) if i % 2 == 0]))

Submission status: Accepted

Solution code:
def answer(in0):
    n = int(in0)
    base = int(n / 2)
    odd = base + ((n%2) != 0)
    even = base

    return odd * even

print(answer(input()))

Submission status: Accepted

Solution code:
k = int(input())
n = k // 2
m = (k+1) // 2
print(n*m)

Submission status: Accepted

Solution code:
K = int(input())
ans = 0


if K % 2 == 0:
    ans = (K / 2)**2
elif K % 2 == 1:
    ans = (int((K / 2))) * (int((K / 2)) + 1)

print(int(ans))

Submission status: Accepted

Solution code:
n = int(input())
print(int((n/2))*int((n+1)/2))

Submission status: Accepted

Solution code:
k = int(input())
if k%2 == 0:
  print(int((k/2)**2))
else:
  print((k//2)*(k//2+1))

Submission status: Accepted

Solution code:
x = int(input())
y = x // 2
print(y*(x-y))

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

Solution code:
def solve(string):
    k = int(string)
    return str((k // 2) * ((k + 1) // 2))


if __name__ == '__main__':
    print(solve(input()))

Submission status: Accepted

Solution code:
K = int(input())
if K % 2 == 0:
    a = (K / 2) ** 2
    print(int(a))
else:
    b = (K / 2 + 0.5) * (K / 2 - 0.5)
    print(int(b))

Submission status: Accepted

Solution code:
k = int(input())
if k%2 == 0:
    a = (k/2)**2
    print(int(a))
else:
    a = ((k-1)/2)*((k-1)/2 + 1)
    print(int(a))

Submission status: Accepted

Solution code:
K = int(input())
if K % 2 == 0:
    res = (K/2)**2
else:
    res = ((K-1)/2)*((K-1)/2 + 1)
print(int(res))

Submission status: Accepted

Solution code:
print((lambda a:(a//2)*((a+1)//2))(int(input())))

Submission status: Accepted

Solution code:
k = int(input())
cnt = 0

for i in range(1,k+1):
	for j in range(1,k+1):
		if i%2==0 and j%2!=0:
			cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
K=int(input())
c_gu=0
c_ki=0
if (K%2==0):
    c_gu=int(K/2)
    c_ki=int(K/2)
else:
    c_gu=int(K/2)+1
    c_ki=int(K/2)
print(c_gu*c_ki)

Submission status: Accepted

Solution code:
n = int(input())

if n %2 == 1:
    print(int((n**2-1)/4))
else:
    print(int((n**2)/4))

Submission status: Accepted

Solution code:
try:

    # パラメータの取得
    k = int(input()) # int型1個

    # 偶数の数?奇数の数
    e = int(k / 2)
    o = e if k % 2 == 0 else e + 1

    # print(e, o)
    print(e * o)

except EOFError:
    pass

Submission status: Accepted

Solution code:
k = int(input())
even = k // 2
odd = even

if k % 2 == 1:
    odd = even + 1

print(odd * even)

Submission status: Accepted

Solution code:
import sys

# 関数 solve は，もちろん，問題に応じて書き換える
def solve(K) : #108-A
    x = K//2
    if K%2==0 :
        return x**2
    else :
        y = x+1
        return x*y
# ここから下は，入力・出力形式が同じであれば，変えなくて良い．
def readQuestion():
    line = sys.stdin.readline().rstrip()
    return int(line)

def main():
    n = readQuestion()
    answer = solve(n)
    print(answer)
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

Solution code:
K=int(input())
#ex k=9 1,3,5,7,9-2,4,6,8
even=0
odd=0
for i in range(1,K+1):
    if(i%2==0):
        even+=1
    else:
        odd+=1
print(even*odd)

Submission status: Accepted

Solution code:
K = int(input())
even = K//2
odd = K-even
print(odd*even)

Submission status: Accepted

Solution code:
N=int(input())

if N%2==0:
    a=(N//2)**2

else:
    a=(N//2)*(N//2+1)


print(a)

Submission status: Accepted

Solution code:
K = int(input())
a = int(K/2)
b = int((K+1)/2)

print (a*b)

Submission status: Accepted

Solution code:
from math import floor
n = int(input())
ans = 0
if n%2==0:
    ans = (n/2)**2
else:
    ans = (n-1)*(n+1)/4
print(floor(ans))

Submission status: Accepted

Solution code:
k=int(input())
odd_cnt=0
even_cnt=0
for i in range(1,k+1):
    if i%2==0:
        even_cnt+=1
    else:
        odd_cnt+=1
print(even_cnt*odd_cnt)

Submission status: Accepted

Solution code:
k=int(input())
a=k//2
print(a*a) if k%2==0 else print(a*(a+1))

Submission status: Accepted

Solution code:
n = int(input())
a = 0
if n%2 == 0:
  a = (n/2)**2
else:
  a = (n**2-1)/4
print(int(a))

Submission status: Accepted

Solution code:
K = int(input())
if K%2 == 0:
    odd_number = K // 2
elif K%2 == 1:    
    odd_number = K // 2 + 1
even_number = K // 2 

print(odd_number*even_number)

Submission status: Accepted

Solution code:
n = int(input())
even = n // 2
if n % 2 == 0:
    odd = n // 2
else:
    odd = n // 2 + 1
print(even * odd)

Submission status: Accepted

Solution code:
n = int(raw_input())
e = n / 2
print e * (n-e)

Submission status: Accepted

Solution code:
K = int(input())
ans = (K//2) * ((K+1)//2)
print(ans)

Submission status: Accepted

Solution code:
k = int(input())
x = k // 2
print(x * (k-x))

Submission status: Accepted

Solution code:
# coding: utf-8


def main():
    k = int(input())
    print((k // 2) * (k - k // 2))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
K=int(input())
a=int(K/2)
b=int((K+1)/2)
print(int(a*b))

Submission status: Accepted

Solution code:
K = int(input())
p = K//2
print(p*(K-p))

Submission status: Accepted

Solution code:
n = int(input())
a = n // 2
b = n // 2 + n % 2
print(a*b)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

a = int(input())

odd = a /2
even = a / 2

print( int(odd * even))

Submission status: Accepted

Solution code:
K = int(input())
list = [i for i in range(1, K + 1)]
odd = list[1::2]
even = list[0::2]

cnt = 0

for i in odd:
    for j in even:
        cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
from math import floor, ceil
K = int(input())
ans = floor(K / 2) * ceil(K / 2)
print(ans)

Submission status: Accepted

Solution code:
def solve(K):
    ans = ((K + 1) // 2) * (K // 2)
    print(ans)

K = int(input())
solve(K)

Submission status: Accepted

Solution code:
"""
A - Pair
1 以上 K 以下の正の整数から、偶数と奇数ひとつずつの組を選ぶ方法の個数を求めてください。なお、選ぶ順番は考慮しません。

K=６のとき、
選ぶ組の距離は、１，３，５となる
これを列挙すればよいはず
"""

K = int(input())

cnt = 0
for start in range(1, K):
    for dist in range(1, K, 2):
        if (start + dist) <= K:
            cnt += 1
        else:
            break

print(cnt)

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
K = int(input())
if K % 2 == 0:
    ans = K * K / 4
else:
    ans = (( K - 1) / 2) **2 + (K-1)/2

print(int(ans))

Submission status: Accepted

Solution code:
K = int(input())

print(K//2 * ((K+1)//2))

Submission status: Accepted

Solution code:
a = int(input())
b = a // 2
c = a - b
print(c*b)

Submission status: Accepted

Solution code:
n = int(input())
if n % 2 == 0:
  print(n//2 * n//2)
else:
  print(n//2 * (n//2+1))

Submission status: Accepted

Solution code:
K = input()

gusu = int(int(K) / 2)
kisu = int((int(K)+1) / 2)

print(int(kisu * gusu))

Submission status: Accepted

Solution code:
k = int(input())
if k % 2 == 0:
    n = int((k/2) * (k/2))
else:
    n = int((k-1)/2 * ((k-1)/2 + 1))
print(n)

Submission status: Accepted

Solution code:
K = int(input())
if K % 2 == 0:
    print(int((K/2)**2))
else:
    print(int((K-1)/2*((K-1)/2+1)))

Submission status: Accepted

Solution code:
K = int(input())

even = K // 2

if (K%2):
    odd = K // 2 + 1
else:
    odd = K // 2

ans = even * odd
print(ans)

Submission status: Accepted

Solution code:
K = int(input())
if K % 2 == 0:
    print(int((K/2)**2))
else:
    print(int((K//2+1)*(K//2)))

Submission status: Accepted

Solution code:
import math
N = int(input())

even = N // 2
odd = math.ceil(N/2)
print(even*odd)

Submission status: Accepted

Solution code:
k = int(input())
if k % 2 == 0:
    print( (k // 2) * (k // 2 ))
else:
    print( ((k - 1) // 2 + 1) * ((k - 1) // 2) )

Submission status: Accepted

Solution code:
A = int(input())
print(A//2*int(A/2+0.5))

Submission status: Accepted

Solution code:
import math
K = int(input())

if K % 2 == 0:
    S = (K//2) ** 2
    print(S)

else: # 奇数
    S = math.floor(K/2) * math.ceil(K/2)
    print(S)

Submission status: Accepted

Solution code:
K = int(input())
if (K%2==0):
    print((K//2)**2)
else:
    print((K//2)*(K-K//2))

Submission status: Accepted

Solution code:
import numpy as np
import math

K = int(input())

ki = math.floor(K / 2)
gu = math.ceil(K / 2)

print(ki * gu)

Submission status: Accepted

Solution code:
import math

k = int(input())

if k%2:
    print(math.floor(k/2)*math.ceil(k/2))
else:
    print(int((k/2)**2))

Submission status: Accepted

Solution code:
#!python3
import sys

def main():
    k = int(input())
    ev = k // 2

    if k % 2 == 1:
        od = ev + 1
    else:
        od = ev

    print(ev * od)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
k = int(input())

if k % 2 is 0:
  print(int((k/2)**2))
else:
 print(int(((k-1)/2)*(((k-1)/2)+1)))

Submission status: Accepted

Solution code:
a=int(input())
if a%2==0:print(int(a/2)**2)
else:print((a//2)*((a//2)+1))

Submission status: Accepted

Solution code:
k=int(input())
hk=k//2
print(hk*(k-hk))

Submission status: Accepted

Solution code:
K = int(input().strip())
num1 = K // 2
num2 = K - num1
print(num1 * num2)

Submission status: Accepted

Solution code:
def solution(k):
    return (k >> 1) * ((k + 1) >> 1)

def main():
    k = int(raw_input().strip())
    print solution(k)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    K = int(input())
    odd = (K + 1) // 2
    even = K // 2
    print(odd * even)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
k = int(input())

ans = set()
for i1 in range(1,k+1):
  for i2 in range(1,k+1):
    if i1%2 == 0 and i2%2 == 1:
      ans.add( (i1, i2) )      
print(len(ans))

Submission status: Accepted

Solution code:
x = input()

print((int(x) // 2) * ((int(x) + 1) // 2))

Submission status: Accepted

Solution code:
K = int(input())
a = K // 2
b = (K + 1) // 2
print(a * b)

Submission status: Accepted

Solution code:
n = input()
print (n + 1) / 2 * (n / 2)

Submission status: Accepted

Solution code:
x = [i for i in range(1,int(input()) + 1)]
print(len(x[0::2])*len(x[1::2]))

Submission status: Accepted

Solution code:
k=int(input())
even,odd=0,0
if 2<=k<=100:
	for i in range(1,k+1):
		if i%2==0:
			even +=1
		else:
			odd +=1
print(even*odd)

Submission status: Accepted

Solution code:
K = int(input())
even = K // 2
odd = (K + 1) // 2
print(odd * even)

Submission status: Accepted

Solution code:
K=int(input())
if K%2 == 0:
    M=K*K/4
    print(int(M))
else:
    M=(K-1)*(K+1)/4
    print(int(M))

Submission status: Accepted

Solution code:
K=int(input())
even=int(K/2)
print(even*(K-even))

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    K = int(input())
    odds = int((K+1)/2)
    even = int(K/2)
    print(odds*even)

Submission status: Accepted

Solution code:
k = int(input())
n,m = (k+1)//2 , k//2
print(n*m)

Submission status: Accepted

Solution code:
import sys
a=int(input())
b=a/2
c=b*(a-b)
print(int(c))

Submission status: Accepted

Solution code:
K = int(input())
if K & 1:
  print((K//2) * ((K+1)//2))
else:
  print((K//2) * (K//2))

Submission status: Accepted

Solution code:
K = int(input())
c1 = 0
c2 = 0
for i in range(K):
    if i % 2 == 0:
        c1 +=1
    else :
        c2 +=1
print(c1*c2)

Submission status: Accepted

Solution code:
K = int( input())
if K%2 == 0:
    print(K//2*K//2)
else:
    print(K//2*(K//2 + 1))

Submission status: Accepted

Solution code:
K=int(input())

num=K//2

print(num*(K-num))

Submission status: Accepted

Solution code:
k = int(input())

print ( "%d" % ( (k+1)//2 * (k//2) ) )

Submission status: Accepted

Solution code:
k = int(input())
if k%2 == 0:
  print(int(k*k/4))
else:
  print(int((k*k-1)/4))

Submission status: Accepted

Solution code:
K = int(input())
even = K//2
odd = K - even

print(even*odd)

Submission status: Accepted

Solution code:
n=int(input())
a=n//2
print(a*(a+n%2))

Submission status: Accepted

Solution code:
iK = int(input())
if iK % 2 == 0:
  iN = int(iK / 2)
  print(iN * iN)
else :
  iN = int((iK - 1)/2)
  print(iN * (iN + 1))

Submission status: Accepted

Solution code:
k = int(input())

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


ans = int(ans)
print(ans)

Submission status: Accepted

Solution code:
#-*- coding = utf-8 -*-
k = int(input())
print (int(k/2)*int((k+1)/2))

Submission status: Accepted

Solution code:
#encoding utf-8

k = int(input())

even = int(k/2)

odd = k-even

print(odd*even)

Submission status: Accepted

Solution code:
k=int(input())
ans=0
if k%2==0:
	ans=k*k/4
else:
  	ans=(k*k-1)/4
print(int(ans))

Submission status: Accepted

Solution code:
k = int(input())
even = k//2
odd = (k+1)//2
a = even * odd
print(a)

Submission status: Accepted

Solution code:
K = int(input())

if K%2 == 0:
  even_num = odd_num = K//2
else:
  even_num = K//2
  odd_num = even_num + 1

print(even_num * odd_num)

Submission status: Accepted

Solution code:
from math import ceil

K = int(input())
odds = int(ceil(K / 2))
evens = K // 2

print(odds * evens)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math,string,itertools,fractions,heapq,collections,re,array,bisect

def s():
    return input()
def n():
    return int(input())
def d():
    return float(input())

def ls():
    return input().split()
def ln():
    return map(int, input().split())
def ld():
    return map(float, input().split())

def fs():
    return [input() for i in range(input())]
def fn():
    return [int(input()) for i in range(input())]
def fd():
    return [float(input()) for i in range(input())]

K = n()

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

Submission status: Accepted

Solution code:
K = int(input())
if K%2 == 0:
    print(int((K/2)*(K/2)))
else:
    print(int(((K-1)/2)*((K+1)/2)))

Submission status: Accepted

Solution code:
K = int(input())
out = (K // 2) * (K // 2 + K % 2)

print(int(out))

Submission status: Accepted

Solution code:
K = int(input())
a = 0
b = 0
for i in range(1, K + 1):
    if i % 2 == 0:
        a +=1
    else:
        b += 1
print(a * b)

Submission status: Accepted

Solution code:
K = int(input())
print(int((K/2)*(K/2)))

Submission status: Accepted

Solution code:
k=input()
k=int(k)
print(int(k/2+0.5)*(int(k/2)))

Submission status: Accepted

Solution code:
K = int(input())
if K%2 == 0: # is even
  print(int((K/2)*(K/2)))
else:
  print(int((K//2)*(K//2+1)))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

k = int(input())
print((k//2)*((k+1)//2))

Submission status: Accepted

Solution code:
A = int(input())

B = A // 2

C = A - B

print(B*C)

Submission status: Accepted

Solution code:
K = int(input())
e = K//2
o = (K+1)//2
print(e*o)

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-

import sys

def main():
    k = int(sys.stdin.readline())
    r, q = divmod(k, 2)
    print(r * (r + q))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
K = int(input())
if K % 2 == 0:
    print(int(K / 2) ** 2)
elif K % 2 == 1:
    print(int(K // 2) * (int(K // 2) + 1))
else:
    pass

Submission status: Accepted

Solution code:
k = int(input())

print(k//2 * ((k-1)//2+1))

Submission status: Accepted

Solution code:
k = int(input())
k_int = int(k/2) 
if k%2 == 1:
  print(k_int*(k_int+1))
else:
  print((k_int)**2)

Submission status: Accepted

Solution code:
K = int(input())

print((K + 1) // 2 * (K // 2))

Submission status: Accepted

Solution code:
# coding: utf-8


def main():
    k = int(input())
    res = 0

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

    print(res)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
k = int(input())

g = k//2
kk = k//2
if k % 2 != 0:
    kk+=1

print(g*kk)

Submission status: Accepted

Solution code:
K = int(input())

print(int(K/2)*(K - int(K/2)))

Submission status: Accepted

Solution code:
K = int(input())
m = K//2
print(m*(K-m))

Submission status: Accepted

Solution code:
def calcPairOddAndEven(num):
    if num % 2 == 0:
        return int((num / 2))**2
    else:
        return int(num / 2)*int(num / 2 + 1)


def main():
    numArray = [3, 6, 11, 50]
    for num in numArray:
        print(num, ":", calcPairOddAndEven(num))


def contest():
    print(calcPairOddAndEven(int(input())))

if __name__ == '__main__':
    contest()

Submission status: Accepted

Solution code:
def main():
    K = int(input())

    ans = editorial(K)
    assert ans == AC(K)
    print(ans)


def editorial(K):
    return (K // 2) * ((K + 1) // 2)


def AC(K):
    d = {}
    for i in range(1, K+1):
        for j in range(i+1, K+1):
            p = tuple(sorted((i, j)))
            if i % 2 == 1 and j % 2 == 0:
                d[p] = 1
            elif i % 2 == 0 and j % 2 == 1:
                d[p] = 1

    ans = len(d)
    return ans


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
k = int(input())

n = k //2 
print(n*(n+k%2))

Submission status: Accepted

Solution code:
n = int(input())
even = n // 2
odd = n - even
print(even * odd)

Submission status: Accepted

Solution code:
K = int(input())
print((K//2)*(K//2) if K%2==0 else ((K//2)*(1+K//2)))

Submission status: Accepted

Solution code:
K = int(input())
if K % 2 == 0:
    print((K // 2) ** 2)
else:
    print(((K - 1) // 2) * ((K - 1) // 2 + 1))

Submission status: Accepted

Solution code:
i = int(input())
if i % 2 == 0:
    print(int((i / 2) ** 2))
else:
    i = i + 1
    a = i / 2
    print(int(a * (a - 1)))

Submission status: Accepted

Solution code:
k=int(input())
print((k//2)*(k//2+k%2))

Submission status: Accepted

Solution code:
K = int(raw_input())
if K%2 ==0:
  a = (K/2)**2
else:
  a = ((K+1)/2)*((K-1)/2)
print a

Submission status: Accepted

Solution code:
n = int(input())
print(n//2*(n-n//2))

Submission status: Accepted

Solution code:
num = int(input())
even = num//2
print(even*(num-even))

Submission status: Accepted

Solution code:
# coding: utf-8


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

Submission status: Accepted

Solution code:
k = int(input())
od = k//2 + k%2
ev = k - od
print(od*ev)

Submission status: Accepted

Solution code:
N = int(input())
if N % 2 == 0:
    print((N // 2) ** 2)
else:
    print((N // 2) * (N // 2 + 1))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

K = int(input())

print(((K+1) // 2) * (K // 2))

Submission status: Accepted

Solution code:
K = int(input())
if K % 2 == 0:
    K = K // 2
    print(K * K)
else:
    K = K // 2
    print(K * (K+1))

Submission status: Accepted

Solution code:
k=int(input())
even=int(k//2)
odd=k-even
print(odd*even)

Submission status: Accepted

Solution code:
K=int(input())
print(int(K/2)*int((K+1)/2))

Submission status: Accepted

Solution code:
def run(k):
    return (k // 2)*(k // 2 + k % 2)


def read_line():
    k = int(input())
    return k


def main():
    k = read_line()
    print(run(k))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N=int(input())
E=N//2
if N%2==1:
    O=N//2+1
else:
    O=N//2
print(E*O)

Submission status: Accepted

Solution code:
N = int(input())
if N % 2 == 0:
  print((N//2)**2)
else:
  print((N//2)*(N//2+1))

Submission status: Accepted

Solution code:
#abc108a

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

Submission status: Accepted

Solution code:
import math


K = int(input())

if K % 2 == 1:
    print(math.trunc(K / 2) * (math.trunc(K /2) + 1))
else:
    print(math.trunc(K / 2) ** 2)

Submission status: Accepted

Solution code:
K = int(input())
print((K // 2+ K % 2) * (K // 2))

Submission status: Accepted

Solution code:
k = int(input())
is_odd = k % 2 == 1
even_count = int(k / 2)
odd_count = int(k / 2)
if is_odd:
	odd_count += 1
print(even_count * odd_count)

Submission status: Accepted

Solution code:
k = int(input())

print((k//2) * (k + k%2)//2)

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-

def main():
    k = int(input())
    if k % 2 == 0:
        ans = (k // 2) ** 2
    else:
        ans = (k // 2) * ((k // 2) + 1)
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())

print(N//2 * ((N+1)//2))

Submission status: Accepted

Solution code:
print input()**2>>2

Submission status: Accepted

Solution code:
print int((input()*1.0/2)**2)

Submission status: Accepted

Solution code:
n=int(input());print([(n//2)**2,n//2*(n//2+1)][n%2])

Submission status: Accepted

Solution code:
n = int(input())
if n%2: print((n//2)*(n//2+1))
else: print((n//2)**2)

Submission status: Accepted

Solution code:
K = int(input())
e = K // 2
o = (K + 2 - 1) // 2
if e + o == K:
    print(e * o)

Submission status: Accepted

Solution code:
print((lambda x:(x//2)*(x-x//2))(int(input())))

Submission status: Accepted

Solution code:
K = int(input())

odd = K // 2 if K % 2 == 0 else K // 2 + 1
even = K // 2

R = odd * even

print(R)

Submission status: Accepted

Solution code:
a=int(input())/2;print(int(a**2))

Submission status: Accepted

Solution code:
K=int(input())
A=0
B=0
for i in range(1,K+1):
    if i%2==0:
        A+=1
    else:
        B+=1
print(A*B)

Submission status: Accepted

Solution code:
n=int(input());print(int((n/2)**2))

Submission status: Accepted

Solution code:
K=int(input())

print(((K+1)//2)*(K//2))

Submission status: Accepted

Solution code:
a=int(input());x=a//2;print((a-x)*x)

Submission status: Accepted

Solution code:
K = int(input())
if K % 2 == 1:
    print(int(((K - 1) / 2 ) * ((K + 1) / 2)))
    
else:
    print(int((K / 2)**2))

Submission status: Accepted

Solution code:
n=int(raw_input())
e=n/2
o=(n+1)/2
print e*o

Submission status: Accepted

Solution code:
K = int(input())

result = (K // 2) * ((K+1) // 2)

print(result)

Submission status: Accepted

Solution code:
def get(n):
  if(n%2==0):
    return ((n//2)**2)
  elif(n==1):
    return (0)  
  else:
    return (((n//2)**2)+(n-1)//2)

n=int(input())
z=get(n)
print (z)

Submission status: Accepted

Solution code:
K = int(input())
odd = []
even = []
count = 0

for i in range(1, K+1):
    if i % 2 == 0:
        even.append(i)
    else:
        odd.append(i)
for i in even:
    for j in odd:
        count += 1

print(count)

Submission status: Accepted

Solution code:
K = int(input())
out= 0
if K%2 == 0:
    out = (K/2)**2
else:
    out =((K-1)/2)*((K+1)/2)
print(int(out))

Submission status: Accepted

Solution code:
K=int(input())


if K%2 == 1:
    P=(K+1)/2
    print(int(P*(P-1)))
else:
    O=K/2
    print(int(O*O))