Cod sursa(job #1704858)
Utilizator | Data | 19 mai 2016 14:58:54 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<cstdio>
using namespace std;
int cmmdc(int a, int b)
{
if(a % b == 0) return b;
else if(b % a == 0) return a;
return cmmdc(a % b, b % a);
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdin);
int t, a, b;
scanf("%d", &t);
for(int i = 1; i <= t; ++i)
{
scanf("%d%d", &a, &b);
printf("%d\n", cmmdc(a, b));
}
}