Test results - Codility

Tasks Details

medium

1. CommonPrimeDivisors

Check whether two numbers have the same prime divisors.

Task Score

100%

Correctness

100%

Performance

100%

A prime is a positive integer X that has exactly two distinct divisors: 1 and X. The first few prime integers are 2, 3, 5, 7, 11 and 13.

A prime D is called a prime divisor of a positive integer P if there exists a positive integer K such that D * K = P. For example, 2 and 5 are prime divisors of 20.

You are given two positive integers N and M. The goal is to check whether the sets of prime divisors of integers N and M are exactly the same.

For example, given:

N = 15 and M = 75, the prime divisors are the same: {3, 5};

N = 10 and M = 30, the prime divisors aren't the same: {2, 5} is not equal to {2, 3, 5};

N = 9 and M = 5, the prime divisors aren't the same: {3} is not equal to {5}.

Write a function:

def solution(A, B)

that, given two non-empty arrays A and B of Z integers, returns the number of positions K for which the prime divisors of A[K] and B[K] are exactly the same.

For example, given:

A[0] = 15 B[0] = 75 A[1] = 10 B[1] = 30 A[2] = 3 B[2] = 5

the function should return 1, because only one pair (15, 75) has the same set of prime divisors.

Write an efficient algorithm for the following assumptions:

Z is an integer within the range [1..100,000];

each element of arrays A and B is an integer within the range [1..2,147,483,647].

Solution

Programming language used Python

Time spent on task 5 minutes

Notes

not defined yet

Code: 07:19:26 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[] A, int[] B) {
        // write your code in Java SE 8
    }
}

Code: 07:19:30 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(A, B):
    # write your code in Python 3.6
    pass

Code: 07:20:17 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 18

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

def gcd(a, b):
    if a < b:
        a, b = b, a
    if a % b == 0:
        return b
    return gcd(b, a % b)

def check(a, b):
    if a < b:
        a, b = b, a
    

def solution(A, B):
    # write your code in Python 3.6
    pass

Code: 07:20:28 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 18 19

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

def gcd(a, b):
    if a < b:
        a, b = b, a
    if a % b == 0:
        return b
    return gcd(b, a % b)

def check(a, b):
    if a < b:
        a, b = b, a
    while a > 1:
        

def solution(A, B):
    # write your code in Python 3.6
    pass

Code: 07:20:58 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 18 19

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

def gcd(a, b):
    if a < b:
        a, b = b, a
    if a % b == 0:
        return b
    return gcd(b, a % b)

def check(a, b):
    if a < b:
        a, b = b, a
    while a != 1:
        div = gcd

def solution(A, B):
    # write your code in Python 3.6
    pass

Code: 07:21:18 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 16 17 18 19 20 21 22 23

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

def gcd(a, b):
    if a < b:
        a, b = b, a
    if a % b == 0:
        return b
    return gcd(b, a % b)

def check(a, b):
    if a < b:
        a, b = b, a
    while a != 1:
        div = gcd(a, b)
        if div == 1:
            return False
        a //= div
    return True

def solution(A, B):
    # write your code in Python 3.6
    pass

Analysis

expand all Example tests

▶

example
example test

✘

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: 07:21:28 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 18 19 20 21 22 23

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

def gcd(a, b):
    if a < b:
        a, b = b, a
    if a % b == 0:
        return b
    return gcd(b, a % b)

def check(a, b):
    if a < b:
        a, b = b, a
    while a != 1:
        div = gcd(a, b)
        if div == 1:
            return False
        a //= div
    return True

