Cod sursa(job #3156148)
Utilizator | Data | 10 octombrie 2023 17:53:13 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
std::ifstream fin("euclid.in");
std::ofstream fout("euclid.out");
int cmmdc(int a, int b){
if(b == 0)
return a;
return cmmdc(b, a % b);
}
int main(){
int n;
fin >> n;
int x, y;
for(int i = 1; i <= n; i++){
fin >> x >> y;
fout << cmmdc(std::max(x, y), std::min(x, y)) << "\n";
}
}