Cod sursa(job #1135755)
Utilizator | Data | 8 martie 2014 13:09:59 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
using namespace std;
inline int _gcd(int a,int b){
int r;
while(b)
{
r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
int T,a,b;
scanf("%d",&T);
while(T--)
{
scanf("%d%d",&a,&b);
printf("%d\n",_gcd(a,b));
}
return 0;
}