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

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

Solution code:
import numpy as np


def num_even_odd(num):
    num_odd = np.ceil(num/2)
    num_even = num//2
    return num_odd, num_even


def main(num):
    odds, evens = num_even_odd(num)
    print(int(odds * evens))


if __name__ == "__main__":
    main(int(input()))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
K=int(input())

if K%2:
    print(int(K**2/4-0.25))
else:
    print(int((K/2)**2))

Submission status: Accepted

Solution code:
import itertools
N= int(input())
kisou = []
gusou = []
for num in [i for i in range(N+1)][1:]:
    if num%2==0:
        gusou.append(num)
    else:
        kisou.append(num)
print(len(list(itertools.product(kisou, gusou))))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict
K = int(input())
d = defaultdict(lambda: 0)
for i in range(1, K + 1):
    d[i % 2] += 1
print(d[0] * d[1])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

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


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
"""AtCoder"""

import sys
input = sys.stdin.readline

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


main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math
K = int(input())

print( math.floor(K/2.0) * math.ceil(K/2.0) )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

n1 = K//2
n2 = (K+1)//2

print(n1*n2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())


if n % 2 == 0:
    ans = int(n/2)
    n -= 1
    while n > 0:
        ans += int(n/2)
        n -= 1
else :
    ans = 0
    while n > 0:
        ans += int(n/2)
        n -= 1

print(ans)

Submission status: Accepted

Solution code:
# input
K = int(input())

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

Submission status: Accepted

Solution code:
def main(k):
    print(-(k//2)*(-k//2))

k = int(input())
main(k)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())
a = []
b = []
counter = 0

for i in range(K):
    if i % 2 == 0:
        a.append(i)
    else:
        b.append(i)

for p in a:
    for s in b:
        counter += 1

print(counter)

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

print(odd * even)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

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

print(int(even*odd))

Submission status: Accepted

Solution code:
K = int(input())

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

print(A * B)

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

Solution code:
K = int(input())

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

print(odd * even)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())
cnt = 0
for i in range(1, k + 1):
    for j in range(1, k + 1):
        if i % 2 != j % 2:
            cnt += 1
