Cod sursa(job #2352600)
Utilizator | Data | 23 februarie 2019 14:24:56 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <cstdio>
void swap(long &x,long &y){
x+=y;
y=x-y;
x-=y;
}
long euclid(long x,long y){
while(y){
x%=y;
swap(x,y);
}
return x;
}
int main() {
freopen("euclid.in","r",stdin);
freopen("euclid.out","w",stdout);
long t;
scanf("%ld",&t);
for(long i=0;i<t;++i){
long x,y;
scanf("%ld %ld",&x,&y);
printf("%ld\n",euclid(x,y));
}
return 0;
}