You are given two long numbers N1 and N2 in a string. You need to find out if the product of these numbers generate an even number or an odd number, If it is an even number print 1 else print 0.
Example 1:
Input: 
N1 = "12"
N2 = "15"
Output: 1
Explanation: 12 * 15 = 180 which is an 
even number.
Ã¢â¬â¹Example 2:
Input: 
N1 = "123"
N2 = "457"
Output: 0
Explanation: 123*457 = 56211 which is an 
odd number.
Your Task:
You don't need to read input or print anything. Your task is to complete the function EvenOdd() which accepts two strings N1 and N2 as input parameter and returns 1 or 0 accordingly.
Expected Time Complexity: O(1).
Expected Auxiliary Space: O(1).
Constraints:
1 ≤ N1, N2 ≤ 10^{99}

Source: geeksforgeeks | Difficulty: EASY
Tags: String algorithms

Data structures

Mathematics

Starter code: #User function Template for python3

class Solution:
    def EvenOdd(self, n1, n2):
        # code here

Solutions:
class Solution:

	def EvenOdd(self, n1, n2):
		a = int(n1)
		b = int(n2)
		if a * b % 2 == 0:
			return 1
		else:
			return 0


class Solution:

	def EvenOdd(self, n1, n2):
		x = int(n1) * int(n2)
		if x % 2 == 0:
			return 1
		else:
			return 0


class Solution:

	def EvenOdd(self, n1, n2):
		num1 = int(n1)
		num2 = int(n2)
		res = num1 * num2
		if res % 2 == 0:
			return 1
		else:
			return 0


class Solution:

	def EvenOdd(self, n1, n2):
		na = int(n1)
		nb = int(n2)
		p = na * nb
		if p % 2 == 0:
			return 1
		else:
			return 0


class Solution:

	def EvenOdd(self, n1, n2):
		product = int(n1) * int(n2)
		if product % 2 == 0:
			return 1
		return 0


class Solution:

	def EvenOdd(self, n1, n2):
		if int(str(n1)[-1]) % 2 == 0 or int(str(n2)[-1]) % 2 == 0:
			return 1
		return 0


class Solution:

	def EvenOdd(self, n1, n2):
		prod = n1 * n2
		if prod % 2 == 0:
			return 1
		else:
			return 0


class Solution:

	def EvenOdd(self, n1, n2):
		s1 = int(n1)
		s2 = int(n2)
		s3 = s1 * s2
		if s3 % 2 == 0:
			return 1
		else:
			return 0


class Solution:

	def EvenOdd(self, n1, n2):
		s = int(n1)
		d = int(n2)
		if s * d % 2 == 0:
			return 1
		return 0


class Solution:

	def EvenOdd(self, n1, n2):
		x1 = int(n1)
		x2 = int(n2)
		s = x1 * x2
		if s % 2 == 0:
			return 1
		else:
			return 0


class Solution:

	def EvenOdd(self, n1, n2):
		v1 = int(n1)
		v2 = int(n2)
		ans = v1 * v2
		if ans % 2 == 0:
			return 1
		else:
			return 0


class Solution:

	def EvenOdd(self, n1, n2):
		v = int(n1)
		w = int(n2)
		c = v * w
		if c % 2 == 0:
			return 1
		else:
			return 0


class Solution:

	def EvenOdd(self, n1, n2):
		return int(not int(n1) * int(n2) % 2)


class Solution:

	def EvenOdd(self, n1, n2):
		n3 = n1 * n2
		n4 = n3 % 2
		if n4 == 0:
			return 1
		if n4 == 1:
			return 0


class Solution:

	def EvenOdd(self, n1, n2):
		i = int(n1)
		j = int(n2)
		if i * j % 2 == 0:
			return 1
		return 0


class Solution:

	def EvenOdd(self, n1, n2):
		a1 = int(n1)
		a2 = int(n2)
		p = a1 * a2
		if p % 2 == 0:
			return 1
		return 0


class Solution:

	def EvenOdd(self, n1, n2):
		n = int(n1)
		q = int(n2)
		w = n * q
		if w % 2 == 0:
			return 1
		else:
			return 0


class Solution:

	def EvenOdd(self, n1, n2):
		s = int(n1)
		t = int(n2)
		a = s * t
		if a % 2 == 0:
			return 1
		else:
			return 0


class Solution:

	def EvenOdd(self, n1, n2):
		res = n1 * n2
		if res % 2 == 0:
			return 1
		return 0


class Solution:

	def EvenOdd(self, n1, n2):
		n3 = int(n1)
		n4 = int(n2)
		n5 = n3 * n4
		if n5 % 2 == 0:
			return 1
		else:
			return 0


class Solution:

	def EvenOdd(self, n1, n2):
		if n1 & 1 and n2 & 1:
			return 0
		else:
			return 1