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