Cod sursa(job #738540)
Utilizator | Birsan Dragos hominidu | Data | 20 aprilie 2012 19:48:31 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <stdio.h>
long cmmdc (long a, long b){
long c;
while (b){
c = a % b;
a = b;
b = c;
}
return a;
}
int main () {
int n,i;
long a,b;
freopen("euclid.in","r",stdin);
freopen("euclid.out","w",stdout);
scanf("%d",&n);
for(i = 0 ; i < n ; i++){
scanf("%ld%ld",&a,&b);
printf("%ld\n",cmmdc(a,b));
}
fclose(stdin);
fclose(stdout);
return 0;
}