Cod sursa(job #2718119)
Utilizator | Data | 8 martie 2021 14:49:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.29 kb |
#include <fstream>
int gcd(int a, int b) {
if(!b) return a;
return gcd(b, a%b);
}
int main() {
std::ifstream fin("euclid.2.in");
std::ofstream fout("euclid2.out");
int t;
fin>>t;
while(t--) {
int a, b;
fin>>a>>b;
if(a<b) std::swap(a, b);
fout<<gcd(a, b)<<"\n";
}
}