Cod sursa(job #274091)
Utilizator | Data | 9 martie 2009 13:38:06 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <stdio.h>
int a, b, n;
int cmmdc(int a, int b)
{
if(!b)
return a;
else
return cmmdc(b, a%b);
}
int main(void)
{
freopen("euclid2.in","r",stdin);
freopen("euclid2.out","w",stdout);
scanf("%d", &n);
for( int i = 1; i <= n; i++)
{
scanf("%d%d", &a,&b);
printf("%d\n", cmmdc(a,b));
}
fcloseall();
return 0;
}