Cod sursa(job #629865)
Utilizator | Remus Claudiu Dumitru remuque | Data | 4 noiembrie 2011 04:58:15 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b) {
if (b == 0) {
return a;
}
return gcd(b, b % a);
}
int main() {
int n;
int a, b;
ifstream in;
in.open("euclid2.in");
ofstream out;
out.open("euclid2.out");
in >> n;
for (int i = 0; i < n; ++i) {
in >> a >> b;
out << gcd(a, b) << "\n";
}
in.close();
out.close();
return 0;
}