Problem:


Score : 100 points

Problem Statement

You are given integers A and B, each between 1 and 3 (inclusive).

Determine if there is an integer C between 1 and 3 (inclusive) such that A \times B \times C is an odd number.

Constraints

All values in input are integers.

1 \leq A, B \leq 3

Input

Input is given from Standard Input in the following format:

A B

Output

If there is an integer C between 1 and 3 that satisfies the condition, print Yes; otherwise, print No.

Sample Input 1

3 1

Sample Output 1

Yes

Let C = 3. Then, A \times B \times C = 3 \times 1 \times 3 = 9, which is an odd number.

Sample Input 2

1 2

Sample Output 2

No

Sample Input 3

2 2

Sample Output 3

No



Sample input:
3 1


Sample output:
Yes

Submission status: Runtime Error

Solution code:
class ABC109Solver():
    def __init__(self):
        self.a = int()
        self.b = int()
    def input(self, a, b):
        self.a = a
        self.b = b
    def solve(self):
        # return 'Yes'
        # return 'No' if self.b%2 == 0 else 'Yes'
        return 'No' if self.a%2 == 0 or self.b%2 == 0 else 'Yes'
      
a = int(input())
b = int(input())
solver = ABC109Solver()
solver.input(a,b)

print( solver.solve() )

Submission status: Runtime Error

Solution code:

class ABC109Solver():
    def __init__(self):
        self.a = int()
        self.b = int()
    def input(self, a, b):
        self.a = a
        self.b = b
    def solve(self):
        # return 'Yes'
        # return 'No' if self.b%2 == 0 else 'Yes'
        return 'No' if self.a%2 == 0 or self.b%2 == 0 else 'Yes'
      
a = int(input())
b = int(input())
solver = ABC109Solver()

print( solver.solve() )

Submission status: Runtime Error

Solution code:

class ABC109Solver():
    def __init__(self):
        self.a = int()
        self.b = int()

    def input(self, a, b):
        self.a = a
        self.b = b

    def solve(self):
        # return 'Yes'
        # return 'No' if self.b%2 == 0 else 'Yes'
        return 'No' if self.a%2 == 0 or self.b%2 == 0 else 'Yes'
      
a = input()
b = input()
solver = ABC109Solver()
solver.input(a, b)
print( solver.solve() )

Submission status: Runtime Error

Solution code:
def gcd(a,b):
    if b == 0:
        return a
    else:
        return gcd(b,a%b)

n,x = map(int,input().split())
lstx = [int(i) for i in input().split()]

g = abs(lstx[0]-x)
for i in range(1,n): g = gcd(g,abs(lstx[i]-x))

print(g)

Submission status: Runtime Error

Solution code:
h,w=map(int,input().split())
c=[list(map(int,input().split())) for i in range(h)]
ans=[]
for i in range(h):
  for j in range(w):
    if c[i][j]%2==1:
      if i<h-1:
        ans.append((i,j,i+1,j))
        c[i+1][j]+=1
      elif j<w-1:
        ans.append((i,j,i,j+1))
        c[i][j+1]+=1
print(len(ans))
for a in ans:
  print(' '.join(map(str,a)))

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
if a%2==1 and b%2==1 and c%2==1:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
if a%2==1 and b%2==1 and c%2==1:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
if (a%2==1 and b%2==1 and c%2==1):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
from math import gcd
from functools import reduce


def gcd_expand(values):
    return reduce(gcd, values)


N, X = map(int, input().split())
x = map(int, input().split())

x_abs = [abs(X - i) for i in x]
print(gcd_expand(x_abs))

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
if(a%2==0 and b%2==0 and c%2==0):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a, b = map(int,input().split())
c for i in range(3)

if (a+b)+ i == 0:
  print("No")
else:
  print("Yes")

