LV. 0 :: 순서쌍의 개수

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

프로그래머스

 

function solution(n) {
    var answer = 0;
    for (i=1; i<=n; i++)
    {
        if (n%i==0) {answer ++;}
    }
    return answer;
}

+230512

const solution = (n) => { 
    let arr = [];
    for(i=1; i<=n; i++) {if(n%i==0) arr.push(i);} 
    return arr.length;
}

230526 python

def solution(n):
    answer = 0
    for i in  range(1, n+1):
        if n%i==0:
            answer += 1
    return answer

230916 C++

#include <string>
#include <vector>

using namespace std;

int solution(int n) {
    int answer = 0;
    for(int i=1; i<=n; i++){
        if(n%i==0) answer ++;
    }
    return answer;
}