Cod sursa(job #1747430)
Utilizator | Data | 24 august 2016 21:34:48 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <stdio.h>
int gcd(int a, int b){
if(a == 0){
return b;
}
return gcd(b%a, a);
}
int main(){
freopen("euclid2.in","r", stdin);
freopen("euclid2.out","w", stdout);
int number, nr1, nr2;
scanf("%d", &number);
while(number--) {
scanf("%d %d", &nr1, &nr2);
printf("%d\n", gcd(nr1, nr2));
}
return 0;
}