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 8 minutes

Notes

not defined yet

Code: 08:55:03 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: 08:55:15 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: 08:55:29 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a_gcd = gcd(max(a / ab_gcd, ab_gcd), min(a/ ab_gcd, ab_gcd))
        b_gcd = gcd(max(b / ab_gcd, ab_gcd), min(b/ ab_gcd, ab_gcd))

        

        #print(a_div_gcd, b_div_gcd)
        if a_div_gcd == 1 and b_div_gcd == 1:
            count += 1 
    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 08:55:46 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a_gcd = gcd(max(a / ab_gcd, ab_gcd), min(a/ ab_gcd, ab_gcd))
        b_gcd = gcd(max(b / ab_gcd, ab_gcd), min(b/ ab_gcd, ab_gcd))

        while a_gcd != 1:
            

        #print(a_div_gcd, b_div_gcd)
        if a_div_gcd == 1 and b_div_gcd == 1:
            count += 1 
    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 08:56:00 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a_gcd = gcd(max(a / ab_gcd, ab_gcd), min(a/ ab_gcd, ab_gcd))
        b_gcd = gcd(max(b / ab_gcd, ab_gcd), min(b/ ab_gcd, ab_gcd))

        while a_gcd

        #print(a_div_gcd, b_div_gcd)
        if a_div_gcd == 1 and b_div_gcd == 1:
            count += 1 
    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 08:56:21 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a_div_num = a / ab_gcd
        b_div_num = b / ab_gcd

        a_div_gcd = gcd(max(a_div_num, ab_gcd), min(a_div_num, ab_gcd))        
        b_div_gcd = gcd(max(b_div_num, ab_gcd), min(b_div_num, ab_gcd))

        if a_div_num / a_div_gcd == 1 and b_div_num / b_div_gcd == 1:
            count += 1 

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 08:56:48 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a_div_num = a / ab_gcd
        b_div_num = b / ab_gcd

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 08:57:14 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        print(a, b)

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.036 s

WRONG ANSWER, got 0 expected 1

stdout:

1.0 5.0
1.0 3.0
9.0 5.0

Code: 08:57:18 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        print(a, b)

        while 

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 08:57:50 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        print(a, b)

        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 08:58: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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        print(a, b)

        while gcd(a, )

        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 08:58:19 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        print(a, b)

        
        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 08:58:49 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        print(a, b)

        a_gcd = ab_gcd 
        b_gcd = ab_gcd 

        while gcd(a, a_gcd)

        
        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 08:59:01 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 30

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        print(a, b)

        a_gcd = ab_gcd 
        b_gcd = ab_gcd 

        while gcd(a, a_gcd) != 1:
            


        
        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 08:59:29 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        print(a, b)

        gcd(a, ab_gcd)
        
        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 08:59:54 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        print(a, b)

        while True : 
            gcd(a, ab_gcd)
        
        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 09:00:04 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        print(a, b)

        while True: 
            gcd(a, ab_gcd)
        
        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 09:00:34 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        print(a, b)

        a_gcd , b_gcd = ab_gcd, b_gcd

        while True: 
            gcd(a, a_gcd)
        
        while True:
            gcd()
        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 09:00:55 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        print(a, b)

        a_gcd , b_gcd = ab_gcd, b_gcd

        while True: 
            a_gcd = gcd(a, a_gcd)
        
        while True:
            b_gcd = gcd(b, b_gcd)
        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 09:01:10 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        print(a, b)

        a_gcd , b_gcd = ab_gcd, ab_gcd

        while True: 
            a_gcd = gcd(a, a_gcd)
        
        while True:
            b_gcd = gcd(b, b_gcd)
        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 09:01:32 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        print(a, b)

        a_gcd , b_gcd = ab_gcd, ab_gcd

        while a_gcd != 1: 
            a_gcd = gcd(a, a_gcd)
        
        while b_gcd != 1:
            b_gcd = gcd(b, b_gcd)
        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 09:01:53 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 29 30 31 32 33

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        print(a, b)

        a_gcd , b_gcd = ab_gcd, ab_gcd

        while a_gcd != 1: 
            a_gcd = gcd(a, a_gcd)
            a /= a_gcd
        
        while b_gcd != 1:
            b_gcd = gcd(b, b_gcd)
            b /= b_gcd 
        
        print(a, b)
        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.040 s

