Test results - Codility

Tasks Details

medium

1. CommonPrimeDivisors

Check whether two numbers have the same prime divisors.

Task Score

100%

Correctness

100%

Performance

100%

Task description

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:

function 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..6,000];

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

Solution

Programming language used JavaScript

Time spent on task 20 minutes

Notes

not defined yet

Task timeline

‌

Code: 14:01:29 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: 14:01:35 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A, B) {
    // write your code in JavaScript (Node.js 8.9.4)
}

Code: 14:07:42 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function solution(A, B) {
    
}

Code: 14:09:56 UTC, js, autosave

show code in pop-up

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

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    
}

Code: 14:10:27 UTC, js, 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

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        const a = A[i];
        const b
    }
}

Code: 14:10:39 UTC, js, 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

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        const a = A[i];
        const b = B[i];

        
    }
}

Code: 14:12:13 UTC, js, 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

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        const a = A[i];
        const b = B[i];

        conso
    }
}

Code: 14:12:20 UTC, js, 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

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        const a = A[i];
        const b = B[i];

        console.log(gcd(a, b));
    }
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, integer expected, 'undefined' found
Perhaps you are missing a 'return'?

stdout:

15
10
1

Code: 14:18:13 UTC, js, 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

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        const a = A[i];
        const b = B[i];

        cons
    }
}

Code: 14:18:39 UTC, js, 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.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        const a = A[i];
        const b = B[i];

        const g = gcd(a, b);

        whl
    }
}

Code: 14:19:10 UTC, js, 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.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        const a = A[i];
        const b = B[i];

        const g = gcd(a, b);

        wh
    }
}

Code: 14:19:21 UTC, js, 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

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        const a = A[i];
        const b = B[i];

        const g = gcd(a, b);

        while (true) {
            
        }
    }
}

Code: 14:19:49 UTC, js, 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

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        const a = A[i];
        const b = B[i];

        const g = gcd(a, b);

        while (true) {
            const d = gcd(a, d);

            if (d === 1) break
            
            a 
        }
    }
}

Code: 14:20:12 UTC, js, 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 37 38 39

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        let a = A[i];
        let b = B[i];

        const g = gcd(a, b);

        while (true) {
            const d = gcd(a, d);

            if (d === 1) break
            
            a = a / d;
        }

        while (true) {
            const d = gcd(b, d);

            if (d === 1) break
            
            a = a / d;
        }

    }
}

Code: 14:20:22 UTC, js, 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 37 38 39 40

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        let a = A[i];
        let b = B[i];

        const g = gcd(a, b);

        while (true) {
            const d = gcd(a, d);

            if (d === 1) break
            
            a = a / d;
        }

        while (true) {
            const d = gcd(b, d);

            if (d === 1) break
            
            b = b / d;
        }

        
    }
}

Code: 14:20:38 UTC, js, 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 34 35 36 37 38 39 40 41 42

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        let a = A[i];
        let b = B[i];

        const g = gcd(a, b);

        while (true) {
            const d = gcd(a, d);

            if (d === 1) break
            
            a = a / d;
        }

        while (true) {
            const d = gcd(b, d);

            if (d === 1) break
            
            b = b / d;
        }

        if (a === 1 && b === 1) {
            count++;
        }
    }
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

ReferenceError: d is not defined
    at solution (solution.js:23:30)
    at solutionWrapper (/tmp/exec.js:412:28)
    at Promise.resolve.then (/tmp/exec.js:438:24)
    at <anonymous>
    at process._tickCallback (internal/process/next_tick.js:188:7)
    at Function.Module.runMain (module.js:686:11)
    at startup (bootstrap_node.js:187:16)
    at bootstrap_node.js:608:3

Code: 14:20:53 UTC, js, 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 37 38 39 40 41 42

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        let a = A[i];
        let b = B[i];

        const g = gcd(a, b);

        while (true) {
            const d = gcd(a, g);

            if (d === 1) break
            
            a = a / d;
        }

        while (true) {
            const d = gcd(b, d);

            if (d === 1) break
            
            b = b / d;
        }

        if (a === 1 && b === 1) {
            count++;
        }
    }
}

Code: 14:20:57 UTC, js, 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 34 35 36 37 38 39 40 41 42

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        let a = A[i];
        let b = B[i];

        const g = gcd(a, b);

        while (true) {
            const d = gcd(a, g);

            if (d === 1) break
            
            a = a / d;
        }

        while (true) {
            const d = gcd(b, g);

            if (d === 1) break
            
            b = b / d;
        }

        if (a === 1 && b === 1) {
            count++;
        }
    }
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, integer expected, 'undefined' found
Perhaps you are missing a 'return'?

Code: 14:21:07 UTC, js, 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 34 35 36 37 38 39 40 41 42 43 44

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        let a = A[i];
        let b = B[i];

        const g = gcd(a, b);

        while (true) {
            const d = gcd(a, g);

            if (d === 1) break
            
            a = a / d;
        }

        while (true) {
            const d = gcd(b, g);

            if (d === 1) break
            
            b = b / d;
        }

        if (a === 1 && b === 1) {
            count++;
        }
    }

    return count;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.072 s

Code: 14:21:12 UTC, js, 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 34 35 36 37 38 39 40 41 42 43 44

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        let a = A[i];
        let b = B[i];

        const g = gcd(a, b);

        while (true) {
            const d = gcd(a, g);

            if (d === 1) break
            
            a = a / d;
        }

        while (true) {
            const d = gcd(b, g);

            if (d === 1) break
            
            b = b / d;
        }

        if (a === 1 && b === 1) {
            count++;
        }
    }

    return count;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.072 s

Code: 14:21:15 UTC, js, 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 31 32 33 34 35 36 37 38 39 40 41 42 43 44

// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');

function gcd(a, b) {
    if (a % b === 0) {
        return b;
    } else {
        return gcd(b, a % b);
    }
}

function solution(A, B) {
    const Z = A.length;

    let count = 0;
    for (let i = 0; i < Z; i++) {
        let a = A[i];
        let b = B[i];

        const g = gcd(a, b);

        while (true) {
            const d = gcd(a, g);

            if (d === 1) break
            
            a = a / d;
        }

        while (true) {
            const d = gcd(b, g);

            if (d === 1) break
            
            b = b / d;
        }

        if (a === 1 && b === 1) {
            count++;
        }
    }

    return count;
}

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

expand all Correctness tests

▶

extreme
extreme test with small values

✔

0.068 s

0.072 s

▶

simple_1
simple test with small values

✔

0.072 s

▶

simple_2
simple test with small values

✔

0.068 s

▶

primes
powers of primes

✔

0.072 s

▶

small_primes
small primes

✔

0.068 s

▶

small_all_pairs
all pairs 1-10, length = 100

✔

0.072 s

▶

small_random
small random test, length = 100

✔

0.072 s

expand all Performance tests

▶

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

✔

0.084 s

▶

large_random
large random tests, length = ~6,000

✔

0.088 s

▶

many_factors
factorial test

✔

0.088 s

▶

many_factors2
factorial test

✔

0.088 s

▶

big_powers
powers of 2 and 3

✔

0.088 s

▶

extreme_maximal
extreme test with maximal values

✔

0.084 s