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:
#!/usr/bin/env python3
import sys


def solve(K: int):
    if K % 2 == 0:
        print((K//2)**2)
    else:
        print(((K+1) * (K-1))//4)
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  # type: int
    solve(K)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
print((n+1)//2 * (n-1)//2 if n%2 else (n//2)*(n//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())

even = K // 2
odd = K - even
print(even * odd)

Submission status: Accepted

Solution code:
N = int(input())
ev = N//2
od = N-ev
print(ev*od)

Submission status: Accepted

Solution code:

k = int(input())

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

Submission status: Accepted

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


abc()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

a = n // 2
b = (n+1) // 2
print(a*b)

Submission status: Accepted

Solution code:
k = int(input())
from math import floor
print(floor(k/2)*(k - floor(k/2)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

def guuki(num):
    if num%2 == 0:
        return 0
    else:
        return 1

if k == 1:
    print(1)
elif guuki(k) == 0:
    print(math.ceil(k/2 * k/2))
else:
    print(math.ceil((k+1)/2 * (k-1)/2))

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)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

ans = K // 2
ans = (K- ans) * ans
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

Solution code:
k = int(input())

from itertools import combinations

ls = [int(x) for x in range(1,k+1)]

com = combinations(ls,2)

flg = 0
for i in com:
    if sum(i)%2 == 1:
        flg += 1

print(flg)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

k = int(input())

if k%2 == 0:
    print(int((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//4)
else:
    print((k**2-1)//4)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

oddl = []
evenl = []

for i in range(a):
    if i%2 == 1:
        oddl.append(i)
    else:
        evenl.append(i)

odd = len(oddl)
even = len(evenl)

print(odd*even)

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())
print(k//2*(k//2+k%2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
import itertools
import math

K = int(input())


print((K//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())

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

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

print(int(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

ans = int(k/2) * int((k+1)/2)

print(ans)

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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

e = k // 2
o = (k+1) // 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:
import itertools
n = int(input())
l = []
for i in range(1,n+1):
  l.append(i)
com = list(itertools.combinations(l,2))
cnt = 0
for i in range(len(com)):
  if com[i][0] % 2 == 0 and com[i][1] % 2 == 1 or com[i][0] % 2 == 1 and com[i][1] % 2 == 0:
    cnt += 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    k = f()[0]
    even = k//2
    odd = k - even
    print(even*odd)

solve()

Submission status: Accepted

Solution code:
K = int(input())

e = int(K/2)
o = K - e

print(e * o)

Submission status: Accepted

Solution code:
import sys
import bisect
input = sys.stdin.readline

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())
print(k//2 * (k-k//2))

Submission status: Accepted

Solution code:
K = int(input())

if not K % 2:
    print((K // 2) ** 2)
else:
    print((K // 2 + 1) * (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())
half = k // 2
two = half
one = half
if k % 2 != 0:
    one = half + 1
print(one * two)

Submission status: Accepted

Solution code:
K = int(input())

E = []
O = []
for i in range(1, K+1):
    if i % 2 == 0:
        E.append(i)
    else:
        O.append(i)

print(len(E)*len(O))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

e = K // 2
if K % 2 == 1:
    o = K // 2 + 1
else:
    o = K // 2

print(e * o)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys


def solve(K: int):
    ne = K // 2
    no = ne + K % 2

    print(int(ne*no))
    return


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  # type: int
    solve(K)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin

K = int(stdin.readline().rstrip())

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

Submission status: Accepted

Solution code:
a = int(input())

print(int((a/2)*(a/2)))

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())
if n % 2 == 0:
  print(int(pow(n // 2, 2)))
else:
  print(int(pow(n // 2, 2) + n // 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(int(a * b))

Submission status: Accepted

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

Submission status: Accepted

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

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())
if K%2 == 0:
    print((K//2)**2)
else:
    print((K//2)*((K//2)+1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

print(sum_even*sum_odd)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
A - Pair
https://atcoder.jp/contests/abc108/tasks/abc108_a

"""
import sys


def solve(K):
    even = K // 2
    odd = (K+1) // 2
    return even * odd


def main(args):
    K = int(input())
    ans = solve(K)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

Solution code:
k = int(input())

even = k//2
odd = k - k// 2

print(even*odd)

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:
k=int(input())

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

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+1)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

A = int(K/2)
B = K -A

print(A*B)

Submission status: Accepted

Solution code:

K = int(input())

even = K // 2
odd = K - even
print(int(even * odd))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

Solution code:
n=int(input())
x=list(range(1,n+1))
A=[]
aa=0
for i in x:
  for j in x:
    if i%2==0 and j%2!=0:
      A.append([i,j])
      aa+=1
print(aa)

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]

# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
print(((K+1)//2)*(K//2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

odd = K//2
even = K - odd

print(odd * even)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
K = int(input())
ans=0
for i in range(1,K+1):
    for j in range(1,K+1):
        if i != j and i%2==0 and j%2==1:
            ans+=1
print(ans)

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(raw_input())

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

Submission status: Accepted

Solution code:
import math

k = int(input())

print(int(k/2) * math.ceil(k/2))

Submission status: Accepted

Solution code:
###############################################################################

from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    if y > x // 2:
        y = x - y

    ret = 1

    for i in range(0, y):
        j = x - i
        i = i + 1

        ret = ret * j
        ret = ret // i

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance


###############################################################################


def main():
    k = intin()

    odd = (k + 1) // 2
    even = k // 2

    print(odd * even)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())
num_odds = (k - 1) // 2 + 1
num_evens = k // 2

print(num_odds * num_evens)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

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

print(a*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
odd = 0
even = 0
if k%2==0:
    odd = k//2
    even = k//2
else:
    odd = k//2+1
    even = k//2
print(odd*even)

Submission status: Accepted

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

def solve():
    K = int(input())
    odd = math.ceil(K/2)
    even = math.floor(K/2)

    print(odd*even)

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

lst = [i + 1 for i in range(k)]
odds = len(lst[0::2])
evens = len(lst[1::2])
print(odds*evens)

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
k = int(input()) / 2

print(math.floor(k) * math.ceil(k))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

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:
    ans = int(K/2)*int(K/2)
else :
    ans = int(K/2)*(int(K/2)+1)
print(ans)

Submission status: Accepted

Solution code:
k = int(input())

if (k%2) == 0:
    ans = int((k*0.5)**2)
else:
    ans = int((k*0.5-0.5) * (k*0.5+0.5))
print(ans)

Submission status: Accepted

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

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())

even = len([x for x in range(1,K + 1) if x % 2 == 0])
odd = len([x for x in range(1,K + 1) if x % 2 != 0])

print(even * odd)

Submission status: Accepted

Solution code:
k=int(input())

m=k//2

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
a=int(input())

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

Submission status: Accepted

Solution code:
K = int(input())
gCnt = int(K / 2)
kCnt = K - gCnt
ans = gCnt * kCnt
print(ans)

Submission status: Accepted

Solution code:
N = int(input().strip())
print((N//2)*((N+1)//2))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
from math import *
from itertools import *
from collections import *
from functools import *
try:
    from math import gcd
except Exception:
    from fractions import gcd


def solve(K: int):
    return (K // 2) * (K // 2 + (K % 2))


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  # type: int
    result = solve(K)
    print(result)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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:
import math

K = int(input())

even = math.floor(K/2)
odd = math.ceil(K/2)

print(even*odd)

Submission status: Accepted

Solution code:
import math
a = int(input())
if a % 2 == 0:
    print(int((a/2)**2))
else :
    print(math.ceil(a/2)*(a//2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())
count = 0
for i in range(1, K+1):
  for j in range(i+1, K+1, 2):
    count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import re

K = int(input())

g = 0
k = 0
for i in range(1,K+1):
    if(i % 2 == 0):
        g += 1
    else:
        k += 1
print(g*k)

Submission status: Accepted

Solution code:
import bisect
from collections import Counter
def MI(): return map(int, input().split())
def II(): return int(input())
def IS(): return input()
def LI(): return list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
K = int(input())
K_list = list(range(1, K + 1))
even_list = []
odd_list = []
for i in range(K):
    if K_list[i] % 2 == 0:
        even_list.append(K_list[i])
    elif K_list[i] % 2 == 1:
        odd_list.append(K_list[i])
result = list(itertools.product(even_list, odd_list))
print(len(result))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 main():
    num = int(input())
    odd_num = (num + 1) // 2
    even_num = num // 2
    print(odd_num * even_num)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
K = int(input())

ans = 0
for i in range(1, K+1):
    if i % 2 == 0:
        for j in range(1, K+1):
            if j % 2 == 1:
                ans += 1
                
print(ans)

Submission status: Accepted

Solution code:
import functools
import math

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


k = inp()
print((k // 2) * math.ceil(k / 2))

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(int(k/2)**2)
else:
    print(int((k//2)*(k//2+1)))

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=int(input())
o=0
e=0

for i in range(k):
    if (i+1)%2==1:
        o+=1
    else:
        e+=1
print(o*e)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
K = int(input())
o = e = K // 2
if K % 2: o += 1
print(o * e)

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007

#A
def A():
    a,b,c = LI()
    print(9*max(a,b,c)+a+b+c)
    return

#B
def B():
    a,b = LI()
    if a*b %2:
        print("Yes")
    else:
        print("No")
    return

#C
def C():
    k = I()
    print((k//2)*(k//2+k%2))
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#I
def I_():
    return

#J
def J():
    return

#Solve
if __name__ == "__main__":
    C()

Submission status: Accepted

Solution code:
input = input()
list = range(1,int(input)+1)
even = []
odd = []

for fig in list:
    if fig%2 == 0:
        even.append(fig)
    elif fig%2 != 0:
        odd.append(fig)

result = len(even) * len(odd)

print(result)

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('{0:.0f}'.format(((k/2)*(k/2))))
else:
    print('{0:.0f}'.format((((k-1)/2)*((k-1)/2)+((k-1)/2))))

Submission status: Accepted

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

Submission status: Accepted

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