Problem:


Score : 100 points

Problem Statement

AtCoDeer the deer found two positive integers, a and b.
Determine whether the product of a and b is even or odd.

Constraints

1 ≤ a,b ≤ 10000

a and b are integers.

Input

Input is given from Standard Input in the following format:

a b

Output

If the product is odd, print Odd; if it is even, print Even.

Sample Input 1

3 4

Sample Output 1

Even

As 3 × 4 = 12 is even, print Even.

Sample Input 2

1 21

Sample Output 2

Odd

As 1 × 21 = 21 is odd, print Odd.



Sample input:
3 4


Sample output:
Even

Submission status: Runtime Error

Solution code:
a,b=map(int,[input().split())
if (a*b)%2==0:
    print("Even")
else:
    print("Odd")

Submission status: Runtime Error

Solution code:
a,b=map(int,input() for i in range(2))
if (a*b)%2==0:
    print("Even")
else:
    print("Odd")

Submission status: Runtime Error

Solution code:
T=0
X=1
Y=2
item = input()
tabiji = [[0,0,0]]
for i in range(1, int(item)+1):
    tabiji.append(input().split(' '))

a='Yes'
for i in range(0, len(tabiji)-1):
    time = int(tabiji[i+1][T]) - int(tabiji[i][T])
    dX = int(tabiji[i+1][X]) - int(tabiji[i][X])
    dY = int(tabiji[i+1][Y]) - int(tabiji[i][Y])
    for j in range(time):
        if dX > 0:
            dX -= 1
        elif dX < 0:
            dX += 1
        elif dY > 0:
            dY -= 1
        elif dY < 0:
            dY += 1
        if dX == 0 and dY == 0 and (time - j+1) % 2 == 1:
            a = 'No'
            break
        elif dX == 0 and dY == 0 and (time - j+1) % 2 == 0:
            break
    if dX != 0 or dY != 0:
        a = 'No'

print(a)

Submission status: Runtime Error

Solution code:
a,b=map(int,[input() for i in range(2)])
if (a*b)%2==0:
    print("Even")
else:
    print("Odd")

Submission status: Runtime Error

Solution code:
def blackSum(x,y,x2,y2):
    return bs[y2][x2] - bs[y2][x-1] - bs[y-1][x2] + bs[y-1][x-1]

n,k = [int(i) for i in input().split()]
black = [[0 for i in range(2*k+2)] for j in range(2*k+2)]
for i in range(n):
    xi,yi,ci = list(input().split())
    x = int(xi)%(2*k)
    if ci == "W":
        y = (int(yi) + k)%(2*k)
    else:
        y = int(yi)%(2*k)
    black[y+2][x+2] += 1
bs = [[0 for i in range(2*k+2)] for j in range(2*k+2)]
for i in range(1,2*k+2):
    for j in range(1,2*k+2):
        bs[i][j] = black[i][j] + bs[i-1][j] + bs[i][j-1] - bs[i-1][j-1]
max = 0
#左上の黒の位置を指定する。
for i in range(2,k+2):
    for j in range(2,k+2):
        sum = blackSum(j,i,j+k-1,i+k-1) + \
              blackSum(1,1,j-1,i-1) + \
              blackSum(1,i+k,j-1,2*k+1) + \
              blackSum(j+k,1,2*k+1,i-1) + \
              blackSum(j+k,i+k,2*k+1,2*k+1)
        if sum>max:
            max=sum
print(max)

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
if (a% 2 ==0)or(b% 2 ==0):
    print("Even")
else:
    print("Odd")

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())

if (a% 2 ==0) &  (b% 2 ==0):
    print("Even")
else:
    print("Odd")

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())

if (b*a) % 2 ==0:
    print("Even")
else:
    print("Odd")

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())

if b*a % 2 ==0:
    print("Even")
else:
    print("Odd")

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())

if b-a == 0:
    print("Even")
else:
    print("Odd")

Submission status: Runtime Error

Solution code:
a = str(input()).split
if ( int(a[0]) * int(a[1]) ) % 2 == 1:
    print('0dd')
else:
    print('Even')

Submission status: Runtime Error

Solution code:
#-*- coding:utf-8 -*-
a,b = int(input()),int(input())

if a*b %2 == 0:
    print("Even")
else: print("Odd")

