Cod sursa(job #803249)
Utilizator | Data | 27 octombrie 2012 11:46:24 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include <stdio.h>
int divizor(int x, int y)
{
if (!y) return 0;
return divizor(y,x%y);
}
int main(){
int x,y,n;
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d",&n);
for (; n; --n)
{
scanf("%d %d",&x,&y);
printf("%d\n",divizor(x,y));
}
return 0;
}