Cod sursa(job #990253)
Utilizator | Data | 27 august 2013 19:52:32 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
int T;
int euclid(int a, int b){
int r;
while(b){
r = a % b;
a = b;
b = r;
}
return a;
}
int main(){
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
int a, b;
scanf("%d", &T);
for(int i = 0; i < T; ++i){
scanf("%d %d", &a, &b);
printf("%d\n", euclid(a, b));
}
return 0;
}