Cod sursa(job #1025655)
Utilizator | Data | 10 noiembrie 2013 13:42:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<stdio.h>
inline int gcd(int a, int b){
if(! b)
return a;
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 = 1; i <= n; ++ i){
scanf("%d %d", &A, &B);
printf("%d\n", gcd(A, B));
}
return 0;
}