Cod sursa(job #362333)
Utilizator | Data | 8 noiembrie 2009 22:07:27 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<stdio.h>
int a,b,div,n;
int cmmdc(int x,int y)
{
int r;
while(x%y)
{
r=x%y;
x=y;
y=r;
}
return y;
}
int main ()
{
int i;
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d%d",&a,&b);
div=cmmdc(a,b);
printf("%d\n",div);
}
return 0;
}