Question

How to find an array element that are divisible by all array elements in C++

Answer 1

#include <iostream>

using namespace std;

int find_element_divisible_by_all_elements(int arr[], int len) { 
    for (int i = 0; i < len; i++) { 
        int j; 
        for (j = 0; j < len; j++) { 
            if (arr[j] % arr[i])  
                break; 
        }
        if (j == len) 
            return arr[i]; 
    } 
    return -1; 
} 

int main() 
{ 
    int arr[] = { 18, 30, 12, 3, 33, 27, 45 }; 
    
    cout << find_element_divisible_by_all_elements(arr, sizeof(arr) / sizeof(int)); 
    
    return 0; 
} 



/*
run:

3

*/

 

70+ SQL courses for beginners and professionals