Cod sursa(job #1558946)
Utilizator | Data | 29 decembrie 2015 20:10:49 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <stdio.h>
using namespace std;
int T,i,x,y;
int cmmdc(long int a,long int b)
{if(b==0) return a;
return cmmdc(b, a % b);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &T);
for(i=1;i<=T;i++)
{scanf("%d %d", &x, &x);
printf("%d\n", cmmdc(x, y));
}
return 0;
}