Cod sursa(job #1217213)
Utilizator | Data | 6 august 2014 21:31:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.35 kb |
#include<stdio.h>
int aux,n,x,y;
int cmmdc(int a, int b)
{
if(b == 0)
{
return a;
}
else return cmmdc(b, a % b);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &n);
for(int i = 1; i <= n; i++)
{
scanf("%d %d", &x, &y);
printf("%d \n", cmmdc(x,y));
}
return 0;
}