[Programmers] 합성수 찾기

 

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

프로그래머스

 

 

def solution(n):
    answer = 0
    
    for i in range(n) :
        a = 0
        for j in range(i+1) :
            if (i+1) % (j+1) == 0:
                a+=1
        if a >= 3 :
            answer+=1
    
    return answer

 

 

def get_divisors(n) :
	return list(filter(lambda v: n % v == 0, range(1, n+1)))

def solution(n) :
	return len(list(filter(lambda v: len(get_divisors(v)) >=3, range(1, n+1))))

def solution(n) :
	output = 0
    for i in range(4, n+1) :
    	for j in range(2, int(i ** 0.5) +1):
        	if i % j == 0:
            	ouput += 1
                break
    return output

def solution(n) :
	num = []
    answer = 0
    
    for i in range(2, n+1) :
    	for j in range(1, i+1) :
        	if i % j == 0:
            	num.append(i)
        
        if num.count(i) >= 3: 
        	answer += 1
            
    return answer