Cod sursa(job #908937)
Utilizator | Data | 10 martie 2013 11:40:59 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
using namespace std;
int n,x,y;
int cmmdc(int x,int y)
{
if(y==0)
return x;
return cmmdc(y,x%y);
}
int main()
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d %d",&x,&y);
printf("%d\n",cmmdc(x,y));
}
return 0;
}