Cod sursa(job #154624)
Utilizator | Data | 11 martie 2008 12:32:17 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include<stdio.h>
long a,b;
long euclid(long a,long b){
if(b==0) return a;
else return euclid(b,a%b);
}
int main()
{ int t,i;
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%ld",&t);
for(i=1;i<=t;i++){
scanf("%ld %ld",&a,&b);
a=euclid(a,b);
printf("%ld",a);
}
return 0;
}