WRONG ANSWER, got 0 expected 1

stdout:

1.0 5.0
1.0 1.0
1.0 3.0
1.0 3.0
9.0 5.0
9.0 5.0

Code: 09:02:02 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 29 30 31 32 33

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        #print(a, b)

        a_gcd , b_gcd = ab_gcd, ab_gcd

        while a_gcd != 1: 
            a_gcd = gcd(a, a_gcd)
            a /= a_gcd
        
        while b_gcd != 1:
            b_gcd = gcd(b, b_gcd)
            b /= b_gcd 
        
        print(a, b)
        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.036 s

WRONG ANSWER, got 0 expected 1

stdout:

1.0 1.0
1.0 3.0
9.0 5.0

Code: 09:02:06 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 30 31 32 33 34 35

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        #print(a, b)

        a_gcd , b_gcd = ab_gcd, ab_gcd

        while a_gcd != 1: 
            a_gcd = gcd(a, a_gcd)
            a /= a_gcd
        
        while b_gcd != 1:
            b_gcd = gcd(b, b_gcd)
            b /= b_gcd 
        
        print(a, b)

        if 
        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 09:02: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 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        #print(a, b)

        a_gcd , b_gcd = ab_gcd, ab_gcd

        while a_gcd != 1: 
            a_gcd = gcd(a, a_gcd)
            a /= a_gcd
        
        while b_gcd != 1:
            b_gcd = gcd(b, b_gcd)
            b /= b_gcd 
        
        print(a, b)

        if a == 1 and b == 1 :
            count += 1 
        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Code: 09:02:24 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 31 32 33

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        a_gcd , b_gcd = ab_gcd, ab_gcd

        while a_gcd != 1: 
            a_gcd = gcd(a, a_gcd)
            a /= a_gcd
        
        while b_gcd != 1:
            b_gcd = gcd(b, b_gcd)
            b /= b_gcd 


        if a == 1 and b == 1 :
            count += 1 
        

        

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

Code: 09:02:30 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        a_gcd , b_gcd = ab_gcd, ab_gcd

        while a_gcd != 1: 
            a_gcd = gcd(a, a_gcd)
            a /= a_gcd
        
        while b_gcd != 1:
            b_gcd = gcd(b, b_gcd)
            b /= b_gcd 


        if a == 1 and b == 1 :
            count += 1 

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

Analysis

expand all Example tests

▶

example
example test

✔

0.036 s

Code: 09:02:33 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

def solution(A, B):
    # write your code in Python 3.6
    count = 0
    for (a, b) in zip(A, B):
        ab_gcd = gcd(max(a,b), min(a,b))

        a /= ab_gcd 
        b /= ab_gcd 

        a_gcd , b_gcd = ab_gcd, ab_gcd

        while a_gcd != 1: 
            a_gcd = gcd(a, a_gcd)
            a /= a_gcd
        
        while b_gcd != 1:
            b_gcd = gcd(b, b_gcd)
            b /= b_gcd 


        if a == 1 and b == 1 :
            count += 1 

    return count 


def gcd(N, M):
    if M == 0:
        return N 
    return gcd(M, N % M)

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.060 s

▶

large_random
large random tests, length = ~6,000

✔

0.080 s

▶

many_factors
factorial test

✔

0.084 s

▶

many_factors2
factorial test

✔

0.076 s

▶

big_powers
powers of 2 and 3

✔

0.068 s

▶

extreme_maximal
extreme test with maximal values

✔

0.060 s