Cod sursa(job #3362225)
| Utilizator | Data | 4 august 2026 15:07:06 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 20 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc(int a, int b){
if(a == 0) return b;
else if (b == 0) return a;
else if(a > b) return cmmdc(b, a % b);
else if(a < b) return cmmdc(a, b % a);
return 0;
}
int main(){
int T;
fin >> T;
for(int i = 1; i <= T; i++){
int x, y;
fin >> x >> y;
fout << cmmdc(x, y) << endl;
}
return 0;
}