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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

K = int(input())

if K % 2 == 0:
    print((K / 2) ** 2)
else:
    print(int(math.floor(K / 2.0) * math.ceil(K / 2.0)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())
print(k, k-1)

Submission status: Wrong Answer

Solution code:
a = int(input())

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

print(c)

Submission status: Wrong Answer

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: Wrong Answer

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

print(A)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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(g*k)

Submission status: Wrong Answer

Solution code:
k = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math;

K = int(input());

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())

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

Submission status: Wrong Answer

Solution code:
k = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
na = lambda: list(map(int, input().split()))
k = int(input())
if k % 2 == 0: print((k//2)**2)
else: print((k//2)*(k//2)+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=int(input())

e=k//2
o=(k+1)//2

print(e*o)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
odd = list()
even = list()

for i in range(n):
    if i % 2 == 0:
        even.append(i)
    elif i % 2 != 0:
        odd.append(i)

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

Solution code:
from itertools import combinations


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

    ans = 0
    for a, b in (list(combinations(range(1, n+1), 2))):
        if (a%2==0 and b%2 != 0) or (b%2==0 and a%2!=0):
            ans += 1

    print(ans)


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
print((n//2)*(n-n//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:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    K = I()
    a = K // 2
    b = K - a
    print(a*b)

main()

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = int(input())

even_count = num // 2

if num % 2 == 0:
    odd_count = even_count
else:
    odd_count = even_count + 1

print(odd_count * even_count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(odd * even)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

    x = K // 2
    y = (K + 1) // 2

    print(x * y)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    k = int(input())
    if k % 2 == 0:
        even = k // 2
        odd = even
    else:
        even = k // 2
        odd = k - even

    print(even * odd)


if __name__ == "__main__":
    main()

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

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

print(cnt)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
k = int(input())

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

print(int(ans))

Submission status: Accepted

Solution code:
import sys
def I(): return int(sys.stdin.readline().rstrip())


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

K = int(sys.stdin.readline())
print((K - K // 2) * (K // 2))

Submission status: Accepted

Solution code:
K = int(input())

cnt= 0
for i in range(K, 1, -1):
    for _ in range(i-1, 0, -2):
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
K = int(input())

e_n = K // 2
o_n = K - e_n

print(e_n * o_n)

Submission status: Accepted

Solution code:
K=int(input())
sum=0
i=1
while i<=K:
    i+=2
    j=2
    while j<=K:
        j+=2
        sum+=1
print(sum)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=int(input())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

n = inp()
print(n//2 * ((n+1)//2))

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))  #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())  #空白あり
def LS2(): return list(sys.stdin.readline().rstrip())  #空白なし


K = I()
a = K//2
b = K-a
print(a*b)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

print((K>>1)*((K+1)>>1))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
import sys 

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
m = n % 2
o = n //2

if m ==1:
    print(o*(o+1))
else:
    print(o*o)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())
s = 0
for x in range(1, k + 1):
  for y in range(1, k + 1):
    if y % 2 == 1 and x % 2 == 0:
      s = s + 1
print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(odd*even)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(res)

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

print(even*odd)

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

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

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

for i in range(k + 1)[1:]:
  if i % 2 == 0:
    even += 1
  elif i % 2 == 1:
    odd += 1
print(odd * even)

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]

K = int(input())
ans = 0
for i in range(1, K+1):
    for j in range(i+1, K+1):
        if (i % 2 == 0 and j % 2 != 0):
            ans += 1
        elif (i % 2 != 0 and j % 2 == 0):
            ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout


def main():
    line = stdin.readline()
    parts = line.split()
    a = int(parts[0])

    even = int(a/2)
    odd = a - even
    rta = even * odd
    stdout.write(str(rta))


main()

Submission status: Accepted

Solution code:
from sys import stdin,stdout

def main():
    line=stdin.readline()
    parts=line.split()
    a=int(parts[0])
    par=int(a/2)
    impar=int(a/2)+a%2
    stdout.write(str(par*impar))
main()

Submission status: Accepted

Solution code:
from sys import stdin, stdout

def main():
    line = stdin.readline()
    parts = line.split()
    par = int(int(parts[0])/2)
    impar = int(int(parts[0])/2) + int(parts[0])%2

    stdout.write(str(par * impar))

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k=int(input())

num=k//2

if k%2==0:
    print(num**2)

else:
    print(num*(num+1))

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

k = inp()
print((k//2) * (k//2 + k%2))

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


stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

g = K // 2

k = K // 2
if K % 2 != 0:
    k += 1

print(g * k)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

Solution code:
K = int(input())

a = K // 2 # 偶数の数
b = a + 1 if K % 2 != 0 else a

print(a * b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
k = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

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

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

Submission status: Accepted

Solution code:
K = int(input())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def I(): return int(sys.stdin.readline().rstrip())

K = I()
print((K//2)**2 if K % 2 == 0 else (K**2-1)//4)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
K = int(input())

import math
n_even = math.floor(K/2)
n_odd = math.ceil(K/2)

print(n_even * n_odd)

Submission status: Accepted

Solution code:
K = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
	n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(int(ans))

Submission status: Accepted

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

k = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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