Cod sursa(job #2287591)
Utilizator | Data | 22 noiembrie 2018 08:53:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | c-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <stdio.h>
int t, a, b;
int gcd(int a, int b){
if (!b) return a;
return gcd(b, a%b);
}
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;
}