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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

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

Submission status: Accepted

Solution code:
k = int(input())
print((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 - 1) // 4)

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

Submission status: Accepted

Solution code:
def main():
    K = int(input())
    even = 0
    odd = 0
    if K % 2 == 0:
        even = K // 2
        odd = K // 2
    else:
        even = (K - 1) // 2
        odd = K - even
    print(even * odd)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
k = int(input())

odd, even = 0, 0
if k % 2 == 0:
  odd = k // 2
  even = odd
else:
  even = (k - 1) // 2
  odd = even + 1

print(even * odd)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n= int(input())
print((n//2+1)*(n//2) if n%2 == 1 else (n//2)**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:
def main():
  n = int(input())
  a = n // 2
  b = (n + 1) // 2
  print(a*b)
  
if __name__ == "__main__":
  main()

Submission status: Accepted

Solution code:
def saiki(k) :
    if k == 1 :
        return 0
    if k == 2 :
        return 1
    return saiki(k - 2) + k - 1

K = int(input())
print(saiki(K))

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

print(even*odd)

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

Submission status: Accepted

Solution code:
k = int(input())

ans = 0
for i in range(2, 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:
k = int(input())
if k % 2 == 0: print(int(k / 2) ** 2)
else: print(int(k / 2) ** 2 + int(k / 2))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools

K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K=int(input())

if (K%2==0):
    print(int(K*K/4))
else:
    print(int(((K-1)*(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:
k = int(input())
print(k//2 * (k//2+k%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:
n=int(input())
q,r=divmod(n,2)
print(q*(q+r))

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(1, K+1):
  if i%2==0:
    # print(i)
    for i in range(1, K+1):
        if i%2==1:
            # print(" ", i)
            count +=1

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(input())
print((n-n//2)*(n//2))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())
if n % 2 == 0:
	print(int(n/2)**2)
else:
	print((int(n/2)+1) * int(n/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:
"""
author : halo2halo
date : 23, Jan, 2020
"""

import sys

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from math import ceil
k=int(input())
print((k//2)*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:
a = int(input())
print((a//2)*(a-a//2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())
ans = len(range(1, K+1, 2)) * len(range(2, K+1, 2))
print(ans)

Submission status: Accepted

Solution code:
K = int(input())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())
L = list(range(1, K))
n = (K // 2)
if K % 2 == 0:
    print(n**2)
else:
    print(n * (n + 1))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    from sys import stdin, setrecursionlimit
    setrecursionlimit(10**6)
    #r = stdin.readline()[:-1]
    n = int(stdin.readline()[:-1])   
    #r = [stdin.readline() for i in range(n)]
    #t = [int(stdin.readline()) for i in range(n)]

    from math import ceil,floor
    print(ceil(n/2)*floor(n/2))

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
from math import ceil

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())

sys.setrecursionlimit(10 ** 9)


def main():
    K = INT()
    print((K//2)*ceil(K/2))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
if N%2==0:
  print(int(N/2)**2)
elif N%2!=0:
  print((N//2)*(N-(N//2)))

Submission status: Accepted

Solution code:
N=int(input())
if N%2==0:
  print((N//2)**2)
elif N%2!=0:
  print((N//2)*(N-(N//2)))

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def my_round(a,dig=0):
    p = 10 ** dig
    return (a * p * 2 + 1) // 2 / p

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): #最小公倍数
    return a/gcd(a,b)*b

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): #素因数分解
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

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

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

    odd = K // 2
    even = K - odd

    print(odd * even)

main()

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

print(len(range(2, K+1, 2)) * len(range(1, K+1, 2)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
import sys

k = int(sys.stdin.readline().rstrip())

def main():
    return (k - k // 2) * (k // 2)

if __name__ == '__main__':
    ans = main()
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

l = []

for x in range(1, a + 1):
  for y in range(1, a + 1):
    if (x % 2 == 0) and (y % 2 == 1):
      l.append([x, y])

print(len(l))

Submission status: Accepted

Solution code:
k = int(input())

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

print(int(ans))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
K = int(input())
d = K //2
dk = K - d
print(d * dk)

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

Submission status: Accepted

Solution code:
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353

k = int(sys.stdin.buffer.readline())
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())
print((k//2+k%2)*(k//2))

Submission status: Accepted

Solution code:
# coding: utf-8
import math

k = int(input())

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

print(odd * even)

Submission status: Accepted

Solution code:
import sys, math
def input():
    return sys.stdin.readline()[:-1]
from itertools import permutations, combinations
from collections import defaultdict, Counter

sys.setrecursionlimit(10**7)
N = int(input())

if N%2:
    ki = N//2 + 1
    gu = N//2
    print(ki*gu)
else:
    ki = N//2
    gu = N//2
    print(ki*gu)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K=int(input())
A,B=0,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())

o = k//2
e = k - k//2
print(o*e)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

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

Submission status: Accepted

Solution code:
K = int(input())

ans = 0

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

print(ans)

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

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n=INT()
    if n%2==0:
        print(int(n*n/4))
    else:
        print((n//2)*(n//2+1))
if __name__ == '__main__':
    do()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
K = int(input())
print(int(K/2) * int((K+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:
def main():
    k = int(input())

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
a=int(input())

print((a//2)*(a-a//2))

Submission status: Accepted

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

Submission status: Accepted

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

print(int(cou))

Submission status: Accepted

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

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(even*odd)

Submission status: Accepted

Solution code:
k = int(input())
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:
print(int(input()) ** 2 >> 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

e = k // 2
o = k - e

print(e * o)

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

print(even * odd)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

evens = K // 2
odds = K - evens

print(evens * odds)

Submission status: Accepted

Solution code:
K = int(input())

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

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:
# ABC108a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

Solution code:
from math import ceil

K=int(input())
print(ceil(K/2)*(K//2))

Submission status: Accepted

Solution code:
K = int(input())

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

print(odd*even)

Submission status: Accepted

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

#入力
#S = str(input())
#N, i = map(int, input().split())
K = int(input())

print ( (K - math.floor(K/2)) * (math.floor(K/2)) )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

e = K // 2
o = K - e
print(e*o)

Submission status: Accepted

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

Submission status: Accepted

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

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:
import math
n = int(input())
print((n//2) * math.ceil(n/2))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

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

ret=ki*gu
  
print(ret)

Submission status: Accepted

Solution code:
A=int(input())

kisu=[]
gusu=[]
for i in range(1,A+1):
  if i % 2:
    kisu.append(i)
  else:
    gusu.append(i)
import itertools
print(len(list(itertools.product(kisu,gusu))))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

print(int(ans))

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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


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


# Generated by 1.1.6 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():
    K = int(input())
    solve(K)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

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

N = int(input())
if N&1:
    print((N//2)*(N//2+1))
else:
    print((N//2)**2)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())
a = 0 # 偶数
b = 0 # 奇数

for i in range(k):
    if (i+1) % 2 == 0:
        a += 1
    else:
        b += 1

print(a*b)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=int(input())
even = 0
odd = 0
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

n = int(input())

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

Submission status: Accepted

Solution code:
from sys import stdin
import bisect
from itertools import groupby
 
n = int(stdin.readline().rstrip())

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