Cod sursa(job #535169)
Utilizator | Data | 16 februarie 2011 20:34:25 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
long a,b,x,t,i,n;
long euclid(long x,long y){
int r;
while (r){
r=x%y;
x=y;
y=r;
}
return(x);
}
int main(){
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%ld",&n);
for (i=1; i<=n; i++){
scanf("%ld %ld",&a,&b);
t=euclid(a,b);
printf("%ld\n",t);
}
return(0);
}