A and B are good friend and programmers. They are always in a healthy competition with each other. They decide to judge the best among them by competing. They do so by comparing their three skills as per their values. Please help them doing so as they are busy.
Set for A are like [a1, a2, a3]
Set for B are like [b1, b2, b3]
Compare ith skill of A with ith skill of B
if a[i] > b[i] , A's score increases by 1
if a[i] < b[i] , B's score increases by 1
if a[i] = b[i] , nothing happens
 
Example 1:
Input : 
A = {4, 2, 7}
B = {5, 6, 3}
Output : 
1 2
Example 2:
Input : 
A = {4, 2, 7}
B = {5, 2, 8}
Output : 
0 2
 
Your Task:  
You don't need to read input or print anything. Your task is to complete the function scores() which takes the array A[], B[] as inputs and two reference variables ca and cb to store the final answer. Store the score of A in ca and score of B in cb.
Expected Time Complexity: O(1)
Expected Auxiliary Space: O(1)
 
Constraints :
1 ≤ a[i] ≤ 10^{17}
1 ≤ b[i] ≤ 10^{17}

Source: geeksforgeeks | Difficulty: EASY
Tags: Data structures

Starter code: #User function Template for python3

class Solution:
    def scores(self, a, b, cc):
        # Update list cc of length 2 with cc[0] = ca and cc[1] = cb
        # Your code goes here
        
    	

Solutions:
class Solution:

	def scores(self, a, b, cc):
		for i in range(len(a)):
			if a[i] > b[i]:
				cc[0] += 1
			elif a[i] < b[i]:
				cc[1] += 1
		return (cc[0], cc[1])


class Solution:

	def scores(self, a, b, cc):
		c1 = 0
		c2 = 0
		cc.clear()
		for i in range(len(a)):
			if a[i] > b[i]:
				c1 += 1
			elif a[i] < b[i]:
				c2 += 1
		cc.append(c1)
		cc.append(c2)
		return cc


class Solution:

	def scores(self, a, b, cc):
		ca = 0
		cb = 0
		for i in range(3):
			if a[i] > b[i]:
				ca += 1
			elif a[i] < b[i]:
				cb += 1
		cc[0] = ca
		cc[1] = cb
		return cc


class Solution:

	def scores(self, a, b, cc):
		A = 0
		B = 0
		for i in range(len(a)):
			if a[i] > b[i]:
				A += 1
			elif a[i] < b[i]:
				B += 1
			else:
				pass
		cc[0] = A
		cc[1] = B
		return (A, B)


class Solution:

	def scores(self, a, b, cc):
		c = 0
		d = 0
		for i in range(len(a)):
			if a[i] != b[i]:
				if a[i] > b[i]:
					c = c + 1
				else:
					d = d + 1
		cc[0] = c
		cc[1] = d
		return cc


class Solution:

	def scores(self, a, b, cc):
		ca = 0
		cb = 0
		for i in range(len(a)):
			if a[i] == b[i]:
				continue
			elif a[i] > b[i]:
				ca += 1
			else:
				cb += 1
		cc[0] = ca
		cc[1] = cb


class Solution:

	def scores(self, a, b, cc):
		for (i, j) in zip(a, b):
			if i > j:
				cc[0] += 1
			elif i < j:
				cc[1] += 1


class Solution:

	def scores(self, a, b, cc):
		a_score = 0
		b_score = 0
		n = len(a)
		for i in range(n):
			a_val = a[i]
			b_val = b[i]
			if a_val > b_val:
				a_score = a_score + 1
			elif a_val < b_val:
				b_score = b_score + 1
		cc[0] = a_score
		cc[1] = b_score


class Solution:

	def scores(self, a, b, cc):
		c1 = c2 = 0
		for i in range(3):
			if a[i] > b[i]:
				c1 += 1
			elif a[i] < b[i]:
				c2 += 1
		cc[0] = c1
		cc[1] = c2
		return cc