Submission status: Runtime Error

Solution code:
a,b = map(int,raw_inpur().split())

if a * b % 2 == 0:

Submission status: Runtime Error

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

import sys

def color(x, y, k):
    r = 0
    if ((x % (2*k)) / k) != 0:
        r = -1
    
    if ((y % (2*k)) / k) != 0:
        r ^= -1

    return 'B' if  r == 0 else 'W'

def nSatisfied(n, k, tl):
    maxH = 0
    for yi in xrange(0, 2*k):
        for xi in xrange(0, 2*k):
            h = 0
            for e in tl:
                x, y, c = e
                if color(x + xi, y + yi, k) == c:
                    h += 1
            if h > maxH:
                maxH = h
            if maxH == n:
                return maxH
    return maxH


n, k = [int(e) for e in raw_input().split()]
tl = []
for i in range(0, n):
    x, y, c = [e for e in raw_input().split()]
    tl.append([int(x), int(y), c])

# print
# print n, k
# print tl

# for i in range(0, 2*k):
#     print color(i, k),

# print

maxH = nSatisfied(n, k, tl)

sys.stdout.write('%d\n' % maxH)
sys.stdout.flush()

Submission status: Runtime Error

Solution code:
import numpy as np

def getBoundary(p, k, k2):
    if p - k + 1 >= 0:
        return [(p - k + 1, p + 1)]
    else:
        return [(0, p + 1), ((p - k + 1) % k2, k2)]

n, k = map(int, input().strip().split())
k2 = k * 2
b = [[0 for i in range(k2 + 1)] for j in range(k2 + 1)]

for i in range(n):
    x_str, y_str, c_str = input().strip().split()
    x = int(x_str) % k2
    y = (int(y_str) + (c_str == 'B') * k) % k2
    for xb, xe in getBoundary(x % k2, k, k2):
        for yb, ye in getBoundary(y % k2, k, k2):
            b[xb][yb] += 1
            b[xb][ye] -= 1
            b[xe][yb] -= 1
            b[xe][ye] += 1
    for xb, xe in getBoundary((x + k) % k2, k, k2):
        for yb, ye in getBoundary((y + k) % k2, k, k2):
            b[xb][yb] += 1
            b[xb][ye] -= 1
            b[xe][yb] -= 1
            b[xe][ye] += 1

arr_b = np.array(b)
for i in range(k2):
    arr_b[i + 1] += arr_b[i]
for j in range(k2):
    arr_b[:, j + 1] += arr_b[:, j]
print(arr_b.max())

Submission status: Runtime Error

Solution code:
a,b = map(int,input())
if a*b%2 = 0:
    print(Even)

else:
    print(Odd)

Submission status: Runtime Error

Solution code:
#import time

nk = [int(x) for x in input().strip().split()]
d = []
for i in range(nk[0]):
    d_tmp = input().strip().split()
    d.append([int(d_tmp[0]), int(d_tmp[1]), int(d_tmp[2] == 'B')])

n1 = nk[0]
k1 = nk[1]

check_x = [0] * n1 * 4
check_y = [0] * n1 * 4
for i in range(n1):
    check_x[i * 4 + 1] = d[i][0] - k1 + 1
    check_x[i * 4 + 2] = d[i][0]
    check_y[i * 4 + 1] = d[i][1] - k1 + 1
    check_y[i * 4 + 2] = d[i][1]
check_x = list(set(check_x))
check_y = list(set(check_y))

#d = tuple(d)
n = 0
#t = time.clock()
#for i in range(k1):
#    for j in range(k1):
for i in check_x:
    for j in check_y:
        n_tmp = [0, 0]
        for k in range(n1):
            x = (d[k][0] - i) // k1 % 2
            y = (d[k][1] - j) // k1 % 2
#            if x == y:
#                n_tmp[1 - d[k][2]] += 1
#            else:
#                n_tmp[d[k][2]] += 1
            n_tmp[(x == y) ^ d[k][2]] += 1
        if n_tmp[0] > n:
            n = n_tmp[0]
        if n_tmp[1] > n:
            n = n_tmp[1]
#print(time.clock() - t)
print(n)

Submission status: Runtime Error

Solution code:
import time

