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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k=int(input())

num=2//k

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if K == 2:
    count = 1

elif K == 3:
    count = 2

elif K > 3:
    while i < K:
        i += 1
        j = i + 1

        while j <= K:
            
            count += 1
            
            j += 2
            print(count)

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())

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

Submission status: Wrong Answer

Solution code:
k = int(input())

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

Submission status: Wrong Answer

Solution code:
def actual(k):
    x, y = divmod(k, 2)
    
    return int(x * y)

k = int(input())
print(actual(k))

Submission status: Wrong Answer

Solution code:
k = int(input())

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

print(int(num))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

k=int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

if __name__ == '__main__':

    ABC_108_A()

Submission status: Wrong Answer

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

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

if __name__ == '__main__':

    ABC_108_A()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

K = int(input())

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

Submission status: Wrong Answer

Solution code:
import math
a=int(input())
print(math.floor(a)*math.ceil(a))

Submission status: Wrong Answer

Solution code:
n=int(input())
if n%2==0:
  print('{:.0f}'.format((n/2)**2/2))
else:
  print('{:.0f}'.format((n+1)/2*(n-1)/2/2))

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    a = [int(i) for i in input().split()]

    if a[0] %2 ==1:
        print((a[0]//2)*(a[0]//2-1))
    else:
        print((a[0]//2)*(a[0]//2))

Submission status: Wrong Answer

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

def lcm(x, y):
    return (x * y) // math.gcd(x, y)

if __name__ == '__main__':
    a = [int(i) for i in input().split()]

    if a[0] %2 ==1:
        print(a[0]*(a[0]-1))
    else:
        print(a[0]*(a[0]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#abc108 a
k=int(input())
ans=0
for i in range(2,k+1):
    for j in range(2,k+1):
        if i%2==0 and j%2==1:
            ans+=1
print(ans)

Submission status: Wrong Answer

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

if k % 2 == 0:
    print(t)
else:
    print(round(t))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
K = input()
def myfunc(K):
  count = 0
  for i in range(1, K+1):
    if i%2==0:
      # print(i)
      for i in range(1, K+1):
          if i%2==1:
              # print(" ", i)
              count +=1
  print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k=int(input())

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

Submission status: Wrong Answer

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n=INT()
    if n%2==0:
        print(n*n/4)
    else:
        print((n//2)*(n//2+1))
if __name__ == '__main__':
    do()

Submission status: Wrong Answer

Solution code:
from math import log2
L=int(input())
ans=[]
i=1
while True:
    if 2**i>L:
        last=i
        break
    ans.append([i,i+1,2**(i-1)])
    ans.append([i,i+1,0])
    i+=1
"""for i in ans:
    print(i)
print(last)"""
num=2**(last-1)
a=L-num
while a>0:
    ans.append([int(log2(a))+1,last,num])
    num+=2**(int(log2(a)))
    a=L-num
for i in ans:
    print(*i)

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())

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

Submission status: Wrong Answer

Solution code:
from math import ceil

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())

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

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
import bisect
from itertools import groupby
 
n = int(stdin.readline().rstrip())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

    output = [[a, b] for a in even
              for b in odd]
    print(output)

Submission status: Wrong Answer

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

output = [[a, b] for a in even
          for b in odd ]
print(output)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# Python implementation of the above approach 
N = 6
  
 # number of even numbers 
Even = N//2
  
# number of odd numbers 
Odd = N-Even  
print(Even * Odd)

Submission status: Wrong Answer

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


pair()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(even*odd)

Submission status: Wrong Answer

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

print(even*odd)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys


l = int(input())

if l > 262144:
    print('-1')
    sys.exit()


t = 0
while l > 2**t:
    t += 1
print(t, t+2, 0)
print(t, t+1, 0)
print(t+1, t+2, 1)
if t >= 2:
    for i in range(1, t):
        if i == 1:
            print(i, i+1, 0)
        else:
            print(i, i+1, 0)
            print(i, i+1, 2**(t-i))
bin_str = format(l-2**(t-1), '0' + str(t) + 'b')

list = [2**(w-1) for w in range(t, 0, -1)]
p = 0
c = 0

for j in range(len(str(bin_str))):
    if str(bin_str[j]) == '1':
        if j == 0:
            print(1, 2, 2**(t-1))
        else:
            c += list[p]
            p = j
            print(1, j+2, c)

Submission status: Wrong Answer

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

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
#2019/10/04
K = int(open(0).read())
print(K if K==2 else int((K//2)**2) if K%2==0 else int((K//2)*(-(-K//2))))

Submission status: Wrong Answer

Solution code:
#2019/10/04
K = int(open(0).read())
print(K if K==2 or K==1 else int((K/2)**2) if K%2==0 else int((K//2)*(-(-K//2))))

Submission status: Wrong Answer

Solution code:
#2019/10/04
K = int(open(0).read())
print(2 if K == 2 else int((K/2)**2) if K%2==0 else int((K//2)*(-(-K//2))))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
K = int(input())

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

Solution code:
n = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

if K % 2 == 0:
    S = K / 2
else:
    S = (K - 1) / 2

X = S * (K - S)

print(X)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())

if N % 2 == 0:
  print(int(N/2)^2)
else:
  a = ((N-1) / 2)
  b = N - a
  print(int(a*b))

Submission status: Wrong Answer

Solution code:
N = int(input())

if N % 2 == 0:
  print(int(N/2)^2)
else:
  print( (N - 1) * N)

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
k = int(input())

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

Submission status: Wrong Answer

Solution code:
k = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#list(map(int,input().split()))
k = int(input())
even = k//2
odd = k//2 + 1
print(even * odd)

Submission status: Wrong Answer

Solution code:
k = int(input())

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Solution code:
K=int(input())

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

Submission status: Wrong Answer

Solution code:
K=int(input())

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

Submission status: Wrong Answer

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)