path: root / Sem. 03 / GCD_solution3_Eucid.cpp


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25

#include <iostream>

using namespace std;

int main()
{
	int n, k;

	cin >> n >> k;

	if (n < k) //swap
	{
		int temp = n;
		n = k;
		k = temp;
	}
	
	while (k != 0)
	{
		int div = n % k;
		n = k;
		k = div;
	}
	cout << n << endl;
}