Submission status: Runtime Error

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    H,W=MI()
    A=LLIN(H)
    odds=[]
    ans=[]
    for i in range(H):
        if i&1:
            for j in range(W)[::-1]:
                if A[i][j]&1:
                    if j==0:
                        dy=1
                        dx=0
                    else:
                        dy=0
                        dx=-1
                    if i+dy!=H:
                        
                        ans.append((i+1,j+1,i+dy+1,j+dx+1))
                        A[i+dy][j+dx]+=1
        else:
            for j in range(W)[::-1]:
                if A[i][j]&1:
                    if j==W-1:
                        dy=1
                        dx=0
                    else:
                        dy=0
                        dx=1
                    if i+dy!=H:
                       
                        ans.append((i+1,j+1,i+dy+1,j+dx+1))
                        A[i+dy][j+dx]+=1

    print(len(ans))
    for a in ans:
        print(*a)
    


if __name__ == '__main__':
  main()

Submission status: Runtime Error

Solution code:
#
# 　　  ⋀_⋀　 
#　　  (･ω･)  
# .／ Ｕ ∽ Ｕ＼
#  │＊　合　＊│
#  │＊　格　＊│ 
#  │＊　祈　＊│ 
#  │＊　願　＊│ 
#  │＊　　　＊│ 
#      ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    H,W=MI()
    A=LLIN(H)
    odds=[]
    ans=[]
    for i in range(H):
        if i&1:
            for j in range(W)[::-1]:
                if A[i][j]&1:
                    if j==0:
                        dy=1
                        dx=0
                    else:
                        dy=0
                        dx=-1
                    if i+dy!=H:
                        
                        ans.append((i+1,j+1,i+dy+1,j+dx+1))
                        A[i+dy][j+dx]+=1
        else:
            for j in range(W)[::-1]:
                if A[i][j]&1:
                    if j==W-1:
                        dy=1
                        dx=0
                    else:
                        dy=0
                        dx=1
                    if i+dy!=H:
                       
                        ans.append((i+1,j+1,i+dy+1,j+dx+1))
                        A[i+dy][j+dx]+=1

    print(len(ans))
    for a in ans:
        print(*a)
    


if __name__ == '__main__':
　　main

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
print'No' if a%2==0 or b%2==0 else 'Yes'

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
print(a%2==0 or b%2==0 ? 'No' : 'Yes')

Submission status: Runtime Error

Solution code:
def main():
    a,b = map(int,input().split())
    if a%2!=0 and b%2!=0:
        print('Yes')
        return
    print('No')


if __name __ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def gcd(a,b):
    while b!=0:
        a,b = b,b%a
    return a
def lcm(a,b):
    return (a*b)//gcd(a,b)

N,X = map(int,input().split())
x = list(map(int,input().split()))
x = list(map(lambda q:abs(q-X),x))
ans = 1
for xx in x:
    ans = gcd(ans,xx)
print(ans)

Submission status: Runtime Error

Solution code:
A, B= map(int, input().split())
C = int(input())

A_B = (A*B) % 2

if A_B == 0:
    print("No")
else:
    print("Yes")

Submission status: Runtime Error

Solution code:
A, B= map(int, input().split())
C = int(input())

A_B = A*B % 2

if A_B == 0:
    print("No")
else:
    print("Yes")

Submission status: Runtime Error

Solution code:
a. b = map(int, input().split())
if a*b % 2 == 0:
    print('No')
else:
    print('Yes')

Submission status: Runtime Error

Solution code:
a. b = map(int, input().split())
if a*b % 2 == 0:
    print('YES')
else:
    print('NO')

Submission status: Runtime Error

Solution code:
a, b = map(int, input())
if a * b % 2 == 1:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
a,b = int(input())
if a*b%2==0:
  print("No")
else:
  print("Yes")

Submission status: Runtime Error

Solution code:
A, B = map(int, input().split()) 
if A * B % 2:
print("Yes")
else:
print("No")

Submission status: Runtime Error

Solution code:
A, B = map(int, input().split()) 
if A * B % 2
print("Yes")
else 
print("No")

Submission status: Runtime Error

