Cod sursa(job #1220532)
Utilizator | Data | 17 august 2014 16:22:10 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
int a, b, t;
int cmmdc(int a, int b)
{
if(!b) return a;
return cmmdc(b, a%b);
}
void rezolva_problema()
{
int i;
scanf("%d", &t);
for(i=1;i<=t;++i)
{
scanf("%d%d", &a, &b);
printf("%d\n", cmmdc(a,b));
}
}
int main()
{
freopen("euclid2.in","r", stdin);
freopen("euclid2.out", "w", stdout);
rezolva_problema();
return 0;
}