In this section we will see if an array contains n numbers we have to check if a number is generated using all the elements of these numbers and if the number is divisible by 3 . If the array elements are {15, 24, 23, 13} then we can make an integer like 15242313. Divisible by 3.
Begin rem := 0 for each element e in arr, do rem := (rem + e) mod 3 done if rem is 0, then return true end if return false End
#include<iostream> #define MAX 4 using namespace std; bool checkDivThree(int arr[], int n){ int rem = 0; for(int i = 0; i<n; i++){ rem = (rem + arr[i]) % 3; } if(rem == 0){ return true; } return false; } main() { int arr[] = {15, 24, 23, 13}; int n = sizeof(arr)/sizeof(arr[0]); if(checkDivThree(arr, n)){ cout << "Divisible"; }else{ cout << "Not Divisible"; } }
Divisible
The above is the detailed content of Check if it is possible to make a C/C++ program divisible by 3 using all the numbers in the array. For more information, please follow other related articles on the PHP Chinese website!