Solution code:
A = int(input())
B = input()
if A * B % 2:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
A = map(int, input().split()) 
B = input()
if A * B % 2:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
A,B int(input())
if (A * B % 2):
    print("Yes")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
A,B(int input())
if (A * B % 2):
    print("Yes")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
import fractions
n,x=map(int,input().split())
a=list(map(int,input().split()))
ans=abs(x-a[0])
a.sort()
if n==1:
    print(abs(x-a[0]))
else:
    cnt=abs(a[1]-a[0])
    for j in range(n-1):
        cnt=min(abs(a[j+1]-a[j]),cnt)
    for i in range(n):
        ans=min(abs(x-a[i]),ans)
    print(min(ans,cnt))

Submission status: Runtime Error

Solution code:
#                         author:  kagemeka 
#                         created: 2019-11-10 12:28:14(JST)
### modules
## from standard library
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
# import functools
# import operator
## from external libraries
# import scipy.special   
# import scipy.misc      
# import numpy as np 

def main():
    a, b = (int(x) for x in sys.stdin.readline().split())
    if (a * b) % 2 !- 0:
        ans = 'Yes'
    else:
        ans = 'No'
    
    print(ans)


if __name__ == "__main__":
    # execute only if run as a script
    main()

Submission status: Runtime Error

Solution code:
import fractions
N, M = map(int, input().split())
X = list(map(int, input().split()))

Y=[0]*N

for i in range(N):
    Y[i]=abs(X[i]-M)

tmp=Y[0]
for i in range(N-1):
    tmp=fractions.gcd(tmp,Y[i+1])

print(tmp)

Submission status: Runtime Error

Solution code:
A, B = map(int, input())

if A*B % 2 == 0:
    print("No")
else:
    print("Yes")

Submission status: Runtime Error

Solution code:
    A, B = map(int, input().split())
     
    if A*B%2==0:
      print("No")
    else:
      print("Yes")

Submission status: Runtime Error

Solution code:
A, B = map(int, input().split())

if A*B%2=0:
  print("No")
else:
  print("Yes")

Submission status: Runtime Error

Solution code:
n,x = map(int,input().split())
a = list(map(int,input().split()))

def gcd(a,b):
  while b!=0:
    a,b=b,a%b
  return a

d = []
for i in range(n):
  y = abs(a[i] - x)
  d.append(y)

a = gcd(d[0],d[1])
for i in range(n):
	a = gcd(a,d[i])
print(a)

Submission status: Runtime Error

Solution code:
A, B = map(int,input())
ab = A*B
if ab % 2 == 0:
    print('No')
else:
    print('Yes')

Submission status: Runtime Error

Solution code:
a, b = map(int, input())
if a * b % 2:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
A, B = map(int, input().split())

if A == 2 || B == 2:
  print("No")
else:
  print("Yes")

Submission status: Runtime Error

Solution code:
if int(input())%2 == 1 and int(input())%2 == 1:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
N,X=map(int,input().split())
x=list(map(int,input().split()))
x.append(X)
mx=min(x)
x=list(map(lambda t:t-mx,x))
def gcd(a,b):
    while b:
        a,b=b,a%b
    return(a)
a=10**10
for i,j in zip(x,x[1:]):
    a=min(a,gcd(i,j))
print(a)

Submission status: Runtime Error

Solution code:
print("YNeos"[eval(input().replace(" ","*")%2==0)::2])

Submission status: Runtime Error

Solution code:
print('Yes' if eval(input().replace(' ',*))%2 else 'No')

Submission status: Runtime Error

Solution code:
n=int(input())
a=[input() for i in range(n)]
s=0
for i in range(n-1):
    if a[i][-1]!=a[i+1][0]:
        s+=1
a.sort()
for i in range(n-1):
    if a[i]==a[i+1]:
        s+=1
if s==0:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
    a,b=map(int,input().split())
    if a==2 or b==2:
      print('No')
    else:
      print('Yes')

Submission status: Runtime Error

Solution code:
a,b=map(int(input().split()))
if a==2 or b==2:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
A, B = map(int, input())
if A * B % 2 == 0:
  print('No')
  exit()
