Cod sursa(job #1197683)
Utilizator | Daniel Dumitrascu Volcom | Data | 13 iunie 2014 12:42:15 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <iostream>
using namespace std;
int cmmdc(int a, int b)
{
while(1)
{
if(!a)
return b;
else if(!b)
return a;
else
{
if(a > b)
a -= b;
else
b -= a;
}
}
}
int main()
{
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
int max;
int a, b;
scanf("%d", &max);
for(int i = 0; i < max; ++i)
{
scanf("%d %d", &a, &b);
printf("%d\n", cmmdc(a, b));
}
return 0;
}