The largest number that divides two or more numbers is the Greatest Common Divisor (GCD) for those numbers.

For example: Let’s say we have two numbers 45 and 27.

```
95 = 5 * 13
30 = 2 * 3 * 5
```

So, the GCD of 95 and 30 is 5.

**Program Code:**

```
#include <iostream>
using namespace std;
int gcd(int a, int b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int main() {
int a = 95, b = 30;
cout<<"GCD of "<< a <<" and "<< b <<" is "<< gcd(a, b);
return 0;
}
```

**Output:**

`GCD of 95 and 30 is 5`

gcd() is a recursive function in the preceding program. It contains two parameters, a and b. If b exceeds zero, a is returned to the main() function. Otherwise, the gcd() function calls itself recursively with the values b and a%b.

*Note: also read about* Input and Output in Python

**Follow Me**

Please follow me to read my latest post on programming and technology if you like my post.

https://www.instagram.com/coderz.py/

https://www.facebook.com/coderz.py

Staying up to the mark is what defines me. Hi all! I’m Rabecca Fatima a keen learner, great enthusiast, ready to take new challenges as stepping stones towards flying colors.