Cod sursa(job #2405085)
Utilizator | Data | 13 aprilie 2019 21:45:50 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <stdio.h>
int gcd(int a, int b);
int main(){
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
int n;
scanf("%d", &n);
for(int i=0; i<n; ++i){
int a; int b;
scanf("%d %d", &a, &b);
printf("%d\n", gcd(a,b));
}
}
int gcd(int a, int b){
if(b==0){
return a;
}
gcd(b, a%b);
}