Cod sursa(job #2165060)
Utilizator | Data | 13 martie 2018 11:02:45 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
int T, A, B;
int euclid(int a, int b)
{
if(!b) return a;
return euclid(b, a%b);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &T);
for(int i=T;i>0;i--)
{
scanf("%d %d", &A, &B);
printf("%d\n", euclid(A,B));
}
return 0;
}