Cod sursa(job #2439347)
Utilizator | Data | 15 iulie 2019 18:18:17 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int A, B, i;
int gcd(int a, int b)
{
if(!b) return a;
else if(a > b) return gcd(a-b, b);
else return gcd(a, b-a);
}
int main()
{
fin >> i;
for(; i; i--) {
fin >> A >> B;
fout << gcd(A, B) << "\n";
}
return 0;
}