mellowg

https://www.acmicpc.net/problem/1110

const fs = require('fs');
const input = fs.readFileSync('/dev/stdin').toString().trim();

const T = Number(input);
let cnt = 1;
let N = input.split("");
let M = 0;

N.forEach((n) => {
    M += Number(n);
});

M = M.toString().split("");
let W = N[N.length-1].concat(M[M.length-1]);

while(true) {
    if(Number(W) === T) break;
    N = W.split("");
    M = 0;
    N.forEach((n) => {
        M += Number(n);
    });
    M = M.toString().split("");
    W = N[N.length-1].concat(M[M.length-1]);
    cnt++;
}
console.log(cnt);

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

function getDivisorCnt(number) {
    let cnt = 0;
    for(let i = 1; i <= number; i++) {
        if(number%i === 0) cnt++;
    }
    return cnt;
}

function solution(left, right) {
    var answer = 0;
    for(let i = left; i <= right; i++) {
        if(getDivisorCnt(i)%2 === 0) answer += i;
        else answer -= i;
    }
    return answer;
}

크기가 작은 부분 문자열

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

function solution(t, p) {
    const LEN = p.length;
    let answer = 0;
    for(let i = 0; i < t.length - LEN + 1; i++) {
        let str = t.slice(i, i+LEN);
        if(Number(str) <= Number(p)) answer++;
    }
    
    return answer;
}

이상한 문자 만들기

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

function solution(s) {
    var answer = [];
    s = s.split(" ");

    s.forEach((str) => {
        const arr = [];
        str = str.split("");
        str.forEach((d, index) => {
           if(index % 2 === 0) {
               arr.push(d.toUpperCase());
           } 
            else {
                arr.push(d.toLowerCase());
            }
        });
        answer.push(arr.join(""));
    });
    
    return answer.join(" ");
}