Cod sursa(job #1118313)
Utilizator | Data | 24 februarie 2014 09:58:38 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
using namespace std;
int t, a, b, i;
int cmmdc(int a, int b)
{
if(!b) return a;
else 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", &a, &b);
printf("%d\n", cmmdc(a,b));
}
return 0;
}