Cod sursa(job #3347733)
| Utilizator | Data | 18 martie 2026 09:08:56 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <bits/stdc++.h>
using namespace std;
int eucl(int a,int b){
if(b%a==0){
return a;
}
int x=b-((b/a)*a),y=a;
return eucl(min(x,y),max(x,y));
}
int main(){
ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
int T;cin>>T;
while(T--){
int a,b;cin>>a>>b;
cout<<eucl(min(a,b),max(a,b))<<'\n';
}
}