Cod sursa(job #1096606)
Utilizator | Data | 2 februarie 2014 13:26:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <stdio.h>
int T, A, B;
int gcd(int X, int Y)
{
if (Y == 0)
{
return X;
}
else
return gcd(Y, X % Y);
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d", &T);
while(T--)
{
scanf("%d %d", &A, &B);
printf("%d\n", gcd(A, B));
}
}