Cod sursa(job #2177421)
Utilizator | Data | 18 martie 2018 16:24:01 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gdc(int a, int b) {
int r = 1;
while (r) {
r = a % b;
a = b;
b = r;
}
return a;
}
int main() {
int n, a, b;
fin >> n;
while (n--) {
fin >> a >> b;
fout << gdc(a, b) << '\n';
}
fout.close();
return 0;
}