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

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

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

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

m=k//2

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


k=int(input())

m=k//2

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

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

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

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

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

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

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

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

print(int(k-1)/2**2))

k = int(input())

if k % 2 == 0:
    print(int((k/2)**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):
a,b=map(int,input().split())
if (a*b)%2==0:
    print('No')
else:
    print('Yes')

import math
n=int(input())
print(math.floor(n/2*n/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 numpy as np
import itertools

a = int(input())

odd_list = np.arange(1, a, 2)
even_list = np.arange(2, a, 2)
count = 0
for odd, even in itertools.product(odd_list, even_list):
    count += 1
    
print(count)

import numpy as np
import itertools

a = int(input())

odd_list = np.arange(1, a, 2)
even_list = np.arange(2, a, 2)
count = 0
for odd, even in itertools.product(odd_list, even_list):
    print(odd, even)
    count += 1
    
print(count)

import numpy as np
import itertools

a = int(input())

odd_list = np.arange(1, a+1, 2)
even_list = np.arange(2, a+1, 2)
count = 0
for odd, even in itertools.product(odd_list, even_list):
    #print(odd,even)
    count += 1
    
print(count)

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

a = x2 - x1
b = y2 - y1

x3 = x2 - b
y3 = y2 + a
x4 = x1 - b
y4 = y1 + a

print("{} {} {} {}".format(x3, y3, x4, y4))

K = int(input())
print((K - int(K / 2)) * int(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):
A, B, C, D = (int(i) for i in input().split())
if D > B and A > C:
    E = (C - (D - B))
    F = D - (A - C)
    G = (A - (D - B))
    H = B - (A - C)
    print(E, F, G, H)
elif A > C and B > D:
    E = C + (B - D)
    F = D - (A - C)
    G = A + (B - D)
    H = B - (A - C)
    print(E, F, G, H)
elif B > D and C > A:
    E = (C + (B - D))
    F = D + (C - A)
    G = (A + (B - D))
    H = B + (C - A)
    print(E, F, G, H)
else:
    E = C - (D - B)
    F = D + (C - A)
    G = A - (D - B)
    H = B + (C - A)
    print(E, F, G, H)

N, K = (int(i) for i in input().split())
D = 0
for i in range(1, [N + 1]):
    for j in range(1,[N + 1]):
        A = i + j
        if A % K == 0:
            for j in range(1, [N + 1]):
                for k in range(1, [N + 1]):
                    B = j + k
                    C = i + k
                    if B % K == 0 and C % K == 0:
                        D += 1
print(D)

N, K = (int(i) for i in input().split())
D = 0
for i in range(1, N + 1):
    for j in range(1, N + 1):
        A = i + j
        if A % K == 0:
          for k in range(1, N + 1):
            B = j + k
            C = i + k
            if B % K == 0 and C % K == 0:
              D += 1
print(D)

K = (int(i) for i in input().split())
if K % 2 == 0:
    A = (K / 2) * (K / 2)
    print(A)
else:
    B = ((K / 2) + 1) * (K / 2)
    print(B)

N, K  = (int(i) for i in input().split())
D = 0
for i in range(N + 1):
    for j in range(N + 1):
         A = i + j
         if A % K == 0:
              for j in range(N + 1):
                  for k in range(N + 1):
                      B = j + k
                      C = i + k
                      if B % K = 0 and C % K = 0:
                          D += 1
print(D)

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

Verdicts: Runtime Error

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

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


from math import floor
n = int(input())
ans = 0
if n%2==0:
    ans = (n/2)**2
else:
    ans = (n-1)*(n+1)/4
print(floor(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 = int(input())
if k % 2 == 0:
  print(k**2/4)
else:
  print((k+1)*(k-1)/4)

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

K=int(input())
print((K>>1)*(-(-K>>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):
x,y,z,w = map(int,input().split())
a = z-x
b = w-y
print(str(z-b)+" "+str(w+a)+" "+str(x-b)+" "+str(y+a))

x,y,z,w = map(int,input().split())
a = z-x
b = w-y
print(str(z-b)+" "+str(w+a)+" "+str(x-b)+" "+str(y+a))

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

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

odd_number = K // 2　+ 1
even_number = K // 2

print(odd_number*even_number)


K = map(int, input())

odd_number = K // 2　+ 1
even_number = K // 2

print(odd_number*even_number)


K = int(input())

odd_number = K // 2　+ 1
even_number = K // 2

print(odd_number*even_number)


K = int(input())
if K%2 == 0:
    odd_number = K // 2
elif K%2 == 1:    
    odd_number = K // 2 + 1
even_number = K // 2 

print(odd_number*even_number)

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

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

K = int(input())

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

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

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


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/2),(k/2)*(k/2+1)][k%2==1])

k = int(input())

print([(k//2)*(k//2),(k//2)*(k//2+1)][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):
import math;

K = int(input());

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


import math;

K = int(input());

print(math.floor(K/2)*math.ceil(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+1)>>1*((k+1)>>1-1) if k%2 else k**2>>2)

k = int(input())
print(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):
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) * int(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):
N = int(input())
a = (N - N % 2) * (N + N % 2)/4
print(a)

N = int(intput())

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


N = int(input())
a = int((N - N % 2) * (N + N % 2)/4)
print(a)


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



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

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

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

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

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

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,b =map(int, input().split())
r = 0
for _ in range(2):
    if(a>b):
        r+=a
        a-=1
    else:
        r+=b
        b-=1
print(r)


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

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

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())
a = 0
for i in range(2, n+1, 2): a += n-i
print(a)

n = int(input())
a = 0
for i in range(2, n+1, 2): a += n-i+1
print(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):
import math

K = input()

D = int(K) / 2

f, i = math.modf(D)

if f == 0: 
    answer =  i * i
else: 
    p1 = i
    p2 = i + 1
    answer = p1 * p2

print(answer)


import math

K = input()

D = int(K) / 2

f, i = math.modf(D)

if f == 0: 
    answer =  i * i
else: 
    p1 = i
    p2 = i + 1
    answer = p1 * p2

print(int(answer))


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

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


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

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

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

k = int(input())

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

odd = [0 for i in range(1, K + 1) if i % 2 == 1]
even = [0 for i in range(1, K + 1) if i % 2 == 0]

print(len(odd) * len(event))


K = int(input())

odd = [0 for i in range(1, K + 1) if i % 2 == 1]
even = [0 for i in range(1, K + 1) if i % 2 == 0]

print(len(odd) * len(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):
A = list(map(int, input().split()))

B = A.sort(reverse=True)

print(B[0] - B[2])

A = list(map(int, input().split()))

A.sort(reverse=True)

print(A[0]-A[2])

K = int(input())

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

print(odd*even)

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

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

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


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


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


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


Verdicts: Runtime Error

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

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

print(ans)



k = int(input())

ans = int(k/2) + int((k+1)/2)

print(ans)



k = int(input())

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

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

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

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

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


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


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

print(ans)


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

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

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

if s%2 == 0:
  a = s/2
  b = s/2
else:
  a = s/2
  b = s/2+1

print(a*b)


import math
s = input()
return math.floor(s/2)*math.ceil(s/2)

import math

s = input()

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

import math

s = int(input())

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


kumi = list(range(0,a+1))
l_even = [i for i in kumi if i % 2 == 0 and i != 0]
print(l_even)
# [-4, -2, 0, 2, 4]

l_kisu = [i for i in kumi if i % 2 != 0]
print(l_kisu)

answer = len(l_even) * len(l_kisu)

print(answer)

import sys
K = int(input()) 

kumi = list(range(0,K+1))
l_even = [i for i in kumi if i % 2 == 0 and i != 0]
l_kisu = [i for i in kumi if i % 2 != 0]

answer = len(l_even) * len(l_kisu)

print(answer)

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

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

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

n = int(input())

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

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

import math
k=int(input())
if k%2==0:
  print((k//2)**2)
else:
  a=int(math.floor(k/2))
  print(a*(a+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):
x1, y1, x2, y2 = map(int, input().split())
diff_x, diff_y = x2 - x1, y2 - y1
print(x2 - diff_y, y2 + diff_x, x1 - diff_y, y1 + diff_x)


x1, y1, x2, y2 = map(int, input().split())
diff_x, diff_y = x2 - x1, y2 - y1
print('%s %s %s %s'%(x2 - diff_y, y2 + diff_x, x1 - diff_y, y1 + diff_x))



x1, y1, x2, y2 = map(int, input().split())
diff_x, diff_y = x2 - x1, y2 - y1

x3 = x2	- diff_y
y3 = y2 + diff_x

x4 = x1	- diff_y
y4 = y1 + diff_x


print(x3, y3, x4, y4)


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

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

a=int(input())
c=a//2
if a%2==0:
  print(c**2)
else:
  print(c*(c+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())
odd = 0
for i in range(1, k+1):
  if i%2==0*
  odd += 1
even = k - odd
print(even * odd)

k = int(input())
odd = 0
for i in range(1, k+1):
  if i%2==0:
    odd += 1
even = k - odd
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):
N = int(input())
if K%2==0:
    print(K//2*(K//2-1))
else:
    print(-(-K//2)*((K-1)//2))

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

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

K = input()

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

K = input()

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

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

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

K = int(input())

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

Verdicts: Runtime Error

Runtime Error

Runtime Error

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


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


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

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)
m = K//2
print(m*(K-m))

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

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 get(n):
z=((n//2)*2)-(n-1)//2
if(n%2==0):
return (n//2)*2
elif(n==1):
return 0
else:
return z



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

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):
x1,y1,x2,y2=map(int,input().split())
print(x2-y2+y1,y2+x2-x1,y2-y1+x1,x2-x1+y1)

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

n=int(input())
m=n//2
if n%2==1:
  print(m*(m+1))
else:
  print(m**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_1,y_1,x_2,y_2=tuple(map(int,input().split()))

be=[x_2-x_1,y_2-y_1]
za3=[x_2+(-1)*be[1],y_2+be[0]]
za4=[x_1+(-1)*be[1],y_1+be[0]]

print(za3[0],za3[1],za4[0],za4[1])

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

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


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)

K = int(input())


g =0
k =0

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

print(int(g*k))

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
  A=K*K//4
  print(A)
else:
  B=(K-1)*K//4
  print(B)

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

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

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

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):
#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:
            cnt+=1
print(ans)


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


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

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):
n=int(input());print(n*(n+1)//4)

n=int(input());print(n*(n-1)//4)

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

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

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

even = N // 2
odd = N - even
print(event * odd)

N = int(input())

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

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

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

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

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


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


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


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


Verdicts: 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())
if K%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)

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

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

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

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

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

X = S * (K - S)

print(X)


K = int(input())

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

X = S * (K - S)

print(X)


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

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

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

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):
#!/usr/bin/env python3

K = int(input())

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

#!/usr/bin/env python3

K = int(input())

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

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

k = int(input())

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


k = int(input())

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


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=int(input());print((n+1)//2*n//2)

n=int(input());print((n+1)//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):
K=int(input())

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

K=int(input())

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

K=int(input())
if K%2==0:
  print((K//2)**2)
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):
N=int(input())
A=N/2
B=N%2
C=int(A*(A+B))
print(C)

N=int(input())
A=int(N/2)
B=N%2
C=int(A*(A+B))
print(C)

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

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

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


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


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

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


k=int(input())
a = k // 2
b = k - a
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())
print(K//2+(K+1)//2)

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

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

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

print(num_odd * num_even)

K = int(input())

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

print(num_odd * num_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):
K = int(input())


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


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)


K = int(input())


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


K = int(input())


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


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


k = int(input())

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


K = int(input())

ans=0

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

print(ans)

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)


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


K = int(input())


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


k = int(input())

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


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Wrong Answer

Runtime Error

Wrong Answer

Wrong Answer

Runtime Error

Runtime Error

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

c=0

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

k = int(input())

c=0

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


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):
x_1,y_1,x_2,y_2 = list(map(int,input().split()))

A = x_2 - x_1 
B = y_2 - y_1

print(x_2-B,y_2+A,x_1-B,y_1+A)

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

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

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

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


import math
n = int(input())

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


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

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

k = int(input())

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

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)

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

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

Verdicts: Wrong Answer

Accepted