Cod sursa(job #2641512)
Utilizator | Data | 11 august 2020 18:14:37 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 40 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<bits/stdc++.h>
using namespace std;
int n,a,b;
int main(){
ifstream cin("euclid2.in");
ofstream cout("euclid2.out");
cin>>n;
for(int i=1;i<=n;i++){
cin>>a>>b;
int min1=min(a,b);
int max1=max(a,b);
while(min1>0){
int aux=min1;
min1=max1%min1;
max1=aux;
}
cout<<max1<<endl;
}
return 0;
}