Cod sursa(job #1388880)
Utilizator | Data | 15 martie 2015 19:43:57 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <cstdio>
using namespace std;
long int T,x,y;
int Euclid(long int a,long 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);
scanf("%ld\n",&T);
for (int i = 1; i <= T; i++)
{
scanf("%ld%ld\n",&x,&y);
printf("%d\n",Euclid(x,y));
}
}