Cod sursa(job #2419121)
| Utilizator |  retzler rainer |
Data | 7 mai 2019 18:13:53 |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.25 kb |
#include<iostream>
using namespace std;
int div(int a, int b){
int c;
while(a%b!=0){
a=a%b;
a=b;
b=c;
}
return b;
}
int main(){
int t,a,b,i;
cin>>t;
for(int i=1;i<=t;++i){
cin>>a>>b;
cout<<div(max(a,b),min(a,b))<<"\n";
}
return 0;
}