Cod sursa(job #660515)
Utilizator | Data | 13 ianuarie 2012 01:31:49 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
int T, A, B;
int gcd(int a, int b)
{
while (a!=b)
if (a==b)
return a;
else if (a>b)
a=a-b;
else
b=b-a;
return a;
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &T);
for (; T; --T)
{
scanf("%d %d", &A, &B);
printf("%d\n", gcd(A, B));
}
return 0;
}