Cod sursa(job #1193088)
Utilizator | Data | 30 mai 2014 22:29:37 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
using namespace std;
int T,X,Y;
int cmmdc(int X,int Y)
{
int R=X%Y;
while (Y)
{
R=X%Y;
X=Y;
Y=R;
}
return X;
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d",&T);
while (T--)
{
scanf("%d%d",&X,&Y);
printf("%d\n",cmmdc(X,Y));
}
return 0;
}