Question

How to check if an array contains a pair of numbers whose product is odd in C++

Answer 1

// A product of a pair of integers will always be odd if at least 2 of them are odd

#include <vector>
#include <iostream>
 
bool arrayContainsAPairOfOddProduct(std::vector<int> &arr) {
    int oddCount = 0;
 
    for (int i = 0; i < arr.size(); i++) {
        if (arr[i] % 2 != 0) {
            oddCount++;
            if (oddCount == 2) {
                break;
            }
        }
    }
 
    return oddCount > 1;
}
 
int main()
{
    std::vector<int> arr = {2, 2, 4, 4, 6, 6, 7, 10, 10, 9}; // 7 * 9 = 63 -> Odd
 
    std::wcout << arrayContainsAPairOfOddProduct(arr) << std::endl;
}
 
 
 
/*
run:
 
1
 
*/

 

70+ SQL courses for beginners and professionals

Answer 2

#include <iostream>

bool arrayContainsAPairOfOddProduct(int arr[], int size) {
	int oddCount = 0;

	for (int i = 0; i < size; i++) {
		if (arr[i] % 2 != 0) {
			oddCount++;
			if (oddCount == 2) {
				break;
			}
		}
	}

	return oddCount > 1;
}

int main()
{
	int arr[] = {2, 2, 4, 4, 6, 6, 7, 10, 10, 9}; // 7 * 9 = 63 -> Odd
	int size = sizeof(arr) / sizeof(arr[0]);

	std::wcout << arrayContainsAPairOfOddProduct(arr, size) << std::endl;
}



/*
run:

1

*/

 

70+ SQL courses for beginners and professionals