Cod sursa(job #1216323)
Utilizator | Data | 4 august 2014 10:09:10 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <stdio.h>
using namespace std;
int euclid(int a, int b)
{
int r;
while( a % b != 0 )
{
r = a % b;
a = b;
b = r;
}
return b;
}
int a,b,n,i;
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d %d",&a,&b);
printf("%d\n",euclid(a,b));
}
return 0;
}