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:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18
# ----------------------------------------------------------- #

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

Submission status: Accepted

Solution code:
def cmb(n):
    return (n * (n - 1)) / 2

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inf = 10 ** 15
mod = 10 ** 9 + 7
k = int(input())
if k % 2 == 0:
    print((k//2)*(k//2))
else:
    print((k//2+1)*(k//2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

# N : odd -> N**2 - 1 // 4
# N : even -> N**2 // 4
print( N ** 2 // 4)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    n = int(input())
    ans = 0
    for i in range(1, n + 1):
        for j in range(1, n + 1):
            if i % 2 == 0 and j % 2 == 1:
                ans += 1
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
K = int(input())

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

print(len(odd) * len(even))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

K = ir()
even = K // 2
odd = (K+1) // 2
answer = even * odd
print(answer)

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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

    n_odd = 0
    n_even = 0
    for i in range(1, K + 1):
        if i % 2 == 0:
            n_even += 1
        else:
            n_odd += 1
    ans = n_odd * n_even

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

if __name__ == '__main__':

    ABC_108_A()

Submission status: Accepted

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

import sys
# import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)


def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1               # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    n = ii()
    if n % 2 == 0:
        print((n // 2) ** 2)
    else:
        print((n // 2) * (n // 2 + 1))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
K=list(itertools.combinations(range(1,int(input())+1),2))
c=0
for i in K:
    if (i[0]%2==0 and i[1]%2==1) or (i[0]%2==1 and i[1]%2==0):
        c+=1
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi
# endregion

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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


main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=int(input())
cnt=1
for i in range(3,k+1):
  cnt+=i//2
print(cnt)

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

Submission status: Accepted

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

K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

Solution code:
# ABC108A

k = int(input())
odd = k // 2
if k % 2 == 1:
    odd += 1
print(odd * (k-odd))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
MOD = 10 ** 9 + 7
INF = 10 ** 11
import sys
sys.setrecursionlimit(100000000)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

e = k // 2
o = k // 2 + k % 2

print(e*o)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import math
n = int(input())
print(int(n/2) * math.ceil(n/2))

Submission status: Accepted

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

print(odd_count*(k-odd_count))

Submission status: Accepted

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

Submission status: Accepted

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

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())
gusu = math.floor(k/2)
kisu = math.ceil(k/2)

# n個からr個を選ぶ組み合わせを算出する
def combinations_count(n, r):
   return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

ans = combinations_count(gusu,1)*combinations_count(kisu,1)
print(ans)

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

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

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
for i in range(1,K+1):
  if i % 2 == 0:
    even += 1
  else:
    odd += 1

print(odd*even)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=range(1,int(input())+1)
y=[t for t in x if t%2==0]
z=[t for t in x if t%2==1]
print(len(y)*len(z))

Submission status: Accepted

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

a = (k + 1) // 2

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
k = int(input()) + 1
gusu = []
kisu = []
for i in range(1, k):
  if i % 2 == 0:
    gusu.append(i)
  else:
    kisu.append(i)
count = 0
for i in gusu:
  for j in kisu:
    count += 1
print(count)

Submission status: Accepted

Solution code:
#copy

a = int(input())
print(a // 2 * (a - a // 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
K = int(input())

oddNum = int((K + 1) / 2)
evenNum = int(K/2)

print(oddNum * evenNum)

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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

odd = list(range(1, K+1, 2))
even = list(range(2, K+1, 2))


def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))


print(combinations_count(len(odd), 1)*combinations_count(len(even), 1))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
k = int(input())

a = int(k//2)
b = int(k-a)

print(a*b)

Submission status: Accepted

Solution code:
import math
def main():
    K = int(input())
    if K % 2 == 0:
        print(K**2//4)
    else:
        print(math.floor(K//2)*(math.floor(K//2)+1))
if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())
even = [i for i in range(1, k+1) if i%2==0]
odd = [i for i in range(1, k+1) if i%2!=0]
ans_lst = []
for i in even:    
    for j in odd:
        even_odd = []
        even_odd.append(i)
        even_odd.append(j)
        ans_lst.append(even_odd)
print(len(ans_lst))

Submission status: Accepted

Solution code:
a = int(input())

even, odd = 0, 0

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

print(even * odd)

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

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

else:
    print( (k//2)*(k//2 + 1) )

Submission status: Accepted

Solution code:
import sys
## io
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))
MIIZ = lambda: list(map(lambda x: x-1, MII()))
## dp
INIT_VAL = 0
DP2 = lambda d1, d2: [[INIT_VAL]*d2 for _ in range(d1)]
DP3 = lambda d1, d2, d3: [[[INIT_VAL]*d3 for _ in range(d2)] for _ in range(d1)]

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
## io
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))
MIIZ = lambda: list(map(lambda x: x-1, MII()))
## dp
INIT_VAL = 0
DP2 = lambda d1, d2: [[INIT_VAL]*d2 for _ in range(d1)]
DP3 = lambda d1, d2, d3: [[[INIT_VAL]*d3 for _ in range(d2)] for _ in range(d1)]

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

odd = (k+1)//2
even = k // 2
ans = odd * even
print(ans)

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:
K = int(input())
if K%2 == 0:
  A = K//2
  B = K//2

else:
  A = K//2
  B = K//2 + 1
  
print(int(A*B))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
if n%2==0:
  print('{:.0f}'.format((n/2)**2))
else:
  print('{:.0f}'.format((n+1)/2*(n-1)/2))

Submission status: Accepted

Solution code:
import sys

def main(lines):
  N = int(lines[0])
  print(N // 2*(N - N // 2))

if __name__ == '__main__':
    lines = []
    for l in sys.stdin:
        lines.append(l.rstrip('\r\n'))
    main(lines)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

#input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

k=I()
ans=(k//2)*(k-k//2)
print(ans)

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

Solution code:
a = int(input())
if a % 2 == 0:
  print((a//2)*(a//2))
else:
  print((a//2)*((a+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:
import math
n=int(input())
print(math.ceil(n/2)*(n//2))

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

Solution code:

k = int(input())

if k % 2 == 1:
    a = int(k // 2)
    b = int(k // 2) + 1
    print(a*b)

else:
    a = b =  int(k // 2)
    print(a*b)

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

Submission status: Accepted

Solution code:
from math import floor, ceil

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

Submission status: Accepted

Solution code:
k=int(input())
print(int(k/2)*int((k+1)/2))
#Source code should be longer than 50 charactersSource code should be longer than 50 charactersSource code should be longer than 50 charactersSource code should be longer than 50 charactersSource code should be longer than 50 charactersSource code should be longer than 50 charactersSource code should be longer than 50 charactersSource code should be longer than 50 charactersSource code should be longer than 50 charactersSource code should be longer than 50 characters

Submission status: Accepted

Solution code:
def solve():

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


if __name__ == "__main__":
    solve()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

guu = k//2

if k%2 == 0:
    ki = k//2
else:
    ki = k//2+1

print(guu*ki)

Submission status: Accepted

Solution code:
n=int(input())

if n%2==0:
  print(int((n/2)*(n/2)))
  
else:
  print(int((n/2+0.5)*(n/2-0.5)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools
a = int(input())
e = range(1, a + 1, 1)
b = list(itertools.combinations(e, 2))
for i, item in enumerate(b):
    if sum(x % 2 == 0 for x in item) != 1:
        del b[i]
    elif sum(x % 2 != 0 for x in item) != 1:
        del b[i]
print(len(b))

Submission status: Accepted

Solution code:
num = int(input())

par = []
impar = []
for n in range(num):
    if(n%2==0):
        par.append(n)
    else:
        impar.append(n)

print(len(par)*len(impar))

Submission status: Accepted

Solution code:
import math
def combina(k,p):
    return math.factorial(k)/(math.factorial(k-p)*math.factorial(p))

k = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

y = x // 2
z = (x - y) * y
print(z)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    k = int(input())
    if k % 2 == 0:
        np = k/2
        ni = k/2
        res = np*ni
        print(int(res))
    else:
        np = k//2
        ni = k//2 + 1
        res = np*ni
        print(res)
main()

Submission status: Accepted

Solution code:
k = int(input())
cont_even = 0
cont_odd = 0
for _ in range(2, k+1, 2):
    cont_even += 1
for _ in range(1, k+1, 2):
    cont_odd += 1
print(cont_even * cont_odd)

Submission status: Accepted

Solution code:
numero = int(input())
contador = 0
for x in range(1, numero+1):
    for y in range(x, numero+1):
        if(x + y) % 2 == 1:
            contador += 1
print(contador)

Submission status: Accepted

Solution code:
n = int(input())

even = n//2

odd = n-even

print(even*odd)

Submission status: Accepted

Solution code:
line = input()
num = [int(n) for n in line.split()]
num = num[0]
if num%2 == 0:
    value = round(num/2)**2
else:
    value = round(num/2) * (round(num/2)-1)
print(value)

Submission status: Accepted

Solution code:
N = int(input())

if (N % 2 == 0):
	print(int((N/2)*(N/2)))
else:
	par=int(N/2)
	impar=N-par
	print(int(par*impar))

Submission status: Accepted

Solution code:
n = int(input())
pares=0
for i in range(1, n):
    for j in range(0, n-i):
        if((i%2==0 and (n-j)%2!=0) or (i%2!=0 and (n-j)%2==0)):
            pares+=1
print(pares)