greatest common divisor

The greatest common divisor (GCD) of two or more none-zero integers, is the largest positive integer that divides each of the integers. For example, the GCD of 8, 12, 16 is 4.
```
#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 = 105, b = 30;
   cout<<gcd(a, b);
   return 0;
}
```
Home