Cod sursa(job #2595997)
Utilizator | Data | 8 aprilie 2020 22:02:02 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int t, a, b;
int euclid(int x, int y)
{
if(!y)
return x;
else
return euclid(y, x % y);
}
int main()
{
f >> t;
while(t)
{
f >> a >> b;
if(a < b)
swap(a, b);
g << euclid(a, b) << '\n';
t--;
}
f.close();
g.close();
return 0;
}