Cod sursa(job #2327366)
Utilizator | Data | 24 ianuarie 2019 17:46:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int gcd(int a, int b)
{
if(a==b) return a;
if(a>b) return gcd(a-b,b);
if(b>a) return gcd(a,b-a);
return 1;
}
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int T, a, b;
fin >> T;
for (;T;T--)
{
fin>>a>>b;
fout<<gcd(a,b)<<"\n";
}
fin.close();
fout.close();
return 0;
}