Cod sursa(job #774084)
Utilizator | Data | 3 august 2012 13:57:57 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<iostream.h>
long cmmdc(long a,long b)
{
while(a!=b)
if(a>b)
a-=b;
else
b-=a;
return a;
}
int main()
{
long t,a,b,c;
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%ld",&t);
for(int i=0;i<t;i++)
{
scanf("%ld%ld",&a,&b);
c=cmmdc(a,b);
printf("%ld",c);
}
return 0;
}