Cod sursa(job #582215)
Utilizator | Data | 15 aprilie 2011 01:03:10 | |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
using namespace std;
// calculam cel mai mare divizor comun
int cmmdc(int a, int b)
{
while (b != 0) {
b = a % b;
a = b;
}
return a;
}
int main(void)
{
int T, i;
int a, b;
// redirectionam intrarea si iesirea
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &T);
for (i = 0; i < T; i++) {
scanf("%d %d", &a, &b);
printf("%d\n", cmmdc(a, b));
}
return 0;
}