Cod sursa(job #1690511)
Utilizator | Data | 15 aprilie 2016 11:03:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <cstdio>
int a, b, t;
int GCD(int a, int b){
if(!b) return a;
else return GCD(b, a%b);
}
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));
}
return 0;
}