Cod sursa(job #3297191)
Utilizator | Data | 21 mai 2025 23:55:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("euclid2.in");
ofstream fout("euclid2.out");
int cmmdc(int a, int b){
if(b > a){
int aux = b;
b = a;
a = aux;
}
while(b != 0){
int r = a%b;
a = b;
b = r;
}
return a;
}
int main(){
int n;
cin >> n;
while(n--){
int a,b;
cin >> a >> b;
cout << cmmdc(a,b) << '\n';
}
return 0;
}