Cod sursa(job #1047541)
Utilizator | Data | 4 decembrie 2013 17:31:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
using namespace std;
ifstream f("euclid2.in");
ofstream g("euclid2.out");
int n;
long long a1,b1;
int euclid(long long a,long long b)
{
if(a==b)
return a;
else
if(a>b)
return euclid(a-b,b);
else
return euclid(a,b-a);
}
int main()
{
f>>n;
for(int i=1;i<=n;i++)
{
f>>a1>>b1;
g<<euclid(a1,b1)<<"\n";
}
return 0;
}