[codility] Lesson 10. Prime and composite numbers - CountFactors

https://app.codility.com/programmers/lessons/10-prime_and_composite_numbers/count_factors/

CountFactors coding task - Learn to Code - Codility

 

 

• 양의 정수 N이 주어질 경우, N의 약수 개수 구하기
• O(sqrt(N))

 

import math
def solution(N):
    cnt = 0
    for D in range(1, int(math.sqrt(N))+1):
        if N % D == 0:
            if D*D == N:
                cnt = cnt + 1
                break
            else:
                cnt = cnt + 2
    return cnt