Cod sursa(job #1409423)
Utilizator | Data | 30 martie 2015 15:24:31 | |
---|---|---|---|
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!=0)
{
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\n",&t);
while(t--)
{
scanf("%d %d\n",&a,&b);
printf("%d\n",gcd(a,b));
}
return 0;
}