Cod sursa(job #822034)
| Utilizator | Data | 22 noiembrie 2012 21:08:34 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include<cstdio>
using namespace std;
long long a,b,T;
int i,r;
int cmmdc(int x, int y)
{
int z;
while(y!=0)
{
z=x%y;
x=y;
y=z;
}
return x;
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%lld",&T);
for(i=1;i<=T;i++)
{
scanf("%lld%lld",&a,&b);
printf("%d",cmmdc(a,b));
}
return 0;
}
