Test results - Codility

Tasks Details

easy

1. CountFactors

Count factors of given number n.

Task Score

100%

Correctness

100%

Performance

100%

A positive integer D is a factor of a positive integer N if there exists an integer M such that N = D * M.

For example, 6 is a factor of 24, because M = 4 satisfies the above condition (24 = 6 * 4).

Write a function:

def solution(N)

that, given a positive integer N, returns the number of its factors.

For example, given N = 24, the function should return 8, because 24 has 8 factors, namely 1, 2, 3, 4, 6, 8, 12, 24. There are no other factors of 24.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..2,147,483,647].

Solution

Programming language used Python

Time spent on task 66 minutes

Notes

not defined yet

Task timeline

Code: 06:58:48 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int N) {
        // write your code in Java SE 8
    }
}

Code: 07:43:16 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    # write your code in Python 3.6
    pass

Code: 07:43:36 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):
    print(N ** (1/2))

Analysis

expand all Example tests

▶

example1
example test (N=24=4!)

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

4.898979485566356

Code: 07:43:46 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):

    for i

Code: 07:44:04 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):

    for i in range(1, N ** (1/2)):
        print(i)

Analysis

expand all Example tests

▶

example1
example test (N=24=4!)

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Traceback (most recent call last):
  File "exec.py", line 123, in <module>
    main()
  File "exec.py", line 85, in main
    result = solution( N )
  File "/tmp/solution.py", line 6, in solution
    for i in range(1, N ** (1/2)):
TypeError: 'float' object cannot be interpreted as an integer

Code: 07:44:16 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):

    for i in range(1, int(N ** (1/2))):
        print(i)

Code: 07:44:20 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):

    for i in range(1, int(N ** (1/2))):
        print(i)

Analysis

expand all Example tests

▶

example1
example test (N=24=4!)

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

1
2
3

Code: 07:44:34 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

def solution(N):

    for i in range(1, floor(N ** (1/2))):
        print(i)

Code: 07:44:48 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    for i in range(1, math.floor(N ** (1/2))):
        print(i)

Analysis

expand all Example tests

▶

example1
example test (N=24=4!)

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

1
2
3

Code: 07:45:01 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    for i in range(1, math.floor(N ** (1/2) + 1)):
        print(i)

Analysis

expand all Example tests

▶

example1
example test (N=24=4!)

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

Code: 07:59:55 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    

    for i in range(1, math.floor(N ** (1/2) + 1)):
        print(i)

Code: 08:00:13 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    temp_num = math.floor(N ** (1/2))

    for i in range(1, math.floor(N ** (1/2) + 1)):
        print(i)

Code: 08:00:25 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

     = math.floor(N ** (1/2))

    for i in range(1, )):
        print(i)

Code: 08:00:40 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))

    for i in range(1, )):
        print(i)

Code: 08:00:54 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))

    for i in range(1, squre_root + 1):
        print(i)

Analysis

expand all Example tests

▶

example1
example test (N=24=4!)

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

stdout:

Code: 08:01:10 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))

    for i in range(1, squre_root + 1):
        if i

Code: 08:01:21 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))

    for i in range(1, squre_root + 1):
        if i * i == N:

Code: 08:01:32 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))
    answer = 0

    for i in range(1, squre_root + 1):
        if i * i == N:

Code: 08:02:08 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))
    answer = 0

    for i in range(1, squre_root + 1):
        if i * i == N:

Code: 08:02:21 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))
    answer = 0

    for i in range(1, squre_root + 1):
        if i * i == N:
            answer += 1 
            return answer

Code: 08:02:34 UTC, py, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))
    answer = 0

    for i in range(1, squre_root + 1):
        if i * i == N:
            answer += 1 
            return answer 
        
        answer += 2

Analysis

expand all Example tests

▶

example1
example test (N=24=4!)

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.036 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, int expected, <class 'NoneType'> found.

Code: 08:02:44 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))
    answer = 0

    for i in range(1, squre_root + 1):
        if i * i == N:
            answer += 1 
            return answer 
        
        answer += 2 
    return answer

