# C++ Program to find Common Divisors

You are Here:

## What are Common Divisors?

A number that divides two or more numbers without remainder.

Tips: It is recommended to use our online common divisor calculator for better understanding.

## Examples

The following table provides few examples of common divisors of the given numbers.

NumbersCommon Divisors
4, 61, 2
12, 241, 2, 3, 4, 6, 12
15, 25, 501, 5

## Common Divisors of Two Numbers

In the following example, we will find the common divisors of numbers 12 and 24.

### Example

C++ Compiler
#include <iostream> using namespace std; int main() { int num1 = 12; int num2 = 24; int i, min; min = (num1 < num2) ? num1 : num2; cout << "Common Divisors of " << num1 <<" and " << num2 <<":\n"; for(i=1; i<=min; i++) { if((num1 % i == 0) && (num2 % i == 0)) cout << i <<" "; } return 0; }

### Output

Common Divisors of 12 and 24: 1 2 3 4 6 12

## Common Divisors of any Two Given Numbers

In the following example, we will find the common divisors of any two given numbers.

### Example

C++ Compiler
#include <iostream> using namespace std; int main() { int num1, num2, i, min; cout << "Enter (int) num1 = "; cin >> num1; cout << "Enter (int) num2 = "; cin >> num2; min = (num1 < num2) ? num1 : num2; cout << "\nCommon Divisors of " << num1 <<" and " << num2 <<":\n"; for(i=1; i<=min; i++) { if((num1 % i == 0) && (num2 % i == 0)) cout << i <<" "; } return 0; }

### Output

Enter (int) num1 = 2 Enter (int) num2 = 6 Common Divisors of 2 and 6: 1 2

## Reminder

Hi Developers, we almost covered 90% of String functions and Interview Question on C++ with examples for quick and easy learning.

We are working to cover every Single Concept in C++.

Please do google search for:

## Join Our Channel

Join our telegram channel to get an instant update on depreciation and new features on HTML, CSS, JavaScript, jQuery, Node.js, PHP and Python.

This channel is primarily useful for Full Stack Web Developer.