Cod sursa(job #2053191)
Utilizator | Data | 31 octombrie 2017 16:48:25 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
std::ifstream Input("euclid2.in");
std::ofstream Output("euclid2.out");
unsigned long Euclid(unsigned long a, unsigned long b)
{
if (a > b)
{
if (a%b == 0)
return b;
return Euclid(a-b, b);
}
else
{
if (b%a == 0)
return a;
return Euclid(a, b-a);
}
}
int main(void)
{
unsigned int n;
Input >> n;
unsigned long a, b;
while (Input >> a)
{
Input >> b;
Output << Euclid(a, b) << "\n";
}
return 0;
}