Cod sursa(job #1908082)
Utilizator | Data | 6 martie 2017 22:37:22 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
long euclid(int a, int b){
if (b==0) return a;
else return euclid(b, a%b);
}
int main(){
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
long t;
long a, b;
int i;
scanf("%l", &t);
for (i = 0; i<t; i++){
scanf("%l", "%l", a, b);
printf("%l\n", euclid(a, b));
}
return 0;
}