Cod sursa(job #1370137)
| Utilizator | Data | 3 martie 2015 13:07:25 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using std::endl;
using std::fstream;
using std::ios;
unsigned long long gcd(unsigned long long, unsigned long long);
int main() {
fstream in("euclid2.in", ios::in);
fstream out("euclid2.out", ios::out);
unsigned T;
unsigned long long a, b;
in >> T;
while (T--) {
in >> a >> b;
out << gcd(a, b) << endl;
}
in.close();
out.close();
return 0;
}
unsigned long long gcd(unsigned long long a, unsigned long long b) {
if (!b) {
return a;
}
return gcd(b, a % b);
}