Cod sursa(job #2129579)
Utilizator | Data | 12 februarie 2018 22:18:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
using namespace std;
// infoarena: Algoritmul lui Euclid
int gcd(int a, int b){
if(a==0) return b;
return gcd(b%a,a);
}
int main(){
int n;
cin >> n;
int ar[n];
for(int i=0;i<n;i++){
int x,y;
cin>>x>>y;
ar[i] = gcd(x,y);
}
for(int i=0;i<n;i++){
cout << ar[i] << '\n';
}
return 0;
}