print(cnt // 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:
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)*(K-(K//2)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
K=int(input())

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
K = int(input())
gu = []
ki = []
for i in range(1,K+1):
    if i%2 == 0:
        gu.append(i)
    else:
        ki.append(i)

print(len(gu)*len(ki))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

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

if k % 2 != 0:
  odd = odd + 1
  
print(even * odd)

Submission status: Accepted

Solution code:
k = int(input())

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

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

print(even*odd)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Kの値取得
K = int(input())
# 組み合わせの計算
print(K // 2 * (K // 2 + K % 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
n=int(input())
count=0;
for i in range(1,n+1,2):
  for j in range(2,n+1,2):
    count+=1
print(count)

Submission status: Accepted

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

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

print(count)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n=int(input())
even=[]
odd=[]
for i in range (1,n+1,1):
    if i%2==0:
        even.append(i)
    else:
        odd.append(i)
result=[(x,y) for x in even for y in odd]
print(len(result))

Submission status: Accepted

Solution code:
N = int(input())
Even = []
Odd = []
for i in range(1,N+1):
    if i % 2 == 0:
        Even.append(i)
    else:
        Odd.append(i)
print(len(Even) * len(Odd))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

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())
ans = 0
for i in range(1, k):
    for j in range(i+1, k+1, 2):
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
y = int(input())

def former (x):
    if x%2 == 0 :
        return int (x/2)**2
    else:
        return int (x/2) * (int(x/2) + 1)

z = former(y)
print (z)

Submission status: Accepted

Solution code:
K = int(input())

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

ans = solve(K)
print(ans)

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

Submission status: Accepted

Solution code:
# https://beta.atcoder.jp/contests/abc108/tasks/abc108_a
def solve():
    i = int(input())

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
K=int(input())

c=K%2

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(b*(a-b))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(int(ans))

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**13
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    n = I()
    a = n // 2
    b = n - a

    return a * b


print(main())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

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

Submission status: Accepted

Solution code:
K = int(input())

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

print(round((K/2)**2))

Submission status: Accepted

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

if num % 2 == 1:
    odd = odd + 1
    
print( even*odd )

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

k = int(input())
print(pair(k))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def a():
    s=int(input())
    n=0
    for i in range(1,s,2):
        n=n+s-i
    print(n)
a()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

odd = (K + 2 - 1) // 2
eve = K // 2

print(odd * eve)

Submission status: Accepted

Solution code:
k = int(input())
count1 = 0
count2 = 0

for i in range(k):
    if i % 2 != 0:
        count1 += 1
    else:
        count2 += 1

print(count1 * count2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(K):
    return (K // 2) * (K - (K // 2))


if __name__ == "__main__":
    K = int(input(""))
    print(solve(K))

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import*
k= int(input ())
if (k%2==0):
    print (int((k/2)**2))
else:
    print(int(ceil(k/2)*floor(k/2)))

Submission status: Accepted

Solution code:
K = int(input())
g_list = []
k_list = []

for i in range(1, K+1):
    if i%2 == 0:
        g_list += [i]
    elif i%2 == 1:
        k_list += [i]

g_len = len(g_list)
k_len = len(k_list)
print(g_len*k_len)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=int(input())
even=[]
odd=[]
for i in range (1,k+1,1):
    if i%2==0:
        even.append(i)
    else:
        odd.append(i)
result=[(x,y) for x in even for y in odd]
print(len(result))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = input()

l = int(k/2)

print(l*(k-l))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=int(input())
odd=1 
even=0
for i in range (2,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==1)and k<=100:
    a=k//2
    b=k//2+1
elif (k%2==0)and k<=100:
    a=k//2
    b=k//2
print(a*b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=int(input())
if (k%2==1)and k<=100:
    a=k//2
    b=k//2+1
elif (k%2==0)and k<=100:
    a=k//2
    b=k//2
print(a*b)

Submission status: Accepted

Solution code:
a = int(input())
even, odd = 0, 0

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

print(even * odd)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())
even=[]
odd=[]
for i in range (1,a+1,1):
    if i%2==0:
        even.append(i)
    else:
        odd.append(i)
result=[(x,y) for x in even for y in odd]
print(len(result))

Submission status: Accepted

Solution code:
import sys
from fractions import gcd


def main():
    n = int(input())
    print((n // 2) * ((n + 1) // 2))

if __name__ == '__main__':
    main()

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())
m = int(k / 2)

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

Submission status: Accepted

Solution code:
k=int(input())
sum=0
k-=1
while k>0:
    sum+=k
    k-=2
print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())
x = 0
for i in range (0,K,1):
    if i % 2 == 0:
        x +=1
sum = x * (K-x)
print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if k%2==0:
    n=k//2
    numofways=n*n

elif k%2==1:
        n=int(k//2)
        m=n+1
        numofways=n*m

print (numofways)

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:
K=int(input())
l=0
for i in range(1,K+1):
    for z in range(i,K+1):
        if (i%2==0 and z%2==1) or (i%2==1 and z%2==0):
            l+=1
print(l)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())
z=0
if x<2:
    print(0)
for i in range(2,x+1,2):
    for j in range(1,x+1,2):
        z+=1
print(z)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
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())
a=[]
for i in range(1,K+1):
    a.append(i)

counter=0
if K>=2 and K<=100 :
    for x in range(len(a)):
        for j in range(x+1,len(a)):
            if a[x]&1==0 and a[j]&1==1 or a[x]&1==1 and a[j]&1==0:
                a[x]*a[j]%2==0
                if a[x]*a[j]%2==0:
                    counter+=1
            

    print(counter)

Submission status: Accepted

Solution code:
k=int(input())
if (k%2)==1 and k<=100:
    a=k//2
    b=k//2+1
elif (k%2)==0 and k<=100:
    a=k//2
    b=k//2
print(a*b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())
while k < 2 or k > 100:
    k = int(input())

evenNum = []
oddNum = []

for o in range(1, k+1, 2):
    oddNum.append(o)

for e in range(2, k+1, 2):
    evenNum.append(e)

ways = len(evenNum) * len(oddNum)
print(ways)