Cod sursa(job #2418716)
Utilizator | Data | 5 mai 2019 21:25:26 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-32 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b) {
int aux;
while (b != 0) {
aux = b;
b = a % b;
a = aux;
}
return a;
}
int gcdRec(int a, int b) {
if (b == 0) {
return a;
}
return gcdRec(b, a % b);
}
int main(){
ifstream input("euclid2.in");
ofstream output("euclid2.out");
int n;
input >> n;
int a, b;
for (int i = 0; i < n; i++) {
input >> a >> b;
output << gcdRec(a, b) << endl;
}
input.close();
output.close();
return 0;
}