Cod sursa(job #2018661)
| Utilizator | Data | 5 septembrie 2017 16:42:02 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include <stdio.h>
//InfoArena
//Euclid
int n, A, B;
int cmmdc(int a, int b) {
if (a < b) {
int aux = a;
a = b;
b = aux;
}
while (a % b != 0) {
int reminder = a % b;
a = b;
b = reminder;
}
return b;
}
int main() {
freopen("euclid2.in", "r", stdin);
freopen("euclid2.out", "w", stdout);
scanf("%d", &n);
for (; n; --n)
{
scanf("%d %d", &A, &B);
printf("%d\n", cmmdc(A, B));
}
return 0;
}