print('Yes')

Submission status: Runtime Error

Solution code:
a , b = map(int, input().split())
if (a * b %% 2 == 1) :
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
A,B = map(int,input().split)

if A%2==1 and B%2==1:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
print("Yes" if i%2==1 for i in [map(int, input().split())] else "No")

Submission status: Runtime Error

Solution code:
a,b = map(int,input().split())
if "2" in a or "2" in b:
  print("No")
else:
  print("Yes")

Submission status: Runtime Error

Solution code:
A,B=map(int(input()))
if A==2 or B==2:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
A,B=map(int.input())
if A==2 or B==2:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
print("Yes" if (eval(input().replace(" ",*)))%2 else "No")

Submission status: Runtime Error

Solution code:
print("Yes" if eval(input().replace(" ",*))%2 else "No")

Submission status: Runtime Error

Solution code:
from sys import stdin

def gcd(a, b):
	while b: a, b = b, a % b
	return a

N, X = [int(x) for x in stdin.readline().rstrip().split()]
x_lst = sorted(set([abs(int(x)-X) for x in stdin.readline().rstrip().split()]))

if len(x_lst) == 1:
  print(x_lst[0])
else:
  prev_x = x_lst[0]
  for x in x_lst[1:]:
    prev_x = gcd(prev_x, x)
    if prev_x == 1: break
  print(prev_x)

Submission status: Runtime Error

Solution code:
if A*B%2==0:
    print('No')
else :
    print('Yes')

Submission status: Runtime Error

Solution code:
a, b = map(int, input())
print('No' if a % 2 or b % 2 else 'Yes')

Submission status: Runtime Error

Solution code:
A,B = map(int,input().split())
C = [1,2,3]

for i in C:
  if A*B*C % 2 == 1:
    print("Yes")
    exit()
print("No")

Submission status: Runtime Error

Solution code:
def main():
    a,b = map(int, input().split())
  if (a*b) % 2== 1:
      print("Yes")
  else:
      print('No')
 
 
 
if __name__ == '__main__' :
    main()

Submission status: Runtime Error

