Cod sursa(job #2419122)
Utilizator | Data | 7 mai 2019 18:15:08 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.31 kb |
#include<iostream>
using namespace std;
#define min(a,b) (a>b?b:a)
#define max(a,b) (a<b?b:a)
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;
}