nk = [int(x) for x in raw_input().strip().split()]
d = []
for i in range(nk[0]):
    d_tmp = raw_input().strip().split()
    d.append([int(d_tmp[0]), int(d_tmp[1]), int(d_tmp[2] == 'B')])

n1 = nk[0]
k1 = nk[1]

check_x = [0] * n1 * 4
check_y = [0] * n1 * 4
for i in range(n1):
    check_x[i * 4] = d[i][0] - k1
    check_x[i * 4 + 1] = d[i][0] - k1 + 1
    check_x[i * 4 + 2] = d[i][0]
    check_x[i * 4 + 3] = d[i][0] + 1
    check_y[i * 4] = d[i][1] - k1
    check_y[i * 4 + 1] = d[i][1] - k1 + 1
    check_y[i * 4 + 2] = d[i][1]
    check_y[i * 4 + 3] = d[i][1] + 1
check_x = list(set(check_x))
check_y = list(set(check_y))

#d = tuple(d)
n = 0
#t = time.clock()
for i in check_x:
    for j in check_y:
        n_tmp = [0, 0]
        for k in range(n1):
            x = (d[k][0] - i) // k1 % 2
            y = (d[k][1] - j) // k1 % 2
#            if x == y:
#                n_tmp[1 - d[k][2]] += 1
#            else:
#                n_tmp[d[k][2]] += 1
            n_tmp[(x == y) ^ d[k][2]] += 1
        if n_tmp[0] > n:
            n = n_tmp[0]
        if n_tmp[1] > n:
            n = n_tmp[1]
#print time.clock() - t
print n

Submission status: Runtime Error

Solution code:
a,b = input().split()
if (a*b % 2 == 1):
    print("0dd")
else:
    print("Even")

Submission status: Runtime Error

Solution code:
a,b = input().split()
if (a*b%2 = 1):
    print("0dd")
else:
    print("Even")

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
# coding=utf-8

import sys

import numpy as np

n, k = map(int, sys.stdin.readline().strip().split(" "))
xyc = [l.strip().split(" ") for l in sys.stdin.readlines()]
xy = [tuple((int(_x), int(_y) if _c == "W" else int(_y) + k)) for (_x, _y, _c) in xyc]
xy = [tuple((_x % (2 * k), _y % (2 * k))) for (_x, _y) in xy]

ans = np.zeros((n, 2 * k, 2 * k), dtype=np.uint8)
for _x, _y in xy:
    check = np.zeros((n, 2 * k, 2 * k), dtype=np.uint8)
    check[_x:_x + k] = 1
    if _x > k:
        check[:_x - k] = 1
    check[:, _y:_y + k] = 1 - check[:, _y:_y + k]
    if _y > k:
        check[:, :_y - k] = 1 - check[:, :_y - k]
    check = 1 - check
    ans += check
print(np.max(ans))

Submission status: Runtime Error

Solution code:
(a,b)=map(int,input().split())
if a*b%2==0:
  print(偶数)
else
  print(奇数)

Submission status: Runtime Error

Solution code:
import numpy as np

N, K = map(int, input().split())
ub = K * 2
bw = {"B": np.zeros((ub, ub), int), "W": np.zeros((ub, ub), int)}
for i in range(N):
	x, y, c = input().split()
	bw[c][int(x) % ub][int(y) % ub] += 1

def accum_arr(arr):
	acc_h = np.zeros((ub, ub), int)
	acc_v = np.zeros((ub, ub), int)
	acc = np.zeros((ub, ub), int)
	acc_h[:, 0] = arr[:, 0] + arr[:, - (K - 1):].sum(axis=1)
	acc_v[0, :] = arr[0, :] + arr[- (K - 1):, :].sum(axis=0)

	for i in range(1, ub):
		acc_h[:, i] = arr[:, i] + acc_h[:, i - 1] - arr[:, (i - K) % ub]
		acc_v[i, :] = arr[i, :] + acc_v[i - 1, :] - arr[(i - K) % ub, :]

	acc[0][0] = arr[0][0] + arr[0, - (K - 1):].sum() + arr[- (K - 1):, 0].sum() + arr[-(K - 1):, - (K - 1):].sum()

	for j in range(1, ub):
		acc[0][j] = acc[0][j - 1] + acc_v[0][j] - acc_v[0][(j - K) % ub]

	for j in range(ub):
		for i in range(1, ub):
			acc[i][j] = acc[i - 1][j] + acc_h[i][j] - acc_h[(i - K) % ub][j]

	return acc


