Cod sursa(job #894903)
Utilizator | Data | 27 februarie 2013 01:02:59 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int euclid(long int a, long int b)
{
while(a > 0)
{
long int t = a;
a = b%a;
b = t;
}
return b;
}
int main()
{
int n;
long int a, b;
in>>n;
for(int i=1; i<=n; i++)
{
in>>a>>b;
out<<euclid(a, b)<<'\n';
}
out.close();
return 0;
}