Cod sursa(job #917380)
Utilizator | Data | 17 martie 2013 19:10:14 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
int n,a,b;
int cmd(int x, int y){
int z;
if((z=x%y)==0){
return y;
}
else return cmd(x, y-z);
}
int main(void)
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
for (scanf("%d", &n); n>0; n--) {
scanf("%d %d", &a,&b);
printf("%d\n",cmd(a,b));
}
return 0;
}