Skip to content
Related Articles

Related Articles

Improve Article
Given two arrays count all pairs whose sum is an odd number
  • Difficulty Level : Easy
  • Last Updated : 03 Mar, 2021

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;
}
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
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
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.
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
?>
Javascript



<script>
 
// JavaScript 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
    let odd1 = 0, even1 = 0;
    let odd2 = 0, even2 = 0;
 
    // Traverse in the first array
    // and count the number of odd
    // and even numbers in them
    for (let i = 0; i < n; i++) {
        if (a[i] % 2)
            odd1++;
        else
            even1++;
    }
 
    // Traverse in the second array
    // and count the number of odd
    // and even numbers in them
    for (let i = 0; i < m; i++) {
        if (b[i] % 2)
            odd2++;
        else
            even2++;
    }
 
    // Count the number of pairs
    let pairs = Math.min(odd1, even2) + Math.min(odd2, even1);
 
    // Return the number of pairs
    return pairs;
}
 
// Driver code
    let a = [ 9, 14, 6, 2, 11 ];
    let b = [ 8, 4, 7, 20 ];
    let n = a.length;
    let m = b.length;
    document.write(count_pairs(a, b, n, m));
 
 
// This code is contributed by Surbhi Tyagi.
 
</script>
Output: 
3
 
Attention reader! Don’t stop learning now. Get hold of all the important Comcompetitivepetitve Programming concepts with the Competitive Programming Live  course.



My Personal Notes
arrow_drop_up
Next

Count Pairs from two arrays with even sum
Recommended Articles
Page :
Count Pairs from two arrays with even sum
08, May 19
Count pairs (i, j) from arrays arr[] & brr[] such that arr[i] - brr[j] = arr[j] - brr[i]
22, Sep 20
Count pairs from two arrays having sum equal to K
15, Nov 18
Count pairs with Even Product from two given arrays
11, Dec 20
Count pairs from two arrays with difference exceeding K | set 2
02, Nov 20
Count equal pairs from given string arrays
15, Jul 19
Count pairs from two sorted arrays whose sum is equal to a given value x
23, Jun 17
Count of pairs between two arrays such that the sums are distinct
08, Jul 19
Count distinct pairs from two arrays having same sum of digits
23, Nov 18
Count pairs from two arrays with difference exceeding K
29, Oct 20
Maximum of even or odd product pairs count from given arrays
16, Dec 20
Count pairs formed by distinct element sub-arrays
26, May 16
Count pairs from two arrays whose modulo operation yields K
22, Nov 18
Max count of unique ratio/fraction pairs in given arrays
12, Jun 20
Number of pairs of arrays (A, B) such that A is ascending, B is descending and A[i] ≤ B[i]
22, Jan 20
Distinct pairs from given arrays (a[i], b[j]) such that (a[i] + b[j]) is a Fibonacci number
23, Apr 19
Total distinct pairs from two arrays such that second number can be obtained by inverting bits of first
04, Apr 19
Count pairs from an array whose quotient of division of larger number by the smaller number does not exceed K
03, Mar 21
Maximize count of pairs (i, j) from two arrays having element from first array not exceeding that from second array
21, Oct 20
Count of pairs from arrays A and B such that element in A is greater than element in B at that index
26, Mar 20
Check if two arrays can be made equal by swapping pairs of one of the arrays
03, Feb 21
Count number of pairs (i, j) such that arr[i] * arr[j] = arr[i] + arr[j]
06, Jan 20
Count number of pairs (A <= N, B <= N) such that gcd (A , B) is B
12, Jul 17
Count pairs (A, B) such that A has X and B has Y number of set bits and A+B = C
27, Nov 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
Striver
@Striver
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox