Cod sursa(job #2641320)
Utilizator | Gafton Dinu dinugafton | Data | 11 august 2020 00:31:21 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include<bits/stdc++.h>
using namespace std;
int n;
long long a,b;
int euclid(int x, int y){
bool check=true;
while(check){
if(y==0)break;else{
x-=y;
if(x<y){
int aux=x;
x=y;
y=aux;
}
}
}
return x;
}
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);
cout<<euclid(max1,min1)<<"\n";
}
return 0;
}