Solution code:
def main():
    a,b = map(int, input().split())
  if (a*b) % 2== 1:
      print("Yes")
  else:
      print('No")



if __name__ == '__main__' :
    main()

Submission status: Runtime Error

Solution code:
import sys

def odd_def(num):
    if num % 2 == 0:
        return False
    else:
        return True

def main():
    a,b = map(int, input().split())
    for i in range(1,4):
        mal = a*b*c
        if odd_def(mal):
            print('Yes')
            sys.exit()
    print('No')


if __name__ == '__main__' :
    main()

Submission status: Runtime Error

Solution code:
num = map(int, input().split())

if num[0]%2==0 and num[1]%2==0: print('No')
else: print('Yes')

Submission status: Runtime Error

Solution code:
l = list(map(int,input().split().split()))
l.sort()
print(l[0]*10 +l[1]+l[2])

Submission status: Runtime Error

Solution code:
a,b = map(int,input())
if a*b %2 != 0:
  print('Yes')
else :
  print('No')

Submission status: Runtime Error

Solution code:
N,X = map(int, input().split())
List = [int(x) for x in input().split()]
 
import math
List.append(X)
List.sort()
 
distance = []
for i in range(N):
    distance.append(List[i+1]-List[i])
 
d_min = min(distance)
 
num_list = []
 
c = 1
while c <= math.sqrt(d_min):
    if d_min%c == 0:
        num_list.append(c)
    c += 1
 
num_list2 = [0]*len(num_list)
for i in range(len(num_list)):
    num_list2[len(num_list)-i-1] = int(d_min/num_list[i])
 
num_list = num_list + num_list2
 
j = len(num_list)-1
c2 = 0
while j >= 0:
    for k in range(len(distance)):
        if distance[k]%num_list[j] == 0:
            c2 += 1
    if c2 == len(distance):
        ans = num_list[j]
        j = 0
    j -= 1
 
print(ans)

Submission status: Runtime Error

Solution code:
a,b = map(int, input().split())
if a*b % :
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

if ( a * b ) % 2 == 0:
  print("No")
else:
  print("Yes")

Submission status: Runtime Error

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

if (a＊b)%2==1:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
# ABC 109, B - shiritori

n = int(input())
w = []
for i in range(n):
    w.append(input())


used = []

for i in range(n):
    print(i)
    if i == 0:
        used.append(w[i])
        tail = w[i][-1]
    else:
        # no if the same word is used
        if w[i] in used:
            print('No')
            break
        # no if the hean and tail is not equal
        elif w[i][0] != tail:
                print('No')
                break
        else:
            used.append(w[i])
            tail = w[i][-1]
else:
    print('Yes')

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
2.if a * b % 2 == 0:
3.  print('No')
4.else:
5.  print('Yes')

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
if a%2==0or b%2==0:
  print("NO")
else:
  print("YES")

Submission status: Runtime Error

Solution code:
a,b=m(int,input().split())
if a%2==0or b%2==0:
  print("NO")
else:
  print("YES")

Submission status: Runtime Error

Solution code:
A,B=map(int,input().split())
if A * B % 2 == 1:
  pritn("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import math

N,X = map(int,input().split())
x = list(map(int,input().split()))
distance = []

for i in x:
    distance.append(abs(i-X))

while len(distance) > 1:
        cd = math.gcd(distance[0],distance[1])
        del distance[0]
        del distance[0]
        distance.append(cd)

print(distance[0])

Submission status: Runtime Error

Solution code:
import math

N,X = map(int,input().split())
x = list(map(int,input().split()))
distance = []

for i in x:
    distance.append(abs(i-X))

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
if (a*b)%2==0:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
A,B = map(int, input(),split())
if A!=2 and B!=2:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
A,B = int(input()),int(input())
print('Yes' if A&B&1 else 'No')

Submission status: Runtime Error

Solution code:
A,B = int(input()),int(input())
print('Yes' if A&B&1 else 'No)

Submission status: Runtime Error

Solution code:
a,b=int,input().split()
if (a*b*1)%2==1:
  print('YES')
elif (a*b*2)%2==1:
  print('YES')
elif (a*b*3)%2==1:
  print('YES')
else:
  print('NO')

Submission status: Runtime Error

Solution code:
n = int(input())

used = [empty]
ans = "Yes"

for i in range(n):
    if i == 0:
        t = str(input())
        
        past = t
    else:
        t = str(input())
        for j in used:
            if j == t:
                ans = "No"
    
    if past[-1] != t[1]:
        ans = "No"
    used.append(t)
    past = t

print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
w=[]
for i in range(n):
    w.append(input())
a=0
for i in range(1,n):
    if w.count(w[i])==1 and w[i-1][-1]==w[i][0]:
       a += 1
    else:
        print('No')
        break
    if a==n-1:
        print('Yes')
    else:
        pass

Submission status: Runtime Error

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

ans1 = a * B
ans2 = a* b * 2
ans3 = a * b* 3

if ans1%2 == 1:
    print('Yes')
    exit
elif ans2%2 ==1:
    print('Yes')
    exit
elif ans2%2 ==1:
    print('Yes')
    exit
else:
    print("No")

Submission status: Runtime Error

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

ans1 = a * B
ans2 = a* b * 2
ans3 = a * b* 3

if ans1%2 == 1:
    print('Yes')
elif ans2%2 ==1:
    print('Yes')
elif ans2%2 ==1:
    print('Yes')
else:
    print("No")

Submission status: Runtime Error

Solution code:
    a, b = [int(i) for i in input().split()]
    if(a == 2 or b == 2):
      print("No")
    else:
      print("Yes")

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
if a%2==0 or b%==0:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
a,b=map(int,input().splite())
if a%2==0 or b%==0:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    a,b = f()
    for i in range(1,4):
        if a*b*c%2 == 1:
            print("Yes")
            return
    
    print('No')
    

solve()

Submission status: Runtime Error

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

if a == 2 or b == 2;
	print('No')
else:
	print('Yes')

Submission status: Runtime Error

Solution code:
import fractions

N,X = map(int, input().split())
x = list(map(int, input().split()))
x.append(X)
x.sort()

if N != 1:
    A = [0]*(N-1)
    for i in range(N-1):
        A[i] = x[i+1]-x[i]

    a = A[0]
    for i in range(N-1):
        a = fractions.gcd(a,A[i])
    print(a)
else:
    print(x[1]-x[0])

Submission status: Runtime Error

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

for c in range(1,4) :
    if (a*b*c)%2 == 1 :
        print("Yes")
        sys.exit(0)

print("No")

Submission status: Runtime Error

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

for c in range(1,4) :
    if (a*b*c)%2 == 1 :
        print("Yes")
        sys.exit()

print("No")

Submission status: Runtime Error

Solution code:
A,B = int(input().split())
if A * B % 2 == 0:
    print("No")
else:
    print("Yes")

Submission status: Runtime Error

Solution code:
a,b = map(int, input().split())
print ("Yes" if a*b%2==1 else “No”)

Submission status: Runtime Error

Solution code:
import fractions
N, X = map(int, input().split())
x_list = list(map(int, input().split()))
kyori_list = [abs(X-i) for i in x_list]
ans_gcd = kyori_list[0]
for i in kyori_list[1:]:
    ans_gcd = fractions.gcd(ans_gcd, i)
print(ans_gcd)

Submission status: Runtime Error

Solution code:
from fractions import gcd
N, X = map(int, input().split())
x_list = list(map(int, input().split()))
kyori_list = [abs(X-i) for i in x_list]
ans_gcd = kyori_list[0]
for i in kyori_list[1:]:
    ans_gcd = gcd(ans_gcd, i)
print(ans_gcd)

Submission status: Runtime Error

Solution code:
from math import gcd
N, X = map(int, input().split())
x_list = list(map(int, input().split()))
kyori_list = [abs(X-i) for i in x_list]
ans_gcd = kyori_list[0]
for i in kyori_list[1:]:
    ans_gcd = gcd(ans_gcd, i)
print(ans_gcd)

Submission status: Runtime Error

Solution code:
import math

N,X = map(int,input().split())
x = list(map(int,input().split()))
if N == 1:
    print(abs(x[0] - X))
else:
    xlen = [abs(x[0]-X)]
    for i in range(N-1):
        xlen.append(x[i+1]- x[i])
    ans = xlen[0]
    for i in range(N-2):
        ans = math.gcd(ans,xlen[i+1])
    print(ans)

Submission status: Runtime Error

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

if a % 2==1 and b % 2==1:
 print("Yes")
else: 
 print("No")​

Submission status: Runtime Error

Solution code:
if __name__ == '__main__':
    a = input().spit()
    if a[0]%2 == 1 and a[1]%2 == 1:
        print("Yes")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
h,w=map(int,input().split())
a=[]

for i in range(h):
  x=list(map(int,input().split()))
  a.append(x)
ans=[]
times=0
for i in range(h):
  for j in range(w-1):
    if a[i][j]%2!=0:
      a[i][j]-=1
      a[i][j+1]+=1
      ans.append([i+1,j+1,i+1,j+2])
      times+=1
for i in range(h-1):
  if a[i][w-1]%2!=0:
    a[i][w-1]-=1
    a[i+1][w-1]+=1
    ans.append([i+1,w,i+2,w])
    times+=1
print(times)
for i in range(len(ans)):
  print(ans[i])

Submission status: Runtime Error

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

if a%2==0:
    evena=1

if b%2==0:
    evenb=1

if evena != 1 and evenb != 1:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

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

int main(){
	int A, B;
	cin >> A >> B;
	if(A * B % 2 == 0){
		cout << "No" << endl;
	}
	else{
		cout << "Yes" << endl;
	}
}

Submission status: Runtime Error

Solution code:
A = input()
B = input()

if (A%2==1)&(B%2==1):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a,b=map(int,input())
if a%2==1 and b%2==1:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a,b = map(nit,input().split())
print('Yes') if a*b%2 ==1 else print('No')

Submission status: Runtime Error

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007

#A
def A():
    a,b,c = LI()
    print(9*max(a,b,c)+a+b+c)
    return

#B
def B():
    a,b = LI()
    if a*b %2:
        print("Yes")
    else:
        print("No")
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#I
def I_():
    return

#J
def J():
    return

#Solve
if __name__ == "__main__":
    A()

Submission status: Runtime Error

Solution code:
A=list(map(int,input().split()))
sum=1
for i in A:
    sum*=i
if sum%2=1:
    print('Yes')
else:
    print("No")

Submission status: Runtime Error

Solution code:
def gcd(a,b):   #　ユーグリッドの互除法
    if b == 0:
        return a
    return gcd(b, a % b)


N, X = map(int, input().split())

ans = 0


x = list(map(int, input().split()))
x.append(X)
x.sort()
a = []

for i in range(N):
    a.append(abs(x[i] - x[i+1]))
    ans = gcd(ans, a[i])


print(ans)

Submission status: Runtime Error

Solution code:
import math

N, X = map(int, input().split())

ans = 0


x = list(map(int, input().split()))
x.append(X)
x.sort()
a = []

for i in range(N):
    a.append(abs(x[i] - x[i+1]))
    ans = math.gcd(ans, a[i])


print(ans)

Submission status: Runtime Error

Solution code:
a=list(input().split())
b=int([0])
c=int([1])
if (b*c)%2==0:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
a,b = map(int,input().split())
for i in range(1,4) :
    if (a*b*c)%2 == 1 :
        print('Yes')
    else :
        print('No')

Submission status: Runtime Error

Solution code:
A,B=int(input()) 
x=A*B
if x%2==0:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
A,B=int(input()) 
x=A*B
if x%2==0:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
A=int() , B=int()
x=A*B
if x%2==0:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
int A, int B
x=A*B
if x%2==0:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
int A, int B
x=A*B
if x%2==0:
  return 'Yes'
else:
  returun 'No'

Submission status: Runtime Error

Solution code:
input(A,B)
x=A*B
if x%2==0:
  return 'Yes'
else:
  returun 'No'

Submission status: Runtime Error

Solution code:
if A%2==0 or B%2==0:
  return 'Yes'
else:
  return 'No'

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
if a%2==0 or b%2==0:
  print('No')
else:
  print('Yes')

Submission status: Runtime Error

Solution code:
a,b= map(int, input().split())
c== a*b
def x:
  print('Yes')
def y:
  print('No')
if c*1%2==0:
  x
elif c*3==0:
  x
else:
  y

Submission status: Runtime Error

Solution code:
a,b = map(int,input())
if a == 2 or b==2:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
a, b=map(int, input())
if a%2==1 and b%2==1:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
N=int(input())
before=[]
ans="Yes"
for i in range(N):
        s=input()
        if s in before:
                ans="No"
        if len(before)>0:
                if before[-1][-1]!=s[0]:
                        ans="No"
        before.append(s)

print(ans)

Submission status: Runtime Error

Solution code:
A=int(input())
B=int(input())
if A%2!=0 and B%2!=0:
        print("Yes")
else :
        print("No")

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split)
if(a%2==1 and b%2==1):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
A, B = map(int, input().split())
for c in range(1, 4):
    if (a * b * c) % 2 != 0:
        print('Yes')
        break
else:
    print('No')

Submission status: Runtime Error

Solution code:
A, B = mpa(int, input(),.split())
for c in range(1, 4):
    if (a * b * c) % 2 != 0:
        print('Yes')
        break
else:
    print('No')

Submission status: Runtime Error

Solution code:
A,B = map(int, input(),split())
if A == 2 or B == 2:
  print('No')
else:
  print('Yes')