Cod sursa(job #1210280)
Utilizator | Ionut Anghelina ionanghelina | Data | 19 iulie 2014 16:16:43 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<cstdio>
using namespace std;
long t;
long long a,b;
long long cmmdc(long long x,long long y)
{
long long r=x%y;
while (r)
{
x=y;y=r;
r=x%y;
}
return y;
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%ld",&t);
for (long i=1;i<=t;i++)
{
scanf("%lld%lld",&a,&b);
printf("%lld\n",cmmdc(a,b));
}
return 0;
}