Given two arrays of N and M integers. The task is to find the number of unordered pairs formed of elements from both arrays in such a way that their sum is an odd number.
Note: An element can only be one pair.
Examples:
Input: a[] = {9, 14, 6, 2, 11}, b[] = {8, 4, 7, 20}
Output: 3
{9, 20}, {14, 7} and {11, 8}Input: a[] = {2, 4, 6}, b[] = {8, 10, 12}
Output: 0
Approach: Count the number of odd and even numbers in both the arrays and the answer to the number of pairs will be min(odd1, even2) + min(odd2, even1), because odd + even is only odd.
Below is the implementation of the above approach:
C++
// C++ program to implement // the above approach #include <bits/stdc++.h> using namespace std; // Function that returns the number of pairs int count_pairs(int a[], int b[], int n, int m) { // Count of odd and even numbers int odd1 = 0, even1 = 0; int odd2 = 0, even2 = 0; // Traverse in the first array // and count the number of odd // and evene numbers in them for (int i = 0; i < n; i++) { if (a[i] % 2) odd1++; else even1++; } // Traverse in the second array // and count the number of odd // and evene numbers in them for (int i = 0; i < m; i++) { if (b[i] % 2) odd2++; else even2++; } // Count the number of pairs int pairs = min(odd1, even2) + min(odd2, even1); // Return the number of pairs return pairs; } // Driver code int main() { int a[] = { 9, 14, 6, 2, 11 }; int b[] = { 8, 4, 7, 20 }; int n = sizeof(a) / sizeof(a[0]); int m = sizeof(b) / sizeof(b[0]); cout << count_pairs(a, b, n, m); return 0; } |
chevron_right
filter_none
Java
// Java program to implement // the above approach class GFG { // Function that returns the number of pairs static int count_pairs(int a[], int b[], int n, int m) { // Count of odd and even numbers int odd1 = 0, even1 = 0; int odd2 = 0, even2 = 0; // Traverse in the first array // and count the number of odd // and evene numbers in them for (int i = 0; i < n; i++) { if (a[i] % 2 == 1) { odd1++; } else { even1++; } } // Traverse in the second array // and count the number of odd // and evene numbers in them for (int i = 0; i < m; i++) { if (b[i] % 2 == 1) { odd2++; } else { even2++; } } // Count the number of pairs int pairs = Math.min(odd1, even2) + Math.min(odd2, even1); // Return the number of pairs return pairs; } // Driver code public static void main(String[] args) { int a[] = { 9, 14, 6, 2, 11 }; int b[] = { 8, 4, 7, 20 }; int n = a.length; int m = b.length; System.out.println(count_pairs(a, b, n, m)); } } // This code contributed by Rajput-Ji |
chevron_right
filter_none
Python3
# Python 3 program to implement # the above approach # Function that returns # the number of pairs def count_pairs(a, b, n, m): # Count of odd and even numbers odd1 = 0 even1 = 0 odd2 = 0 even2 = 0 # Traverse in the first array # and count the number of odd # and evene numbers in them for i in range(n): if (a[i] % 2): odd1 += 1 else: even1 += 1 # Traverse in the second array # and count the number of odd # and evene numbers in them for i in range(m): if (b[i] % 2): odd2 += 1 else: even2 += 1 # Count the number of pairs pairs = (min(odd1, even2) + min(odd2, even1)) # Return the number of pairs return pairs # Driver code if __name__ == '__main__': a = [9, 14, 6, 2, 11] b = [8, 4, 7, 20] n = len(a) m = len(b) print(count_pairs(a, b, n, m)) # This code is contributed by # Surendra_Gangwar |
chevron_right
filter_none
C#
// C# program to implement // the above approach using System; class GFG { // Function that returns the number of pairs static int count_pairs(int[] a, int[] b, int n, int m) { // Count of odd and even numbers int odd1 = 0, even1 = 0; int odd2 = 0, even2 = 0; // Traverse in the first array // and count the number of odd // and evene numbers in them for (int i = 0; i < n; i++) { if (a[i] % 2 == 1) { odd1++; } else { even1++; } } // Traverse in the second array // and count the number of odd // and evene numbers in them for (int i = 0; i < m; i++) { if (b[i] % 2 == 1) { odd2++; } else { even2++; } } // Count the number of pairs int pairs = Math.Min(odd1, even2) + Math.Min(odd2, even1); // Return the number of pairs return pairs; } // Driver code static public void Main() { int[] a = { 9, 14, 6, 2, 11 }; int[] b = { 8, 4, 7, 20 }; int n = a.Length; int m = b.Length; Console.WriteLine(count_pairs(a, b, n, m)); } } // This code contributed by ajit. |
chevron_right
filter_none
PHP
<?php // PHP program to implement // the above approach // Function that returns the number of pairs function count_pairs($a, $b, $n, $m) { // Count of odd and even numbers $odd1 = 0; $even1 = 0; $odd2 = 0; $even2 = 0; // Traverse in the first array // and count the number of odd // and evene numbers in them for ($i = 0; $i < $n; $i++) { if ($a[$i] % 2) $odd1++; else $even1++; } // Traverse in the second array // and count the number of odd // and evene numbers in them for ($i = 0; $i < $m; $i++) { if ($b[$i] % 2) $odd2++; else $even2++; } // Count the number of pairs $pairs = min($odd1, $even2) + min($odd2, $even1); // Return the number of pairs return $pairs; } // Driver code $a = array( 9, 14, 6, 2, 11 ); $b = array( 8, 4, 7, 20 ); $n = count($a) ; $m = count($b) ; echo count_pairs($a, $b, $n, $m); // This code is contributed by Ryuga ?> |
chevron_right
filter_none
Output:
3
Recommended Posts:
- Given two unsorted arrays, find all pairs whose sum is x
- Count pairs from two sorted arrays whose sum is equal to a given value x
- Count pairs from two arrays whose modulo operation yields K
- Minimum flips of odd indexed elements from odd length subarrays to make two given arrays equal
- Count all pairs of divisors of a number N whose sum is coprime with N
- Count number of distinct pairs whose sum exists in the given array
- Count pairs from a given range whose sum is a Prime Number in that range
- Check if a number has an odd count of odd divisors and even count of even divisors
- Sum of Bitwise AND of all pairs possible from two arrays
- Count pairs from two arrays having sum equal to K
- Count distinct pairs from two arrays having same sum of digits
- Count Pairs from two arrays with even sum
- Minimum possible Bitwise OR of all Bitwise AND of pairs generated from two given arrays
- Count of integers in a range which have even number of odd digits and odd number of even digits
- Generate all possible sorted arrays from alternate elements of two given sorted arrays
- Find sub-arrays from given two arrays such that they have equal sum
- Count of possible arrays from prefix-sum and suffix-sum arrays
- Count all subarrays whose sum can be split as difference of squares of two Integers
- Split the given array into K sub-arrays such that maximum sum of all sub arrays is minimum
- Count unique paths is a matrix whose product of elements contains odd number of divisors
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
