Cod sursa(job #2386804)
Utilizator | Data | 23 martie 2019 18:09:43 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
long long t,a,b,c;
int euclid(long long a,long long b )
{
if(b!=0)
return euclid(b,a%b);
else return a;
}
int main()
{
fin>>t;
for(int i=1;i<=t;i++)
{
fin>>a>>b;if (a<b) swap(a,b);
fout<<euclid(a,b)<<endl;
}
return 0;
}