Cod sursa(job #1725492)
Utilizator | Data | 5 iulie 2016 19:27:52 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <algorithm>
#include <fstream>
using namespace std;
int n, a, b;
int gcd(int a, int b) {
if (b)
return gcd(b, a % b);
return a;
}
int main() {
ifstream cin("euclid2.in");
ofstream cout("euclid2.out");
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
cout << gcd(a, b) << "\n";
}
return 0;
}