Cod sursa(job #2193549)
Utilizator | Data | 10 aprilie 2018 14:51:48 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int a, b, n;
int eucl(int a,int b)
{
int r=0;
while(b)
{
r=a%b;
a=b;
b=r;
}
return a;
}
int main ()
{
f>>n;
for(int i=1; i<=n; i++)
{
f>>a>>b;
g<<eucl(a, b)<<endl;
}
return 0;
}