Cod sursa(job #321755)
Utilizator | Data | 7 iunie 2009 11:16:18 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<stdio.h>
int t,a,b;
int div(int a, int b)
{
if(!b) return a;
return div(b, a % b);
}
int main(void)
{
freopen("euclid.in","r",stdin);
freopen("euclid.out","w",stdout);
scanf("%d",&t);
while(t)
{
scanf("%d %d",&a,&b);
printf("%d\n",div(a,b));
}
return 0;
}