hancorg_hexlet
Version:
My first project on Hexlet
36 lines (26 loc) • 927 B
JavaScript
;
Object.defineProperty(exports, "__esModule", {
value: true
});
exports.default = void 0;
var _ = _interopRequireDefault(require(".."));
var _utils = _interopRequireDefault(require("../utils"));
function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }
const findGcd = (divisorOne, divisorTwo) => {
for (let i = Math.min(divisorOne, divisorTwo); i > 1; i -= 1) {
if (divisorOne % i === 0 && divisorTwo % i === 0) {
return i;
}
}
return 1;
};
const rule = 'Find the greatest common divisor of given numbers.';
const gcd = () => {
const numberOne = (0, _utils.default)(1, 99);
const numberTwo = (0, _utils.default)(1, 99);
const trueAnswer = String(findGcd(numberOne, numberTwo));
const question = `${numberOne} ${numberTwo}`;
return [question, trueAnswer];
};
var _default = () => (0, _.default)(rule, gcd);
exports.default = _default;