// A product of a pair of integers will always be odd if at least 2 of them are odd
#include <stdio.h>
int 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]);
printf("%d\n", arrayContainsAPairOfOddProduct(arr, size));
return 0;
}
/*
run:
1
*/