Cod sursa(job #2479610)
Utilizator | Data | 24 octombrie 2019 06:45:27 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <iostream>
int gcd(int a, int b){
if (b == 0) return a;
else return gcd(b,a%b);
}
int main() {
int n, a, b;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &n);
for (int i = 0; i<n; ++i){
scanf("%d %d", &a, &b);
printf("%d/n", gcd(a, b));
}
return 0;
}