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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K=int(input())

X=K//2
Y=K%2
print(X**2 if Y==0 else X**2+X)

Submission status: Accepted

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

even_list = []
odd_list = []

is_odd = True
for i in range(1, k + 1):
    if is_odd:
        odd_list.append(i)
    else:
        even_list.append(i)
    is_odd = not is_odd

print(int(len(even_list) * len(odd_list)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys
import queue
from collections import Counter
from itertools import accumulate
from fractions import gcd
from functools import reduce


def lcm(a, b):
    return a * b // gcd(a, b)

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

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

sys.setrecursionlimit(10000)

mod = 1000000007

"""
# 0埋め, 小数点出力桁指定時のときの出力
a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654

# 文字列をリストに格納
char_list = list("abcd") # ["a","b","c","d"]

# 標準入力取得
## 文字列
    = sys.stdin.readline().rstrip()
    = list(sys.stdin.readline().rstrip())

## 数値
    = int(sys.stdin.readline())
    = map(int, sys.stdin.readline().split())
    = list(map(int, sys.stdin.readline().split()))
    = [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

if __name__ == "__main__":
    K = int(sys.stdin.readline())
    o = K // 2
    e = K - o
    print(o * e)

Submission status: Accepted

Solution code:
import math
import sys
import queue
from collections import Counter
from itertools import accumulate
from fractions import gcd
from functools import reduce


def lcm(a, b):
    return a * b // gcd(a, b)

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

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

sys.setrecursionlimit(10000)

mod = 1000000007

"""
# 0埋め, 小数点出力桁指定時のときの出力
a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654

# 文字列をリストに格納
char_list = list("abcd") # ["a","b","c","d"]

# 標準入力取得
## 文字列
    = sys.stdin.readline().rstrip()
    = list(sys.stdin.readline().rstrip())

## 数値
    = int(sys.stdin.readline())
    = map(int, sys.stdin.readline().split())
    = list(map(int, sys.stdin.readline().split()))
    = [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

if __name__ == "__main__":
    K = int(sys.stdin.readline())
    ans = 0
    for i in range(1, K + 1):
        for j in range(i + 1, K + 1):
            if i % 2 == 0:
                if j % 2 != 0:
                    ans += 1
            else:
                if j % 2 == 0:
                    ans += 1
    print(ans)

Submission status: Accepted

Solution code:
k = int(input())
cnt_odd = 0
cnt_even = 0
if k&1:
    while k >= 1:
        cnt_odd += 1
        k -= 2
    cnt_even = cnt_odd - 1
else:
    while k > 0:
        cnt_even += 1
        k -= 2
    cnt_odd = cnt_even

print(cnt_even * cnt_odd)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())


K_1 = K//2
K_2 = K-K_1

print(K_1*K_2)

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

K = INT()

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

Submission status: Accepted

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

Submission status: Accepted

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

    even = K // 2
    odd = K - even

    print(even * odd)

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

n = int(input())

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

Submission status: Accepted

Solution code:
n = int(input())
g = []
k = []

for i in range(1,n+1):
    if i%2 == 0:
        g.append(i)
    else:
        k.append(i)

print(len(g)*len(k))

Submission status: Accepted

Solution code:
k=int(input())
ev=list(range(1,k+1))[1::2]
od=list(range(1,k+1))[0::2]
print(len(ev)*len(od))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():
    n = int(input())
    e = [i for i in range(1, n + 1) if i % 2 == 0]
    o = [i for i in range(1, n + 1) if i % 2 == 1]
    return len(e) * len(o)


if __name__ == "__main__":
    print(solve())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=int(input())
a=list(range(1,k+1))
a1=a[0::2]
a2=a[1::2]
print(len(a1)*len(a2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

odd = K // 2
even = K // 2 + K % 2
print(odd*even)

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

print([(k//2)*(k//2),(k//2)*(k//2+1)][k%2==1])

Submission status: Accepted

Solution code:
K=int(input())

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

Submission status: Accepted

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


if __name__ == "__main__":
    test()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

# inputList=[]
# for i in range(6):
#     inputNum = input()
#     inputList.append(inputNum)
inputa = input().split()
# inputb = input().split()

# inputa = [int(n) for n in inputa]
# inputa.sort()

a = int(inputa[0])
# b = int(inputa[1])
# c = int(inputa[2])

# x = int(inputb[0])
# y = int(inputb[1])

odd =  int(math.floor((a+1) / 2))
even = int(math.floor(a / 2))

ans = odd * even
print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

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

if x%2 == 0:
  t = x/2
  print(math.ceil(t**2))
else:
  p = (x-1)/2
  q = (x+1)/2
  print(math.ceil(p*q))

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

num_even = K // 2
num_odds = K - K // 2

print(num_even * num_odds)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
k = int(input())

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

print(ans)

Submission status: Accepted

Solution code:
k=list(range(1,int(input())+1))
print(sum([len(k[i::2]) for i in k]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(e*o)

Submission status: Accepted

Solution code:
import scipy.misc as scm
N = int(input())

e = N //2
if N %2 == 0:
  print(scm.comb(e, 1, 1)*scm.comb(e, 1, 1))
else:
  print(scm.comb(e, 1, 1)*scm.comb(e+1, 1, 1))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

K = int(input())
A = K // 2
K -= A
print(K * A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#list(map(int,input().split()))
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:
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())
count_even = 0
count_odd = 0

for i in range(1, a + 1):
    if i % 2 == 0:
        count_even += 1
    else:
        count_odd += 1

print(count_even * count_odd)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from operator import itemgetter

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

if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
k = int( input() )

num = 0

for i in range(k, 0, -1):
  for j in range(i-1, 0, -2):
    num += 1
    #print( '{0},{1}'.format(i, j) )
    
    
print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K=int(input())

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

Submission status: Accepted

Solution code:
from functools import reduce
import math

def main():
    # 文字列の2進数を数値にする
    # '101' → '5'
    # 文字列の頭に'0b'をつけてint()にわたす
    # binary = int('0b'+'101',0)

    # 2進数で立っているbitを数える
    # 101(0x5) → 2
    # cnt_bit = bin(5).count('1')
    
    # N! を求める
    # f = math.factorial(N)

    # N の逆元
    # N_inv = pow(N,MOD-2,MOD)

    # nCr
    # Nの階乗 * rの階乗の逆元 * n-rの階乗の逆元
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    INF = float("inf")

    # 大きな素数
    MOD = 10**9+7
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    a = int(input())
    if a %2 ==1:        
        print((a//2) *(a//2 +1))
    else:
        print((a//2) * (a//2))
    
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    half = int(N/2)

    if N % 2  == 0:
        print(half*half)
    else:
        print(half*(half+1))


if __name__ == '__main__' :
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#108 Pair

K = int(input())

num = 0
for i in range(K):
    num += (K-i)//2
print(num)

Submission status: Accepted

Solution code:
K = int(input())

if K%2==0:
    e = K//2
    o = K//2
else:
    e = K//2
    o = K//2 + 1

print(e*o)

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

Submission status: Accepted

Solution code:


def main():

    N = int(input())

    if N%2==0:
        l = int(N/2)
        print(l*l)
    else:
        l = int(N/2)
        r = l+1
        print(l*r)


        
    
if __name__== "__main__":
    main()

Submission status: Accepted

Solution code:
words = lambda t : list(map(t, input().split()))
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((K // 2) ** 2)
else:
  print(K // 2 * (K // 2 + 1))

Submission status: Accepted

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

result = even_num * odd_num
print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
K = int(input())
answer = 0
for k in range(K):
  for l in range(k):
    if (k + l) % 2 == 1:
      answer += 1
print(answer)

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

Submission status: Accepted

Solution code:
K = int(input())

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

even = K // 2

print(odd * even)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

K = int(input())

# print(K)

# print(K // 2)
# print(K % 2)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
"""
1 以上 K 以下の偶数は K//2 個なので、K // 2 * (K - K // 2) が答えになる。
"""

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
K = int(input())
if K % 2 == 0: #奇数：K/2個 偶数：K/2個
    print(int((K/2) * (K/2)))
if K % 2 == 1: #奇数：(K+1)/2個 偶数：(K-1)/2個
    print(int(((K+1)/2) * ((K-1)/2)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import itertools

K = list(range(1,int(input())+1))
c = list(itertools.combinations(K, 2))
count = 0

for i in c:
  
  #print(i[0]%,i[1])
  if i[0]%2==0 and i[1]%2==1 or i[0]%2==1 and i[1]%2==0:
    count+=1
    

print(count)

Submission status: Accepted

Solution code:
n=int(input())

x=n//2
y=n-x

print(x*y)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

Solution code:
N = int(input())

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

#B
def B():
    x1, y1, x2, y2 = LI()
    a = x2 - x1
    b = y2 - y1
    print(x2 - b, y2 + a, x1 - b, y1 + a)
    return

#C
def C():
    n, k = LI()
    if k % 2:
        print((n // k)** 3)
    else:
        print(int((n//k)**3 + ((n-k/2)//k+1)**3))
        
    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__':
    A()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

odd = (n + 1) // 2
even = n // 2
print(odd * even)

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)
B=int(K-A)

print(A*B)

Submission status: Accepted

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

Submission status: Accepted

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

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

cnt = 0
for i in range(1, k + 1):
    for j in range(i + 1, k + 1, 2):
        # print(i, j)
        cnt += 1
print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#a, b = map(int,input().split())
#ls = list(map(int,input().split()))
n = int(input())
#s = input()

odd = (n+1)//2
even = n//2
print(odd*even)

Submission status: Accepted

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

Submission status: Accepted

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

resolve()

Submission status: Accepted

Solution code:
K = int(input())

even = K//2
odd = K-even

print(even*odd)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

# input
K = int(input())

# solve
even = 0
odd = 0

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

# output
print(even * odd)

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

K = int(input())
counter = 0

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

print (counter)

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

Submission status: Accepted

Solution code:
K = int(input())
odds = []
evens = []
for x in range(K):
  x+=1
  if x%2 == 0:
    evens.append(x)
  else:
    odds.append(x)
print(len(evens)*len(odds))

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

K = n()
k = K // 2

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

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:
print(int(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//2+n%2))

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

even = K // 2
odd = K // 2
if K % 2:
    odd = K // 2 + 1

print(even * odd)

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# INPUT
k = int(input())

# PROCESS
answer = 0
if(k%2==0):
  answer = k/2*k/2
else:
  answer = (k-1)/2*((k-1)/2+1)

# OUTPUT
print(int(answer))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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