Cod sursa(job #2255526)
Utilizator | Data | 7 octombrie 2018 11:14:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int GCD(int a, int b)
{
if(b)
return GCD(b, a%b);
else return a;
}
int main()
{
int x;
int nr1, nr2;
fin >> x;
for(int i = 1; i <= x; i++)
{
fin >> nr1 >> nr2;
fout << GCD(nr1, nr2) << endl;
}
return 0;
}