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())
N = K - 1
count = 0
for i in range(K):
    I = i + 1
    for j in range(N):
        J = j + 1
        if I % 2 != 0 & J % 2 == 0:
            count += 1
        elif I % 2 == 0 & J % 2 != 0:
            count += 1
    N -= 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#おそらく上は偶数の処理がおかしい
k = int(input())        
#奇数の場合
if (k%2) == 1:
    o = (k-1) * (k+1) / 8
    #eはoと同じ数値
    print(int(2*o))
#偶数の場合 
else:
    o = k * (k+2) / 8
    e = k * (k-2) / 8
    print(int(o+e))

Submission status: Accepted

Solution code:
def get(n):
    z=((n//2)**2)+(n-1)//2
    if(n%2==0):
        return (n//2)**2
    elif(n==1):
        return 0
    else:
        return z
    
n=int(input())
x=get(n)
print(x)

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

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:
import math
K = int(input())
all_number =  K * K
even_number =  math.floor(K/2) * math.floor(K/2)
odd_number = math.ceil(K/2) * math.ceil(K/2)
answer = (all_number - even_number - odd_number)/2
print(int(answer))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
k = int(input())
if k&1==1:
	odds = ((k-1)//2) + 1
	evens = odds-1
	print(odds*evens)
else:	
	odds = ((k)//2)
	evens = odds
	print(odds*evens)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

k = int(raw_input())

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

Submission status: Accepted

Solution code:
K = int(input())
f = 2
count = 0
while True:
  s = 1
  while True:
    count += 1
    s += 2
    if s > K:
      break
  f += 2
  if f > K:
    break
print(count)

Submission status: Accepted

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

K = int(input())
Odd = 0
Even = 0

for i in range(K):
    if(i % 2 ==0):
        Odd = Odd + 1

    else:
        Even = Even + 1

total = Odd * Even
print(total)

Submission status: Accepted

Solution code:
K = int(input())

if K % 2 == 0:
    a = K // 2
    c = a**2 
else: 
    a = K // 2
    b = K // 2 + 1
    c = a * b

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

mod = K % 2

if mod == 0:
    n_even = K // 2
    n_odd = K // 2 
else:
    n_even = K // 2
    n_odd = K // 2 + 1

print(n_even*n_odd)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def getinputdata():

    array_result = []    
    array_result.append(input().split(" "))

    flg = True

    try:
        while flg:

            data = input()

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = True

            else:

                flg = False
    finally:

        return array_result

arr_data = getinputdata()

k = int(arr_data[0][0])

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

num = range(1, k + 1)
add = len([i for i in num if i % 2 != 0])
even = len([i for i in num if i % 2 == 0])
ans = add * even
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

k = int(input())

evens = k // 2
odds = k - evens

print(evens * odds)

Submission status: Accepted

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

if k % 2 == 0:
    comb = pow((math.factorial(k//2))/(math.factorial(k//2-1)), 2)
    print(int(comb))
else:
    comb = (math.factorial(k//2))/(math.factorial(k//2-1)) * (math.factorial(k//2 + 1))/(math.factorial(k//2))
    print(int(comb))

Submission status: Accepted

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

Submission status: Accepted

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

    d = {}
    for i in range(1, K+1):
        for j in range(i+1, K+1):
            p = tuple(sorted((i, j)))
            if i % 2 == 1 and j % 2 == 0:
                d[p] = 1
            elif i % 2 == 0 and j % 2 == 1:
                d[p] = 1

    ans = len(d)
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
k = raw_input()
k=int(k)
if k%2==0:

    x=k/2
    x=x*x
    print x
else:
    y=k/2
    y=y*(y+1)
    print y

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

n = int(input())
even = int((n / 2))
odd = n - even
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:
import math

K = input()

D = int(K) / 2

f, i = math.modf(D)

if f == 0: # K = グウスウ
    answer =  i * i
else: # K = キスウ
    p1 = i
    p2 = i + 1
    answer = p1 * p2

print(int(answer))

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

def pair(n):
    even = n // 2
    odd = n // 2 + n % 2
    return even * odd

def main():
    n = int(input())
    print(pair(n))


main()

Submission status: Accepted

Solution code:
import math;

K = int(input());

print(math.floor(K/2)*math.ceil(K/2));

Submission status: Accepted

Solution code:
#coding:utf-8

K = int(input())

ans = 0

if K % 2 == 0:
    ans = sum(range(1,K,2))

elif K % 2 == 1:
    ans = sum(range(0,K,2))


print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

k = int(input())
even = math.floor(k/2)
odd = math.floor(k/2)

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

print(even * odd)

Submission status: Accepted

Solution code:
N = int(input())

ans = 0
for i in range(1,N+1):
    ans += i//2

print(ans)

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("{}".format(even*odd))

Submission status: Accepted

Solution code:
K = int(input())


g =0
k =0

if (K % 2) == 0:
    g=K/2
    k=K/2
else:
    g=(K-1)/2
    k=g+1

print(int(g*k))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def Pair(K):
    n = 0
    even = []
    odd = []
    K = int(K)
    k = K + 1
    for p in range(1,k):
        if p%2 == 0:
            even.append(p)
        if p%2 == 1:
            odd.append(p)
    n = len(even) * len(odd)
    print (n)

Pair(input())

Submission status: Accepted

Solution code:
k = int(input())
val = [i for i in range(1, k+1)]

even = 0
odd = 0

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

Submission status: Accepted

Solution code:
data = int(input())

a = data // 2

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

Submission status: Accepted

Solution code:
def main(n):
	if n%2 ==1:
		
		return int(n/2)*(int(n/2)+1)
		
	elif n%2 ==0:
		
		return int(n/2)*int(n/2)


n = int(input())
print(main(n))

Submission status: Accepted

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

k = int(K/2+0.5)
g = int(K/2)
#print(k,g)
print(k*g)

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:
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:
import math
n = int(input())
if(n%2==0):
  print(int(math.pow(int(n/2),2)))
else:
  print(int(n/2) * int((n+1)/2))

Submission status: Accepted

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

ans = 0

if K%2 == 0:
    ans = pow(K, 2)/4
else :
    ans = math.floor(K/2) * round(K/2)

print (int(ans))

Submission status: Accepted

Solution code:
k = int(input())

ans = 0

for i in range(1, k + 1, 2):
    for j in range(2, k + 1, 2):
        ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! /usr/bin/env python3
n=int(input())
a=0
for i in range(0,n-2,2):
    a+=n-i-1
print(a+[1,0][n%2])

Submission status: Accepted

Solution code:
K = int(input())

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

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

print(int(ans))

Submission status: Accepted

Solution code:
import numpy


K = int(input())

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

Submission status: Accepted

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

print(math.ceil(k/2) * math.ceil((k-1)/2))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
 
def main():
	K = int(input())
	if K % 2 == 0:
		n = K / 2
		x = round(n**2)
	else:
		n = (K + 1) / 2
		x = round(n * (n-1))
	print(x)

if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())

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

print(int(c))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
K = int(input())
guusuu = ((K-(K%2))/2)
kisuu = math.floor((K+1)/2)
print(int(guusuu * kisuu))

Submission status: Accepted

Solution code:
k = int(input())
q = k // 2
m = k %  2

k_odd  = q + m
k_even = q

ans = k_odd * k_even
print(ans)

Submission status: Accepted

Solution code:
from sys import stdin, stdout

input = lambda: stdin.readline().rstrip()
write = stdout.write

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

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

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())
num = 0
gu = []
ki = []
for i in range(K):
  if i%2 == 0:
    gu.append(i)
  else:
    ki.append(i)
  a = len(gu)
  b = len(ki)
  num = a*b
  
print(num)

Submission status: Accepted

Solution code:
def solve():
  x = int(input())
  count = 0

  for i in reversed(range(x)):
    i += 1

    if i % 2 ==0:
      count += i / 2
    else:
      count += i // 2
      
  
  print(int(count))

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

Submission status: Accepted

Solution code:
K=int(input())


C=0

for i in range(1,K+1,2):
    for j in range(K):
        if j%2==1:
            C=C+1
        else:
            pass

print(C)

Submission status: Accepted

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

Submission status: Accepted

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

print(int(A))

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

Submission status: Accepted

Solution code:
k=int(input())

ev=k//2
od=k-ev

print(ev*od)

Submission status: Accepted

Solution code:
k = int(input())
base = list(range(1,k+1))
x = [[a,b] for a in base for b in base if (a+b)%2==1 ]
ans = len(x)//2
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
  main()

Submission status: Accepted

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

K = int(input())

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

Submission status: Accepted

Solution code:
Nstr = input()
N = int(Nstr)

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

Submission status: Accepted

Solution code:
k = int(input())
even = []
odd = []
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:
import itertools
k = int(input())
a =[]
for i in range(k):
    a.append(i+1)
c = list(itertools.combinations(a,2))
cnt=0
for i in c:
    if i[0]%2==1 and i[1]%2==0:
        cnt+=1
    elif i[0]%2==0 and i[1]%2==1:
        cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
import math
K = input()
gu = K/2
ki = K/2
ki += 1 if K%2 else 0
print gu * ki

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())
res = 0
even = list()
odd = list()

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

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

Submission status: Accepted

Solution code:
K=int(input())

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

print(count)

Submission status: Accepted

Solution code:
k = int(input())

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

print(int(out))

Submission status: Accepted

Solution code:
k = int(input())

even_num = int(k/2)

if(k%2==0):
    odd_num = even_num
else:
    odd_num = even_num+1

product_num = even_num * odd_num

print(product_num)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

s = int(input())

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

Submission status: Accepted

Solution code:
import sys, math
from sys import stdin, stdout
rem = 10 ** 9 + 7
sys.setrecursionlimit(10 ** 6+5)
#from resource import *; setrlimit(RLIMIT_STACK, (RLIM_INFINITY, RLIM_INFINITY))
take = lambda: map(int, stdin.readline().strip().split())
from bisect import bisect_left,bisect_right

k=input()
print (k/2*(k-k/2))

Submission status: Accepted

Solution code:
def chance(x: int) -> int:
    return (x//2) ** 2 if x % 2 == 0 else ((x-1)//2) * ((x+1)//2)


# if __name__ == '__main__':
#     assert 2 == chance(3)
#     assert 9 == chance(6)
#     assert 30 == chance(11)
#     assert 625 == chance(50)

if __name__ == '__main__':
    x = int(input())
    print(chance(x))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


if __name__ == "__main__":
        main()

Submission status: Accepted

Solution code:
K = int(raw_input().replace("\n", ""))
print (K ** 2) / 4 if K % 2 == 0 else (K - 1) * (K + 1) / 4

Submission status: Accepted

Solution code:
N = int(input())

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

print(int(ans))

Submission status: Accepted

Solution code:
K = int(input())

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

print(int(pair))

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

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:
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))

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

Submission status: Accepted

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

COdd = math.ceil(K / 2)
CEven = int(K / 2)

ans = COdd * CEven
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

even = n//2

if n % 2 == 0 :
    odd = n//2
else:
    odd = n//2+ 1

ans = odd * even

print(int(ans))

Submission status: Accepted

Solution code:
s = int(input())

a = s % 2

if a == 0:
    K = s / 2
    print( int(K ** 2) )
else:
    L = (s-1) / 2
    x = int((L + 1) * L)
    print(x)

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

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

import math


def solve1(N):
    n1 = N//2
    n2 = N - n1
    return n1*n2

print(solve1(N))

Submission status: Accepted

Solution code:
k = int(input())
ki, gu = 0, 0
for x in range(1, k+1):
    if x % 2 == 0:
        gu += 1
    else:
        ki += 1
print(ki * gu)

Submission status: Accepted

Solution code:
K = int(input().strip())

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

Submission status: Accepted

Solution code:
k = [i for i in range(1, int(input()) + 1)]

odd = k[1::2]
even = k[0::2]

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

Submission status: Accepted

Solution code:
K = int(input())

a = [i for i in range(1,K+1)]

odd = list( filter(lambda x: x % 2 == 1, a) )
even = list ( filter(lambda x: x % 2 == 0, a) )

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Q1

K = int(input().strip())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
# coding: utf-8

from math import ceil

k = int(input())

print(k // 2 * ceil(k / 2))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

i = x // 2
j = (x - 1) // 2 + 1

print(i * j)

Submission status: Accepted

Solution code:
K=int(input())
x=K//2
if K&1:
    print(-~x*x)
else:
    print(x*x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

K = int(input())

o = math.ceil(K/2)
e = math.floor(K/2)

print(o*e)

Submission status: Accepted

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

print(m())

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:
# coding: utf-8
# Your code here!
K=int(input())
if K%2==1:
    print((int(K/2))*(int(K/2)+1))
else:
    print(int(K*K/4))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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())
sum = 0

for i in range(1,k+1):
    if i % 2 == 0:
        for x in range(1,k+1):
            if x % 2 == 1:
                sum += 1

print(sum)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

K = int(input())
odd, even = math.ceil(K/2), math.floor(K/2)
print(odd * even)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a = int(input())

if a % 2 == 0:
    # a以下の偶数の数
    even_num = a / 2
    odd_num = a / 2
else:
    even_num = (a - 1) / 2
    odd_num = (a - 1) / 2 + 1

ans = even_num * odd_num
print(int(ans))

Submission status: Accepted

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

f = 0
for ax in range(a):
   for bx in range(a):
       if ((ax + 1)% 2 == 0) and ((bx + 1)% 2 == 1):
           f = f+1
print(f)

Submission status: Accepted

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

print(Ans)

Submission status: Accepted

Solution code:
#python3
K = int(input())
#most primitive way
evens = 0
odds = 0
for i in range(1,K+1):
    if i%2==0:
        evens+=1
    else:
        odds+=1
print(evens*odds)

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

Solution code:
# nums = [int(num) for num in input().split()]
from math import  floor, ceil
num = int(input())
if num %2==0:
    print(int(num/2)*int(num/2))
else:
    print(int(ceil(num/2)*floor(num/2)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    K = int(raw_input())
    odd = 0
    even = 0
    for i in range(1, K+1):
        if i % 2 == 0:
            even += 1
        else:
            odd += 1
    print even * odd

main()

Submission status: Accepted

Solution code:
K = int(input())

num_odd = K // 2 if K % 2 == 0 else K // 2 + 1
num_even = K // 2

print(num_odd * num_even)

Submission status: Accepted

Solution code:
k = int(input())

ans = 0
for i in range(k):
    if i % 2 == 1:
        e = False
    else:
        e = True

    for j in range(i + 1, k):
        if e and j % 2 == 1:
            ans += 1
        elif not e and j % 2 == 0:
            ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

Solution code:

k = int(input())

res = 0

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

print(int(res))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    k = int(input())
    count = 0
    for i in range(1, k+1):
        for j in range(1, k+1):
            if (i % 2 == 0 and j % 2 == 1 and i != j):
                count += 1


    print(count)