Cod sursa(job #1484285)
Utilizator | Data | 10 septembrie 2015 18:55:10 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<fstream>
long int n,q,k;
using namespace std;
long int gcd(int a,int b)
{
if (a==0){return b;}
else {return gcd(b%a,a);}
}
int main()
{
ifstream fi("euclid2.in");
ofstream fo("euclid2.out");
fi>>n;
for (int i=0;i<n;++i)
{
fi>>q>>k;
if (q>k){fo<<gcd(k,q)<<endl;;}
else {fo<<gcd(q,k)<<endl;;}
}
fi.close();fo.close();
return 0;
}