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:
# -*- coding: utf-8 -*-

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:
import math
k=int(input())
print(math.floor(k*k/4))

Submission status: Accepted

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


def solve(K: int):
    ret = (K // 2) * ((K + 1) // 2)
    print(ret)
    return


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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
	
def main():
	K = int(input())
	tmp = 0
	tmp2 = K // 2
	if K % 2 == 1:
		tmp = K // 2 + 1
	else:
		tmp = K // 2
	print(tmp * tmp2)
	
if __name__ == "__main__":
	main()

Submission status: Accepted

Solution code:
k = int(input())

if k % 2 == 0:
  print(round(k/2)**2)
else:
  import math
  print(math.ceil(k/2)*math.floor(k/2))

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

Solution code:
#108 A
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-1)/2)*((K+1)/2)))

Submission status: Accepted

Solution code:
K = int(input())
gu = 0
ki = 0

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

print(ki * gu)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=int(raw_input())
no=k/2+k%2
ne=k/2
print(no*ne)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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 += 1
    else:
        odd += 1
print(even*odd)

Submission status: Accepted

Solution code:
import sys
K = int(input()) #iを取得し、intに値を入れる

kumi = list(range(0,K+1))
l_even = [i for i in kumi if i % 2 == 0 and i != 0]
l_kisu = [i for i in kumi if i % 2 != 0]

answer = len(l_even) * len(l_kisu)

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import itertools

a = int(input())

odd_list = np.arange(1, a+1, 2)
even_list = np.arange(2, a+1, 2)
count = 0
for odd, even in itertools.product(odd_list, even_list):
    #print(odd,even)
    count += 1
    
print(count)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

a, b = K//2, K//2
if K%2 == 1:
    b += 1