class Solution:

	def scores(self, a, b, cc):
		for i in range(3):
			if a[i] > b[i]:
				cc[0] += 1
			elif a[i] < b[i]:
				cc[1] += 1
			else:
				pass


class Solution:

	def scores(self, a, b, cc):
		less = 0
		high = 0
		for i in range(len(a)):
			if a[i] < b[i]:
				less += 1
			if a[i] > b[i]:
				high += 1
		cc[0] = high
		cc[1] = less


class Solution:

	def scores(self, a, b, cc):
		ctrA = 0
		ctrB = 0
		for i in range(3):
			if a[i] > b[i]:
				ctrA += 1
			elif b[i] > a[i]:
				ctrB += 1
		cc[0] = ctrA
		cc[1] = ctrB


class Solution:

	def scores(self, a, b, cc):
		score_a = 0
		score_b = 0
		for i in range(len(a)):
			if a[i] > b[i]:
				cc[0] += 1
			elif b[i] > a[i]:
				cc[1] += 1
			else:
				pass
		return


class Solution:

	def scores(self, a, b, cc):
		ca = 0
		cb = 0
		for count in range(len(a)):
			if a[count] > b[count]:
				ca += 1
			elif a[count] < b[count]:
				cb += 1
		cc[0] = ca
		cc[1] = cb


class Solution:

	def scores(self, a, b, cc):
		c = 0
		d = 0
		for i in range(3):
			if a[i] > b[i]:
				c = c + 1
			elif a[i] < b[i]:
				d = d + 1
		cc[0] = c
		cc[1] = d


class Solution:

	def scores(self, a, b, cc):
		A = 0
		B = 0
		for i in range(len(a)):
			if a[i] == b[i]:
				continue
			elif a[i] > b[i]:
				A += 1
			elif a[i] < b[i]:
				B += 1
			cc[0] = A
			cc[1] = B


class Solution:

	def scores(self, a, b, cc):
		aa = 0
		bb = 0
		for x in range(3):
			if a[x] != b[x]:
				if a[x] > b[x]:
					aa = aa + 1
				else:
					bb = bb + 1
		cc[0] = aa
		cc[1] = bb
		return cc


class Solution:

	def scores(self, a, b, cc):
		Ascore = 0
		Bscore = 0
		for i in range(0, len(a)):
			if a[i] > b[i]:
				Ascore += 1
			elif a[i] < b[i]:
				Bscore += 1
			else:
				continue
		cc[0] = Ascore
		cc[1] = Bscore
		return cc


class Solution:

	def scores(self, a, b, cc):
		i = 0
		while i < len(a):
			if a[i] > b[i]:
				cc[0] += 1
			elif a[i] < b[i]:
				cc[1] += 1
			i += 1
		return cc


class Solution:

	def scores(self, a, b, cc):
		counta = 0
		countb = 0
		for i in range(0, len(a)):
			if a[i] != b[i]:
				if a[i] > b[i]:
					counta = counta + 1
				else:
					countb = countb + 1
		cc[0] = counta
		cc[1] = countb
		return cc


class Solution:

	def scores(self, a, b, cc):
		score_a = 0
		score_b = 0
		for i in range(3):
			if a[i] > b[i]:
				score_a += 1
			elif a[i] < b[i]:
				score_b += 1
		cc[0] = score_a
		cc[1] = score_b
		return cc


class Solution:

	def scores(self, a, b, cc):
		for x in range(len(a)):
			if a[x] > b[x]:
				cc[0] = cc[0] + 1
			if a[x] < b[x]:
				cc[1] = cc[1] + 1


class Solution:

	def scores(self, a, b, c):
		ca = 0
		cb = 0
		for i in range(len(a)):
			if a[i] > b[i]:
				ca = ca + 1
			elif a[i] < b[i]:
				cb = cb + 1
		c[0] = ca
		c[1] = cb
		return c