Cod sursa(job #1328574)
Utilizator | Data | 28 ianuarie 2015 15:46:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
int n,x,y;
int euclid(int a,int b)
{ int rest=0;
while(b!=0)
{
rest=a%b;
a=b;
b=rest;
}
return a;
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d%d",&x,&y);
printf("%d\n",euclid(x,y));
}
return 0;
}