Cod sursa(job #1412100)
Utilizator | Data | 1 aprilie 2015 09:31:29 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int T, x, y;
int euclid(int x, int y)
{
if (x>y) swap(x, y);
if (x==0) return y;
return euclid(y%x, x);
}
int main()
{
f>>T;
while (T--)
f>>x>>y, g<<euclid(x, y)<<'\n';
return 0;
}