Cod sursa(job #2951275)
| Utilizator | Data | 5 decembrie 2022 20:38:21 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
int euclidAlgorithm(int a, int b){
int gcd;
if(a < b){
swap(a, b);
}
if (b != 0) {
gcd = a%b;
} else {
gcd = a;
}
if (b != 0){
return euclidAlgorithm(gcd, b);
}
return gcd;
}
int main()
{
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int t;
fin >> t;
for (int i = 1; i <= t; ++i){
int a, b;
fin >> a >> b;
fout << euclidAlgorithm(a, b) << "\n";
}
}
