Cod sursa(job #613202)
Utilizator | Zaharia Teofil t2010t | Data | 18 septembrie 2011 10:47:32 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream in("euclid.in");
ofstream out("euclid.out");
int n;
int euclid(int a, int b);
int main()
{
int i1, a, b;
in>>n;
for(i1=0;i1<n;i1++)
{
in>>a>>b;
out<<euclid(a, b)<<'\n';
}
in.close();
out.close();
return 0;
}
int euclid(int a, int b)
{
int r;
r = a%b;
while(r)
{
a = b;
b = r;
r = a%b;
}
return b;
}