Cod sursa(job #1409424)
Utilizator | Data | 30 martie 2015 15:25:07 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
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);
int t,a ,b;
scanf("%d\n",&t);
while(t--)
{
scanf("%d %d\n",&a,&b);
printf("%d\n",gcd(a,b));
}
return 0;
}