b_acc = accum_arr(bw["B"])
w_acc = accum_arr(bw["W"])

ans = 0
for x in range(ub):
	for y in range(ub):
		x_cmp = (x + K) % ub
		y_cmp = (y + K) % ub
		tmp_ans = b_acc[x][y] + b_acc[x_cmp][y_cmp] + w_acc[x][y_cmp] + w_acc[x_cmp][y]
		if tmp_ans > ans:
			ans = tmp_ans

print(ans)

Submission status: Runtime Error

Solution code:
a = input()
b = input()
a = int(a)
b = int(b)

if a * b % 2 == 0:
   print('Even')
else:
   print('Odd')

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
calc = a * b;
if calc%2==0:
    print("Even")
else:
    print("Odd")

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
N = input()
t, x, y = [0], [0], [0]
for _ in range(N):
    _t, _x, _y = map(float, raw_input().split())
    t.append(_t)
    x.append(_x)
    y.append(_y)

# /w1 = w[0]


txy = np.array([[_t, _x, _y] for _t, _x, _y in zip(t, x, y)], dtype=np.int32)

dm = np.diff(txy, axis=0)
for d in dm:
    total = np.abs(d[1]) + np.abs(d[2])
    if d[0] >= total  and (d[0] - total) % 2 == 0:
        print 'Yes'
        exit()

print 'No'

Submission status: Runtime Error

Solution code:
N, M = input().strip().split(' ')

if (N + M) % 2 == 0:
    print('even')
else:
    print('odd')

Submission status: Runtime Error

Solution code:
#-*- coding: utf-8 -*- 
a,b = map(int, input().split())
p = a*b
if p%2 == 0:
   print("Even")
else:
   print(Odd)

Submission status: Runtime Error

Solution code:
a,b = [x for x in input().split(' ')]
if a * b % 2 == 0:
	print('Even')
else:
	print('Odd')

Submission status: Runtime Error

Solution code:
a,b = map(int, raw_input().split())
print("Odd" if a*b % 2 else "Even")

Submission status: Runtime Error

Solution code:
a,b = map(int, raw_input().split())
print "Odd" if a*b % 2 else "Even"

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import math
a,b =map(int,input().split())
N =str(a)+str(b)
int(ans)= math.sqrt(int(N))
if int(N)==ans*ans:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
rest = a * b % 2
if rest == 1:
    print('Odd')
else:
    print('Even')

Submission status: Runtime Error

Solution code:
ab_str = input()
a_str, b_str = ab_str.split()
a = int(a_str)
b = int(b_str)
if a%2 == 0 or b%2 == 0:
  print(Even)
else:
  print(Odd)

Submission status: Runtime Error

Solution code:
# input
a, b = input().split()

# constraints
if type(a)!='int' or type(b)!='int':
    print('型がintではありません')
    raise TypeError

if a > 1000 or b > 10000 or a<0 or b<0:
    print('制約違反です')
    raise ValueError
    

# result
if (a*b)%2 == 0:
    print('Even')
else:
    print('odd')

Submission status: Runtime Error

Solution code:
# input
a, b = map(int, input().split())

# constraints
if a > 1000 or b > 10000 or a<0 or b<0:
    print('制約違反です')
    raise ValueError

# result
if (a*b)%2 == 0:
    print('Even')
else:
    print('odd')

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;

int main() {
	
	int  a, b;
	
	cin >> a >> b;
	int c = a * b;
	if(c % 2 == 0) {
		cout << "Even" << endl;
	} else {
		cout << "Odd" << endl;
	}
	return 0;
}

Submission status: Runtime Error

Solution code:
    s = input().split(" ")
    s = [int(i) for i in s]
    x = s[0] * s[1]
    if x % 2 == 0 : 
        print("Even")
    else : 
        print("Odd")

Submission status: Runtime Error

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
a, b = map(int, input().strip().split())
if a % 2 == 0 || b % 2 == 0:
    print("Even")
else:
    print("Odd")

Submission status: Runtime Error

Solution code:
a, b = input().split()
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())

c = a * b

if c % 2 == 0:
    print("Even")
else:
    print("Odd")