Cod sursa(job #1894150)
Utilizator | Teodor Poncu Ilustru | Data | 26 februarie 2017 15:50:46 |
---|---|---|---|
Problema | Algoritmul lui Euclid | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
//
// Created by Teodor Poncu on 2/26/17.
//
#include <iostream>
int cmmdc(int a, int b) {
while(b) b ^= a ^= b ^= a %= b;
return a;
}
int main() {
int a, b, count;
std::freopen("euclid2.in", "r", stdin);
std::freopen("euclid2.out", "w", stdout);
scanf("%d", &count);
for(; count; --count) {
scanf("%d %d", &a, &b);
printf("%d\n", cmmdc(a, b));
}
return 0;
}