Cod sursa(job #2041176)
| Utilizator | Data | 16 octombrie 2017 22:02:49 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | c | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include <stdio.h>
int gcd(int a, int b){
if(b == 0){
return a;
}else{
return gcd(b, a % b);
}
}
int main(void)
{
int a, b, T;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &T);
for(int i = T; i > 0; --i){
scanf("%d %d", &a, &b);
printf("%d", gcd(a,b));
printf("\n");
}
return 0;
}