Cod sursa(job #1417012)
Utilizator | Data | 9 aprilie 2015 13:31:09 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <cstdio>
using namespace std;
int T,i;
long a,b;
long cmmdc(long a, long b)
{
long k;
while (b)
{
k=b;
b=a%b;
a=k;
}
return a;
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &T);
for (i=1; i<=T; i++)
{
scanf("%ld %ld", &a, &b);
printf("%ld\n", cmmdc(a,b));
}
return 0;
}