Analysis

expand all Example tests

▶

example1
example test (N=24=4!)

✔

0.036 s

Code: 08:02:51 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))
    answer = 0

    for i in range(1, squre_root + 1):
        if i * i == N:
            answer += 1 
            return answer 
        
        answer += 2 
    return answer

Code: 08:02:58 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))
    answer = 0

    for i in range(1, squre_root + 1):
        if i * i == N:
            answer += 1 
            return answer 
        
        answer += 2 
    return answer

User test case 1:

[81]

Analysis

expand all Example tests

▶

example1
example test (N=24=4!)

✔

0.036 s

expand all User tests

▶

test_data1

✘

RUNTIME ERROR
invalid input, unexpected '[', expecting integer

0.001 s

RUNTIME ERROR, invalid input, unexpected '[', expecting integer

Code: 08:03:04 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))
    answer = 0

    for i in range(1, squre_root + 1):
        if i * i == N:
            answer += 1 
            return answer 
        
        answer += 2 
    return answer

User test case 1:

[81]

Analysis

expand all Example tests

▶

example1
example test (N=24=4!)

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 17

Code: 08:03:30 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))
    answer = 0

    for i in range(1, squre_root + 1):
        if i * i == N:
            answer += 1 
            return answer 
        
    return answer

Code: 08:03:43 UTC, py, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))
    answer = 0

    for i in range(1, squre_root + 1):
        if i * i == N:
            answer += 1 
            return answer 

        if N % i == 0:
            answer += 2 
    return answer

Code: 08:03:46 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))
    answer = 0

    for i in range(1, squre_root + 1):
        if i * i == N:
            answer += 1 
            return answer 

        if N % i == 0:
            answer += 2 
    return answer

User test case 1:

[81]

Analysis

expand all Example tests

▶

example1
example test (N=24=4!)

✔

0.036 s

expand all User tests

▶

test_data1

✔

0.036 s

OK
function result: 5

Code: 08:04:22 UTC, py, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))
    answer = 0

    for i in range(1, squre_root + 1):
        if i * i == N:
            answer += 1 
            return answer 

        if N % i == 0:
            answer += 2 
    return answer

User test case 1:

[81]

Analysis

expand all Example tests

▶

example1
example test (N=24=4!)

✔

0.040 s

expand all User tests

▶

test_data1

✔

0.040 s

OK
function result: 5

Code: 08:04:25 UTC, py, final, score: 100

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17

# you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")

import math
def solution(N):

    squre_root = math.floor(N ** (1/2))
    answer = 0

    for i in range(1, squre_root + 1):
        if i * i == N:
            answer += 1 
            return answer 

        if N % i == 0:
            answer += 2 
    return answer

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(sqrt(N))

expand all Example tests

▶

example1
example test (N=24=4!)

✔

0.036 s

expand all Correctness tests

▶

squares
N=16, N=36

✔

0.036 s

▶

tiny
N <= 10

✔

0.036 s

10.

0.036 s

▶

simple1
N=41(prime), N=42

✔

0.036 s

▶

simple2
N=69, N=64, N=120=5!

✔

0.036 s

▶

simple3
N=720=6!, N=1111

✔

0.036 s

▶

simple4
N=5,040=7!, N=12,345

✔

0.036 s

▶

simple5
N=34,879, N=40,320=8!

✔

0.036 s

▶

extreme_one
N=1

✔

0.036 s

expand all Performance tests

▶

medium1
N=362,880=9!, N=1,948,102

✔

0.036 s

▶

medium2
N=3,628,800=10!, N=5,621,892, N=4,999,696

✔

0.036 s

▶

big1
N=27,043,111, N=39,916,800=11!, N = 39,992,976

✔

0.036 s

▶

big2
N=97,093,212, N=2^28

✔

0.036 s

▶

big3
N=479,001,600=12!, N=780291637(prime), N=449,991,369

✔

0.036 s

0.040 s

▶

extreme_maxint
N=1,000,000,000, N=MAX_INT, N=2147,395,600

✔

0.040 s

0.044 s