Cod sursa(job #1426308)
Utilizator | Data | 29 aprilie 2015 13:43:28 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
void swapNumbers(int& a, int &b)
{
a = a ^ b;
b = a ^ b;
a = a ^ b;
}
int cmmdc(int a, int b)
{
/*set a as largest element*/
if(a < b)
{
swapNumbers(a,b);
}
while(a != 0)
{
if(a % b == 0)
{
return b;
}
else
{
int r = a % b;
a = b;
b = r;
}
}
}
int main()
{
int a, b;
while(1)
{
std::cin >> a >> b;
std::cout << "Cmmdc = " << cmmdc(a,b) << "\n";
}
}