Cod sursa(job #1152890)
Utilizator | Data | 25 martie 2014 08:20:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
inline int lnko (int a, int b)
{
int r = 1;
while (r != 0)
{
r = a%b;
a = b;
b = r;
}
return a;
}
int t, a, b, i;
int main()
{
f >> t;
for (i=1; i<=t; i++)
{
f >> a >> b;
g << lnko(a, b) << "\n";
}
}