TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: 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.

Submission attempts (in order):
K = int(input())

even = K // 2
odd = 1 - even

print(even * odd)

K = int(input())

even = K // 2
odd = K - even

print(even * odd)


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())
ans = 0
if k % 2 == 0:
    ans = (k / 2) ** 2
else:
    ans = ((k - 1) / 2) * ((k - 1) / 2 + 1)
print(ans)

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

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


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
K = int(input())
print((K//2)*((K-1)//2)/2)

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


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

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

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
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()

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
k = (int(input())
print(( k // 2 ) * ( k - k // 2 ))

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())
if k%2 == 0:
    print((k/2)*(k/2))
else:
    print(((k-1)/2)*((k+1)/2))


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

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


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
# -*- coding: utf-8 -*-
K = int(input())
print((K // 2) ** 2 - K % 2)

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


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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
n=int(input())
if n%2==0:
  print((n/2)**2)
else:
  print(int(n/2)*((n+1)/2))

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

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

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

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())
print((k/2)**2 if k%2==0 else ((k+1)/2)*((k+1)/2-1))

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

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
K = int(input.strip())
num1 = K // 2
num2 = K - num1
print(num1 * num2)

K = int(input().strip())
num1 = K // 2
num2 = K - num1
print(num1 * num2)

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
#coding:utf-8
k = int(input())
print((k/2) * ((k+1)/2))

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())
print(int((k/2)**2)) if k%2 == 0 else print(int(k/2)**2 - 1/4))


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


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
a = int(input())

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

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
k = input()
if k % 2 == 1:
    print(k//2 * (k//2+1))
else:
    print(k//2 * k//2)


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


k = map(int, input().split())
if k%2==1:
  print((k//2) * (k//2+1))
else:
  print((k//2) * (k//2))


k = map(int, input().split())
if k%2==1:
  print((k//2) * (l//2+1))
else:
  print((k//2) *(k//2))

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


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
n=int(input())
a=n//2+1
b=n/2
print(a*b)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())
if k%2 == 0:
    print((k**2)/4)
else:
    print(((k-1)/2)*((k+1)/2))

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())
if k % 2 == 0:
    print((k//2)**2)
else:
    print((k//2-1)(k//2))


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


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
import math
instr = intput()
K = int(instr)

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

ans = COdd * CEven
print(ans)

import math
instr = input()
K = int(instr)

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

ans = COdd * CEven
print(ans)

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
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)))


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


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


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import math

k = int(input())

if k%2:
    print(math.floor(k/2)*math.cei(k/2))
else:
    print((k/2)*2)

import math

k = 50

if k%2:
    print(math.floor(k/2)*math.ceil(k/2))
else:
    print(int((k/2)**2))

import math

k = int(input())

if k%2:
    print(math.floor(k/2)*math.ceil(k/2))
else:
    print(int((k/2)**2))

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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.

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
#!/usr/bin/env python3
import sys


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


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  # type: int
    solve(K)

if __name__ == '__main__':
    main()


#!/usr/bin/env python3
import sys


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


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    K = int(next(tokens))  # type: int
    solve(K)

if __name__ == '__main__':
    main()


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
K = input()

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

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

K = int(input())

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

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

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
k=int(input())
print((k+1)//2*k//2)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a=int(input());print(a*(a+1)//4)


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

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
x1,y1,x2,y2=map(int,input().split())
print(x2-(y2-y1),y2-(x1-x2),x1-(y2-y1),y1-(x1-x2),end='')

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())
count1 = 0
count2 = 0
for i in range(k):
    if i % 2 == 0:
        count1 += 1
    else:
        count2 += 1
print(count1 * count2

k = int(input())
count1 = 0
count2 = 0
for i in range(k):
    if i % 2 == 0:
        count1 += 1
    else:
        count2 += 1
print(count1 * count2)

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
n=int(input())
print (((n>>1+(1 if n&1 else 0))*(n>>1)))

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
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)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
n = int(input())
print((n//2)**2)


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


Verdicts: Wrong Answer

Accepted
Problem: 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.

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


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


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


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
K = int(input())
ans = 0
for i in range(1,K):
    ans = ans + (i+1)//2
    print(ans)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
N = int(input().split())

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

N = int(input().split())

print("%d"%((N / 2) * ((N + 1) / 2)))

N = int(input().split())
ans = 0
if N%2 == 0:
    ans = (N/2) ** 2
else:
    ans = (N/2) ** 2 - 1/4
print(ans)

N = int(input().split())
ans = 0
if N%2 == 0:
    ans = N/2 ** 2
else:
    ans = (N/2 + 1/2) * (N/2 - 1/2)
print(ans)

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
k=int(input())
if k%2==0:
  ans=k**2
else:
  ans=k*(k+1)

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

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
N, K = map(int, input().split())
ans = 0
for i in range(1,N + 1):
  for j in range(1,N + 1):
    for k in range(1,N + 1):
      if ((i + j) % K == 0) and ((j + k) % K == 0) and ((k + i) % K == 0):
        ans += 1
print(ans)

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
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))

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import math
a=int(input())
if a%2==0:
  print(int(a*a/4))
else:
  print(math.ceil(a)*math.floor(a))

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
K = int(input())

even = K // 2
odd = K - enve
print(even * odd)

K = int(input())

even = K // 2
odd = K - even
print(even * odd)


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
K = int(input())
a = 0
b = 0
for i in (1,K+1):
    if i % 2 == 0:
        a += 1
    else:
        b += 1
print(int(a * b))


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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
n=int(input())
if n%2==0:
  print(k*k//4)
else:
  print((k+1)*(k-1)//4)

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


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


Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
N,K = map(int, input().split())

ans = int(N/K) ** 3
if K%2 == 0:
    ans += int(N/int(K/2) - int(N/K)) ** 3
    
print(ans)


N = int(input())

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

print(int(ans))

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())
print((k//2)*((k+1)//2)


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


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())
if k %2 == 0:
	print(int(k*k/2/2)
elif k%2 ==1:
          print(int((k/2)*(k//2)/2)


k = int(input())

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




else:
  print(int((k/2)*(k//2)/2)

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


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


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
k = input()

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

k = input()

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

k = int(input())

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
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))


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


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


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())

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

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

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

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

Verdicts: Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
K = int(input())
if K % 2 == 1:
    ans = ((K-1)/2)*((K+1)/2)
else:
    ans = K*K*(1/4)
print(ans)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
N, K = map(int, input().split())
div = N // K
if K % 2 == 1:
    print(div**3)
else:
    if div * N + K // 2 <= N:
        print(div**3 + (div + 1)**3)
    else:
        print(2 * div**3)

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

print(answer)

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())
if k%2==0:
    ans = (k/2)*(k/2)
else:
    ans = (k/2)*(k/2-1)
print(int(ans))

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
k = input()

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


k = input()

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


k = int(input())

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


k = int(input())


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


Verdicts: Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
def actual(k):
    x, y = divmod(k, 2)
    
    return int(x * y)

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


def actual(k):
    n_even = k // 2
    n_odd = (k + 1) // 2

    return n_even * n_odd

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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())
if k % 2 == 0:
    print((k//2)**2)
else:
    print(k//2 * (k//2-1))


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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
K = input()

kisu = K/2
gusu = (K+1)/2

print(kisu * gusu)

K = input()

gusu = int(int(K) / 2)
kisu = int((int(K)+1) / 2)

print(int(kisu * gusu))


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
n = int(input())
if n % 2 == 0:
    print((n/2)**2)
else:
    print(((n-1)/2)*((n+1)/2))

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
from math import ceil

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

from math import ceil

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
k=int(input())
if k%2==0:
  print((n//2)**2)
else:
  print((n**2-1)//4)

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

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

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
N=int(input())

print((N//2)**2 if N//2==0 else N*(N-1))

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import math
k=int(input())
print((k//2)*(math.ceil(k//2)))


import math
k=int(input())
print((k//2)*(math.celi(k//2)))


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


Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
N=int(input("enter number")) 
Counter1=0
Counter2=0
for i in range(N) :
    if i%2==0:
        Counter1+=1 
    if i%2==1:
        Counter2+=1 
Print(Counter1*Counter2)

team=input()
x=team[0]
flag=0
d=0
for i in range(len(team))
   if team[i]==x:
       flag+=1
   else:
        x=team[i]
        flag=0
   if flag==7:
       print("yes")
       d=1
       break
if d=0:
    print("no")

        
        
       


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

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

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

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

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


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)

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
K = int(input())
print( K ** 2 // 4) if K % 2 == 0 else ((K -1)*(K+1)//4)


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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
K = int(input())
print(K//2 * K//2)

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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
K = int(input())

if K%2 == 0:
  even_num = odd_num = K/2
eles:
  even_num = K/2
  odd_num = even_num + 1

print(even_num * odd_num)

K = int(input())

if K%2 == 0:
  even_num = odd_num = K/2
else:
  even_num = K/2
  odd_num = even_num + 1

print(even_num * odd_num)

K = int(input())

if K%2 == 0:
  even_num = odd_num = K//2
else:
  even_num = K//2
  odd_num = even_num + 1

print(even_num * odd_num)

Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import math
n = int(input())
print(math.ceil(n/2)*n//2)

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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a = int(input())
if a % 2 == 0:
  print(int(a/2 **2))
else:
  print(int((a+1)/2 ** 2 -(a+1)))

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())

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

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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())
print(k // 2 - -k // 2)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
k=input()
x=k//2
if k%2==0:
  print(2*x*x)
else:
  print((2*x+1)*x)

x = int(input())
y = x // 2
print(y*(x-y))

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
n = (int)(input())
l_o = [v for v in range(1,n+1,2)]
l_e = [v for v in range(2,n+1,2)]
return (len(l_o)*len(l_e))

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


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
def calcPairOddAndEven(num):
    if num % 2 == 0:
        return int((num / 2))**2
    else:
        return int((num / 2)*num)


def main():
    numArray = [3, 6, 11, 50]
    for num in numArray:
        print(num, ":", calcPairOddAndEven(num))


def contest():
    print(calcPairOddAndEven(int(input())))

if __name__ == '__main__':
    contest()

def calcPairOddAndEven(num):
    if num % 2 == 0:
        return int((num / 2))**2
    else:
        return int(num / 2)*int(num / 2 + 1)


def main():
    numArray = [3, 6, 11, 50]
    for num in numArray:
        print(num, ":", calcPairOddAndEven(num))


def contest():
    print(calcPairOddAndEven(int(input())))

if __name__ == '__main__':
    main()

def calcPairOddAndEven(num):
    if num % 2 == 0:
        return int((num / 2))**2
    else:
        return int((num / 2)*num)


def main():
    numArray = [3, 6, 11, 50]
    for num in numArray:
        print(num, ":", calcPairOddAndEven(num))


def contest():
    print(calcPairOddAndEven(int(input()))

if __name__ == '__main__':
    contest()

def calcPairOddAndEven(num):
    if num % 2 == 0:
        return int((num / 2))**2
    else:
        return int(num / 2)*int(num / 2 + 1)


def main():
    numArray = [3, 6, 11, 50]
    for num in numArray:
        print(num, ":", calcPairOddAndEven(num))


def contest():
    print(calcPairOddAndEven(int(input())))

if __name__ == '__main__':
    contest()

Verdicts: Wrong Answer

Wrong Answer

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
n=int(input())
if n % 2 == 0:
  temp = int(n/2)
  print(temp ** 2)
elif:
  temp = n//2
  print(temp*(temp+1))

print(int(input()**2>>2)

print(int(input())**2>>2)

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
K = int(input())
if K%2 == 1:
    print(K*K-K)
else:
    print(K**2/4)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
print(int((int(input()/2))**2))

print(int((int(input()/2))**2))


a=int(input())
print(a*(a-1))

a=int(input());x=n//2;print((n-x)*x)

n=int(input());print(int((n//2)**2))

print(int(input())**2//4)

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
n=int(input())
if(n%2==0):
  k=n*n/4
else:
  k=(int(n)*(int(n)+1)/4)
print(k)

a,b,c,d=map(int,input().split())
e=c-a
f=d-b
g=c-f
h=d+e
i=g-e
j=h-f
print(g)
print(h)
print(i)
print(j)

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

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
K = int(input())
print(((K+(K%2))//2)**2)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())
print(k//2 ** 2) if k % 2 == 0 else pritn(k//2 * (k//2 + 1))

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


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())

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

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

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
K = int(input())

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

print(ak)

K = int(input)

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

print(ak)

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

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
n=int(input())
print(n//2*(1-n//2)/2)

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

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
import math
a=int(input())
print(math.floor(a)*math.ceil(a))

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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
a,b=map(int,input().split())
print((a//2)*((a+1)//2))

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())
if k % 2 == 0 :
    print((k//2) ** 2)
else :
    print((k//2) * (k//2 - 1))


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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
K=int(input())
print(int((K/2)*((K+1)/2)))

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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
K=int(input())
print(((K/2)/2)*((K+1)/2))

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

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
print(int(input())**2//2/2)

print(int(int(input())**2//2/2))

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
K = int(input())
if K % 2 == 0:
    print(int(K/2))
else:
    print(int((K-1)/2))

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
K=int(input())
print(K//2*(K//2+k%2))

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
K=int(input()//2**2)

K=int(input()**2//4)

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

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

K=(int(input())**2//4)

K=int(input())**2>>2

print(int(input())**2//4)

Verdicts: Runtime Error

Runtime Error

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
x1, y1, x2, y2 = map(int, input().split())
 
x3 = x2 + (y1 - y2)
y3 = y2 - (x1 - x2)
x4 = x3 + (x1 - x2)
y4 = y3 + (y1 - y2)
 
print(x3, y3, x4, y4)

a = int(input())

oddl = []
evenl = []

for i in range(a):
    if i%2 == 1:
        oddl.append(i)
    else:
        evenl.append(i)

odd = len(oddl)
even = len(evenl)

print(odd*even)

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
N = int(input())

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


N = int(input())

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


Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
N = int(input())

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


N = int(input())

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


N = int(input())

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


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


Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
k=int(input())
if k%2==0:
    print((k/2)**2)
else:
    print((k-(k+1)/2)*((k+1)/2))

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
x=int(input())
print((x//2)**2) if x%2==0 else (x//2)*(x//2+1)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
k=int(input())
print((k+1)//2*k//2)

k=int(input())
cnt=1
for i in range(3,k+1):
  cnt+=i//2
print(cnt)

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
n = int(input())

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

n = int(input())

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

n = int(input())

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

n = int(input())

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

import math
n = int(input())

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

n = int(input())

e = n//2
o = n-e

print(e*o)

Verdicts: Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
K=int(input())
if K%2==0:
  print((K/2)^2)
else:
  print(((K+1)/2)*((K-1)/2))

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

Verdicts: Runtime Error

Accepted
Problem: 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.

Submission attempts (in order):
k = int(input())
n = k // 2
if k % 2 == 0:
    print(n*n)
else:
    print((n-1)*n)

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


Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
K = int(input())
out= 0
if K%2 == 0:
    out = (K/2)**2
else:
    out =((K-1)/2)*((K+1)/2)
print(out)

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
k=int(input())

num=2//k

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

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

k=int(input())

num=k//2

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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.

Submission attempts (in order):
K=int(input())
if K%2==0:
    m=(K/2)**2
else:
    m=((K-1)/2)*(((K-1)/2)+1)
print(m)

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


Verdicts: Wrong Answer

Accepted