Cod sursa(job #2707052)
Utilizator | Data | 16 februarie 2021 13:43:06 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
int gcd(int a, int b) {
if (!b) return a;
return gcd(b, a % b);
}
int main(void) {
ifstream in("euclid2.in");
ofstream out("euclid2.out");
int T;
in >> T;
for(int i =1;i<=T;i++)
{
int a,b;
in >> a >> b;
out << gcd(max(a,b),min(a,b)) << endl;
}
return 0;
}