Cod sursa(job #2425925)
Utilizator | Data | 25 mai 2019 13:43:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <fstream>
using namespace std;
int euclid(int a ,int b)
{
if(!b) return a;
return euclid(b, a %b);
}
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int a, b, n;
fin >> n;
for(int i = 0; i<n; i++)
{
fin >> a >> b;
fout << euclid(a, b) <<'\n';
}
}