Cod sursa(job #1872682)
Utilizator | Data | 8 februarie 2017 14:50:18 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.25 kb |
#include <bits/stdc++.h>
using namespace std;
int i,n,a,b;
int gcd(int a, int b)
{
if (!b) return a;
return gcd(b, a % b);
}
int main(){
cin>>n;
for (i=1;i<=n;i++)
{
cin>>a>>b;
cout<<gcd(a,b);
}
return 0;
}