Cod sursa(job #1409419)
Utilizator | Data | 30 martie 2015 15:22:12 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
#include <iostream>
using namespace std;
inline int gcd(const int a,const int b)
{
if(b==0)
return a;
return gcd(b,a%b);
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
cin.sync_with_stdio(false);
int t,a ,b;
cin >> t;
while(t--)
{
cin >> a >> b;
cout<<gcd(a,b)<<"\n";
}
return 0;
}