Cod sursa(job #2230115)
Utilizator | Data | 9 august 2018 10:07:14 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int gcd(int a, int b) {
return (a == 0) ? b : gcd(b % a, a);
}
int main() {
int t;
fin >> t;
int a, b;
while (t-- > 0) {
fin >> a >> b;
fout << gcd(a, b) << "\n";
}
return 0;
}