print(a*b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

print((n // 2) * (n - n // 2))

Submission status: Accepted

Solution code:
print(sum([i//2 for i in range(1, int(input())+1)]))

Submission status: Accepted

Solution code:
K = int(input())

ak = 0
for i in range(1, K+1):
  ak += i//2
print(ak)

Submission status: Accepted

Solution code:
K = int(input())

if K%2 == 0:
  ak = K**2//4
else:
  ak = (K**2-1)//4

print(ak)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

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

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

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

print(a*b)

Submission status: Accepted

Solution code:
K = [(i+1)%2 for i in range(int(input()))]
print((len(K)-sum(K))*sum(K))

Submission status: Accepted

Solution code:
N=int(input())
X=sorted([i%N+1 for i in range(1,N*2+1)])
print(sum(X[:(N-1)]))

Submission status: Accepted

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

Submission status: Accepted

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

print(b * c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

if(K%2==0):
    even_count = int(K/2)
    odd_count = int(K/2)
else:
    even_count = int(K/2)
    odd_count = int(K/2)+1

print(even_count * odd_count)

Submission status: Accepted

Solution code:
K = int(input())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

k = int(input())
g = k / 2

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
'''
A. pair
'''
import math

def main():
    s = int(input().strip())
    c = s/2
    return(math.ceil(c)*math.floor(c))

print(main())

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
import math

K = int(input())

a = math.ceil(K / 2)
b = math.floor(K / 2)

print(a*b)

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2019/03/27
# AtCoder Beginner Contest 108 - A

# Input
k = int(input())

# Calc
n = k % 2
even = int(k / 2)
if n == 0:
    odd = even
else:
    odd = even + 1

# Output
print(even*odd)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

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


def solve(K: int):
    even = K//2
    odd = K-even
    print(even*odd)
    return


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

Submission status: Accepted

Solution code:
x= int(input())

print((x//2)*(x- x//2))

Submission status: Accepted

Solution code:
k = int(input())
num_list = []
for num in range(1, k+1):
    if num % 2 != 0:
        for gsu in range(1, k+1):
            if gsu % 2 == 0:
                pair = []
                pair.append(num)
                pair.append(gsu)
                num_list.append(pair)
print(len(num_list))

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 = input()
even = k/2
odd = k - k/2
print even * odd

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007

#A
def A():
    n = II()
    ans = n * 800
    print(ans-(n//15)*200)
    return

#B
def B():
    k = II()
    a = k // 2
    b = (k + 1) // 2
    print(a*b)
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    B()

Submission status: Accepted

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

#A
def A():
    n = I()
    print(n*800-200*(n//15))

#B
def B():
    k = I()
    ans = 0
    for i in range(1,k):
        for j in range(i+1,k+1):
            if (i%2)^(j%2):
                ans += 1
    print(ans)

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

def J():
    return

def K():
    return

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
K = int(input())

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print( int( (k//2) * int(k/2+0.5) ))

Submission status: Accepted

Solution code:
K = int(input())

num_even = K // 2
num_odd = (K + 1) // 2

print(num_even * num_odd)

Submission status: Accepted

Solution code:
# coding: utf-8
N = int(input())
print([(N // 2) * (N // 2 + 1), (N // 2) ** 2][N % 2 == 0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())
Q, R = divmod(K, 2)
print(Q * (Q + R))

Submission status: Accepted

Solution code:
K = int(input())
evens = K >> 1
odds = evens + (K & 1)
print(evens * odds)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18

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

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

Submission status: Accepted

Solution code:
from sys import stdin
K=int(stdin.readline().rstrip())
lst=list(range(1,K+1))
ans=len(lst[0::2])*len(lst[1::2])
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def pair(K: int)->int:
    even = K // 2
    odd = K // 2 + (0 if K % 2 == 0 else 1)

    return even * odd


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

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

Submission status: Accepted

Solution code:
K=int(input())
print((K>>1)*(-(-K>>1)))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

Solution code:
k = int(input())

c=0

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

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

Solution code:
import itertools
K = int(input())
if K%2 == 0:
  A = range(2,K+1,2)
  B = range(1,K,2)
else:
  A = range(2,K,2)
  B = range(1,K+1,2)
print(len(list(itertools.product(A,B))))

Submission status: Accepted

Solution code:
K = int(input())

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

print(ans)
print()

Submission status: Accepted

Solution code:
K = int(input())

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

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc108/tasks/abc108_a
k = int(input())
print((k // 2) * ((k + 1) // 2))

Submission status: Accepted

Solution code:
import itertools

K = int(input())

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

ans = list(itertools.product(even, odd))

print(len(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC108A
K=int(input())
print(K//2*(K//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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def is_even(num):
    return num % 2 == 0


for i in range(1, k + 1):
    for j in range(i, k + 1):
        if (is_even(i) & (not is_even(j))) | (is_even(j) & (not is_even(i))) :
            count += 1

print(count)

Submission status: Accepted

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

print(int(e*o))

Submission status: Accepted

Solution code:
from sys import stdin

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
k = int(input())

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

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

Submission status: Accepted

Solution code:
k = int(input())

m = k % 2
ro = (k + m) // 2
re = k // 2

print(ro * re)

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc108/tasks/abc108_a

K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import math
import sys
import heapq
from operator import itemgetter
import itertools
input = sys.stdin.readline

# a = int(input().rstrip())
# a, b = map(int, input().rstrip().split())
# D = list(map(int, input().rstrip().split()))
# H = [int(input().rstrip()) for _ in range(L)]
# DD = [[0 for j in range(100)] for i in range(200)]
# dict = {} ## dictionary

# a = sorted(a, key=lambda x: x[1]))
# if __name__ == '__main__':

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main() -> None:
    N = int(input())
    a = N // 2
    b = N // 2 + N % 2
    print(a * b)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
int_k = int(input())

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

flg = False
p = 0
count = 0
for i in range(K-1):
    if flg:
        count += p
    else:
        p += 1
        count += p
    flg = not flg

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = raw_input()
k = int(k)
c = 0
for i in range(2,k+1,2):
	for j in range(1,k+1,2):
			c += 1
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())
print((K // 2) * (-(-K // 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:
import sys

def main():
  input = sys.stdin.readline
  N = int(input())
  print(N//2 * (N//2 + N%2))


if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

even_number = list(range(2,k+1,2))
odd_number = list(range(1,k+1,2))


print(len(even_number)*len(odd_number))

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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