Data Structure
Networking
RDBMS
Operating System
Java
MS Excel
iOS
HTML
CSS
Android
Python
C Programming
C++
C#
MongoDB
MySQL
Javascript
PHP
Physics
Chemistry
Biology
Mathematics
English
Economics
Psychology
Social Studies
Fashion Studies
Legal Studies
- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who
Find a number that divides maximum array elements in C++
In this tutorial, we are going to find the number that is divided into maximum elements in the given array.
Let's see the steps to solve the problem.
Initialize the array and a variable to store the result.
Iterate over the array.
Initialize the counter variable.
Iterate over the array again.
Increment the counter if the current element is divisible by the array element.
Update the result if the current count is maximum.
Print the result.
Example
Let's see the code.
#include <bits/stdc++.h>
using namespace std;
int numberWithMaximumMultiples(int arr[], int n) {
int result = -1;
for (int i = 0; i < n; i++) {
int count = 0;
for (int j = 0; j < n; j++) {
if (arr[i] % arr[j] == 0) {
count++;
}
}
if (count > result) {
result = count;
}
}
return result;
}
int main() {
int arr[] = {4, 24, 16, 3, 12, 28};
cout << numberWithMaximumMultiples(arr, 6) << endl;
return 0;
}Output
If you execute the above code, then you will get the following result.
4
Conclusion
If you have any queries in the tutorial, mention them in the comment section.
Updated on: 01-Feb-2021
106 Views
Advertisements