def solution(A, B):
    # write your code in Python 3.6
    return sum(1 for i in range(len(A))

Code: 07:21:43 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 18 19 20 21 22 23

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

def gcd(a, b):
    if a < b:
        a, b = b, a
    if a % b == 0:
        return b
    return gcd(b, a % b)

def check(a, b):
    if a < b:
        a, b = b, a
    while a != 1:
        div = gcd(a, b)
        if div == 1:
            return False
        a //= div
    return True

def solution(A, B):
    # write your code in Python 3.6
    return sum(1 for i in range(len(A)) if check(A[i], B[i]))

Analysis

expand all Example tests

▶

example
example test

✔

0.052 s

Code: 07:23:03 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 18 19 20 21 22 23 24

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

def gcd(a, b):
    if a < b:
        a, b = b, a
    if a % b == 0:
        return b
    return gcd(b, a % b)

def check(a, b):
    if a < b:
        a, b = b, a
    while a != 1:
        div = gcd(a, b)
        if div == 1:
            return False
        a //= div
    
    return True

def solution(A, B):
    # write your code in Python 3.6
    return sum(1 for i in range(len(A)) if check(A[i], B[i]))

Code: 07:23:28 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 18 19 20 21 22 23 24 25 26 27 28

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

def gcd(a, b):
    if a < b:
        a, b = b, a
    if a % b == 0:
        return b
    return gcd(b, a % b)

def check(a, b):
    if a < b:
        a, b = b, a
    while a != 1:
        div = gcd(a, b)
        if div == 1:
            return False
        a //= div
    while b != 1:
        div = gcd(a, b)
        if div == 1:
            return False
        b //= div
    return True

def solution(A, B):
    # write your code in Python 3.6
    return sum(1 for i in range(len(A)) if check(A[i], B[i]))

Code: 07:23:38 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 16 17 18 19 20 21 22 23 24 25 26 27 28

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

def gcd(a, b):
    if a < b:
        a, b = b, a
    if a % b == 0:
        return b
    return gcd(b, a % b)

def check(a, b):
    if a < b:
        a, b = b, a
    while a != 1:
        div = gcd(a, b)
        if div == 1:
            return False
        a //= div
    while b != 1:
        div = gcd(a, b)
        if div == 1:
            return False
        b //= div
    return True

def solution(A, B):
    # write your code in Python 3.6
    return sum(1 for i in range(len(A)) if check(A[i], B[i]))

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.036 s

WRONG ANSWER, got 0 expected 1

Code: 07:23: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 17 18 19 20 21 22 23 24 25 26 27 28 29

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

def gcd(a, b):
    if a < b:
        a, b = b, a
    if a % b == 0:
        return b
    return gcd(b, a % b)

def check(a, b):
    if a < b:
        a, b = b, a
    
    while a != 1:
        div = gcd(a, b)
        if div == 1:
            return False
        a //= div
    while b != 1:
        div = gcd(a, b)
        if div == 1:
            return False
        b //= div
    return True

def solution(A, B):
    # write your code in Python 3.6
    return sum(1 for i in range(len(A)) if check(A[i], B[i]))

Code: 07:24:16 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 18 19 20 21 22 23 24 25 26 27 28 29 30

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

def gcd(a, b):
    if a < b:
        a, b = b, a
    if a % b == 0:
        return b
    return gcd(b, a % b)

def check(a, b):
    if a < b:
        a, b = b, a
    c = a
    while c != 1:
        div = gcd(c, b)
        if div == 1:
            return False
        c //= div
    c = b
    while c != 1:
        div = gcd(a, c)
        if div == 1:
            return False
        c //= div
    return True

def solution(A, B):
    # write your code in Python 3.6
    return sum(1 for i in range(len(A)) if check(A[i], B[i]))

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

Code: 07:24:20 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 18 19 20 21 22 23 24 25 26 27 28 29 30

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

def gcd(a, b):
    if a < b:
        a, b = b, a
    if a % b == 0:
        return b
    return gcd(b, a % b)

def check(a, b):
    if a < b:
        a, b = b, a
    c = a
    while c != 1:
        div = gcd(c, b)
        if div == 1:
            return False
        c //= div
    c = b
    while c != 1:
        div = gcd(a, c)
        if div == 1:
            return False
        c //= div
    return True

def solution(A, B):
    # write your code in Python 3.6
    return sum(1 for i in range(len(A)) if check(A[i], B[i]))

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

Code: 07:24:22 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 18 19 20 21 22 23 24 25 26 27 28 29 30

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

def gcd(a, b):
    if a < b:
        a, b = b, a
    if a % b == 0:
        return b
    return gcd(b, a % b)

def check(a, b):
    if a < b:
        a, b = b, a
    c = a
    while c != 1:
        div = gcd(c, b)
        if div == 1:
            return False
        c //= div
    c = b
    while c != 1:
        div = gcd(a, c)
        if div == 1:
            return False
        c //= div
    return True

def solution(A, B):
    # write your code in Python 3.6
    return sum(1 for i in range(len(A)) if check(A[i], B[i]))

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(Z * log(max(A) + max(B))**2)

expand all Example tests

▶

example
example test

✔

0.036 s

expand all Correctness tests

▶

extreme
extreme test with small values

✔

0.036 s

▶

simple_1
simple test with small values

✔

0.036 s

▶

simple_2
simple test with small values

✔

0.036 s

▶

primes
powers of primes

✔

0.036 s

▶

small_primes
small primes

✔

0.036 s

▶

small_all_pairs
all pairs 1-10, length = 100

✔

0.036 s

▶

small_random
small random test, length = 100

✔

0.036 s

expand all Performance tests

▶

large_all_pairs
all pairs 1-70, length = ~5,000

✔

0.052 s

▶

large_random
large random tests, length = ~6,000

✔

0.092 s

▶

many_factors
factorial test

✔

0.072 s

▶

many_factors2
factorial test

✔

0.068 s

▶

big_powers
powers of 2 and 3

✔

0.056 s

▶

extreme_maximal
extreme test with maximal values

✔

0.052 s