개발야옹

https://school.programmers.co.kr/learn/courses/30/lessons/120878

const gcd = (num1, num2) => {
    let result = -1;
    for(let i = 2; i <= Math.min(num1, num2) ; i++) {
        if(num1 % i === 0 && num2 % i === 0 ) {
            result = i;
        }
    }
    return result;
}

const solve = (num) => {
    const arr = [];
    let i = 2;
    while(i <= num) {
        if(num % i !== 0) {
            i++;
        } else {
            arr.push(i);
            num = num / i;
            i = 2;
        }
    }
    return arr;
}

function solution(a, b) {
    var answer = 0;
    while(gcd(a,b) > 0) {
        const Gcd = gcd(a,b);
        a = a/Gcd;
        b = b/Gcd;
    }
    
    const result = solve(b).filter(a => a !== 2 && a !== 5);
    
    return result.length === 0 ? 1 : 2;
}