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:

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..100,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 25 minutes

Notes

not defined yet

Code: 09:58:13 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: 09:58:15 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: 09:58: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

// 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)
    return lcm(A,B)/B;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.076 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

Invalid result type, integer expected, non-integer number found

Code: 10:00:18 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

// 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)
    const result = [];
     gcd(p,q)
    console.log()
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

Code: 10:00:37 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

// 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)
    const result = [];
    for(let i =0; i<A.length; i++){
      gcd(p,q);  
    } 
    console.log(result);
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

Code: 10:00:47 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

// 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)
    const result = [];
    for(let i =0; i<A.length; i++){
      gcd(A[i]);  
    } 
    console.log(result);
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

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

// 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)
    const result = [];
    for(let i =0; i<A.length; i++){
      gcd(A[i],B[i]);  
    } 
    console.log(result);
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.076 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:

[]

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

// 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)
    const result = [];
    for(let i =0; i<A.length; i++){
      result.push(gcd(A[i],B[i]));  
    } 
    console.log(result);
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

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

// 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)
    const result = [];
    for(let i =0; i<A.length; i++){
      result.push(gcd(A[i],B[i]));  
    } 
    console.log(result);
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.076 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: 10:05:52 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 solution(A, B) {
    // write your code in JavaScript (Node.js 8.9.4)
    const result = [];
    for(let i =0; i<A.length; i++){
      result.push(gcd(A[i],B[i]));  
    } 
    console.log(result);
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

Code: 10:06:03 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

// 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)
    const result = [];
    for(let i =0; i<A.length; i++){
      result.push(gcd(A[i],B[i]));  
    } 
    console.log(result);
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

function semiprime(int n) {
	let p, f = 0;
	for (p = 2; f < 2 && p*p <= n; p++)
		while (0 == n % p)
			n /= p, f++;
 
	return f + (n > 1) == 2;
}

Code: 10:06:15 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

// 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)
    const result = [];
    for(let i =0; i<A.length; i++){
      result.push(gcd(A[i],B[i]));  
    } 
    console.log(semiprime(2));
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

function semiprime(n) {
	let p, f = 0;
	for (p = 2; f < 2 && p*p <= n; p++)
		while (0 == n % p)
			n /= p, f++;
 
	return f + (n > 1) == 2;
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.124 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:

false

Code: 10:06:25 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

// 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)
    const result = [];
    for(let i =0; i<A.length; i++){
      result.push(gcd(A[i],B[i]));  
    } 
    console.log(semiprime(2));
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

function semiprime(n) {
	let p, f = 0;
	for (p = 2; f < 2 && p*p <= n; p++)
		while (0 === n % p)
			n /= p, f++;
 
	return f + (n > 1) == 2;
}

Code: 10:06:35 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

// 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)
    const result = [];
    for(let i =0; i<A.length; i++){
      result.push(gcd(A[i],B[i]));  
    } 
    console.log(semiprime(4));
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

function semiprime(n) {
	let p, f = 0;
	for (p = 2; f < 2 && p*p <= n; p++)
		while (0 === n % p)
			n /= p, f++;
 
	return f + (n > 1) == 2;
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.076 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:

true

Code: 10:06:43 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

// 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)
    const result = [];
    for(let i =0; i<A.length; i++){
      result.push(gcd(A[i],B[i]));  
    } 
    console.log(semiprime(4));
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

function semiprime(n) {
	let p, f = 0;
	for (p = 2; f < 2 && p*p <= n; p++)
		while (0 === n % p)
			n /= p, f++;
 
	return f + (n > 1) === 2;
}

Code: 10:06:58 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

// 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)
    const result = [];
    for(let i =0; i<A.length; i++){
      result.push(gcd(A[i],B[i]));  
    } 
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

function semiprime(n) {
	let p, f = 0;
	for (p = 2; f < 2 && p*p <= n; p++)
		while (0 === n % p)
			n /= p, f++;
 
	return f + (n > 1) === 2;
}

Code: 10:07:08 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

// 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)
    const result = [];
    for(let i =0; i<A.length; i++){
      semiprime(gcd(A[i],B[i]));  
    } 
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

function semiprime(n) {
	let p, f = 0;
	for (p = 2; f < 2 && p*p <= n; p++)
		while (0 === n % p)
			n /= p, f++;
 
	return f + (n > 1) === 2;
}

Code: 10:07:27 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      semiprime(gcd(A[i],B[i])) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

function semiprime(n) {
	let p, f = 0;
	for (p = 2; f < 2 && p*p <= n; p++)
		while (0 === n % p)
			n /= p, f++;
 
	return f + (n > 1) === 2;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 2 expected 1

0.072 s

WRONG ANSWER, got 2 expected 1

Code: 10:08:35 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      semiprime(lcm(A[i],B[i])) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

function semiprime(n) {
	let p, f = 0;
	for (p = 2; f < 2 && p*p <= n; p++)
		while (0 === n % p)
			n /= p, f++;
 
	return f + (n > 1) === 2;
}

Code: 10:08:35 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      semiprime(lcm(A[i],B[i])) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function lcm(p,q){
    return p * (q / gcd(p,q));
}

function semiprime(n) {
	let p, f = 0;
	for (p = 2; f < 2 && p*p <= n; p++)
		while (0 === n % p)
			n /= p, f++;
 
	return f + (n > 1) === 2;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.072 s

WRONG ANSWER, got 0 expected 1

Code: 10:12: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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      semiprime(lcm(A[i],B[i])) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
fun

Code: 10:12:32 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      semiprime(lcm(A[i],B[i])) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q):
    if p == q == 0:
        return True
     
    denom = gcd(p,q)
     
    while (p != 1):
        p_gcd = gcd(p,denom)
        if p_gcd == 1:
            break
        p /= p_gcd
    else:
        while (q != 1):
            q_gcd = gcd(q,denom)
            if q_gcd == 1:
                break
            q /= q_gcd
        else:
            return True
     
    return False

Code: 10:13:02 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      semiprime(lcm(A[i],B[i])) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
     
    denom = gcd(p,q)
     
    while (p != 1):
        p_gcd = gcd(p,denom)
        if p_gcd == 1:
            break
        p /= p_gcd
    else:
        while (q != 1):
            q_gcd = gcd(q,denom)
            if q_gcd == 1:
                break
            q /= q_gcd
        else:
            return True
     
    return False

Code: 10:13: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 23 24 25 26 27 28 29 30 31 32 33 34 35 36

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      semiprime(lcm(A[i],B[i])) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q)
     
    while (p != 1):
        p_gcd = gcd(p,denom)
        if p_gcd == 1:
            break
        p /= p_gcd
    else:
        while (q != 1):
            q_gcd = gcd(q,denom)
            if q_gcd == 1:
                break
            q /= q_gcd
        else:
            return True
     
    return False
}

Code: 10:14:43 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      semiprime(lcm(A[i],B[i])) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q)
     
    while (p != 1)
        p_gcd = gcd(p,denom)
        if p_gcd == 1:
            break
        p /= p_gcd
        while (q != 1):
            q_gcd = gcd(q,denom)
            if q_gcd == 1:
                break
            q /= q_gcd
        else:
            return True
     
    return False
}

Code: 10:15:02 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      semiprime(lcm(A[i],B[i])) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q)
     
    while (p != 1){
        p_gcd = gcd(p,denom)
        if p_gcd == 1:
            break
        p /= p_gcd
        
    }
        while (q != 1){
            q_gcd = gcd(q,denom)
            if q_gcd == 1:
                break
            q /= q_gcd
        else:
            return True
        }
    return false;
}

Code: 10:15: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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      semiprime(lcm(A[i],B[i])) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p != 1){
        p_gcd = gcd(p,denom);
        if (p_gcd == 1) break;
        p /= p_gcd;
    }
    while (q != 1){
        q_gcd = gcd(q,denom)
        if q_gcd == 1:
            break
        q /= q_gcd
    else:
        return True
    }
    return false;
}

Code: 10:15:34 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      semiprime(lcm(A[i],B[i])) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p != 1){
        p_gcd = gcd(p,denom);
        if (p_gcd == 1) break;
        p /= p_gcd;
    }
    while (q != 1){
        q_gcd = gcd(q,denom);
        if (q_gcd == 1) break;
        q /= q_gcd
    else:
        return True
    }
    return false;
}

Code: 10:15:46 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      semiprime(lcm(A[i],B[i])) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p != 1){
        p_gcd = gcd(p,denom);
        if (p_gcd == 1) break;
        p /= p_gcd;
    }
    while (q != 1){
        q_gcd = gcd(q,denom);
        if (q_gcd == 1) break;
        q /= q_gcd;
    }
    return false;
}

Code: 10:15:58 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      semiprime(lcm(A[i],B[i])) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd == 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd == 1) break;
        q /= q_gcd;
    }
    return false;
}

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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      semiprime(lcm(A[i],B[i])) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    return false;
}

Code: 10:17:08 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      semiprime(lcm(A[i],B[i])) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    
    return false;
}

Code: 10:17:25 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]);
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    console.log(p,q);
    return false;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.076 s

WRONG ANSWER, got 0 expected 1

stdout:

1 1
1 3
9 5

Code: 10:17:58 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]);
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    if
    console.log(p,q);
    return false;
}

Code: 10:18:16 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]);
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    if(p === q === 1) return true;
    return false;
}

Code: 10:18:22 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    if(p === q === 1) return true;
    return false;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 0 expected 1

0.072 s

WRONG ANSWER, got 0 expected 1

Code: 10:18:33 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    if(p === 1 && q === 1) return true;
    return false;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.072 s

Code: 10:18:46 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    if() return p === 1 && q === 1;
    return false;
}

Code: 10:18:49 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    return p === 1 && q === 1;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.116 s

Code: 10:19:47 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
        con
    }
    return p === 1 && q === 1;
}

Code: 10:19:50 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
        console.log(q_gcd)
    }
    return p === 1 && q === 1;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.076 s

stdout:

15
5
10

Code: 10:20:23 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        console.log(q_gcd)
        if (q_gcd === 1) break;
        q /= q_gcd;
        console.log(q_gcd)
    }
    return p === 1 && q === 1;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.076 s

stdout:

Code: 10:20:30 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
        console.log(q_gcd)
    }
    return p === 1 && q === 1;
}

Code: 10:20:32 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        console.log(q)
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
        console.log(q_gcd)
    }
    return p === 1 && q === 1;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.076 s

stdout:

Code: 10:20:36 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        console.log(q)
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    return p === 1 && q === 1;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.076 s

stdout:

Code: 10:20:41 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
        console.log(q)
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    return p === 1 && q === 1;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.076 s

stdout:

75
30
5

Code: 10:20:45 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
        console.log(q)
    while (q !== 1){
        console.log(q)
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    return p === 1 && q === 1;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.076 s

stdout:

Code: 10:21:04 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
        console.log(q)
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    return p === 1 && q === 1;
}

Code: 10:21:14 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

// 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)
    let cnt = 0;
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    return p === 1 && q === 1;
}

Code: 10:21:44 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

// 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)
    let cnt = 0;
    A.reduce((cnt,v,i)=>{
        
    })
    for(let i =0; i<A.length; i++){
      hasSameFactors(A[i],B[i]) && cnt++;
    } 
    return cnt;
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    return p === 1 && q === 1;
}

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

// 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)
    return A.reduce((cnt,v,i)=>{
      hasSameFactors(A[i],B[i]) && cnt++;
    },0)
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    return p === 1 && q === 1;
}

Code: 10:22:11 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

// 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)
    return A.reduce((cnt,v,i)=>{
      hasSameFactors(A[i],B[i])
    },0)
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    return p === 1 && q === 1;
}

Code: 10:22:21 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

// 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)
    return A.reduce((cnt,v,i)=>hasSameFactors(A[i],B[i]) ? cnt+1 : cnt, 0)
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    return p === 1 && q === 1;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.072 s

Code: 10:22:24 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

// 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)
    return A.reduce((cnt,v,i)=>hasSameFactors(A[i],B[i]) ? cnt+1 : cnt, 0);
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    return p === 1 && q === 1;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.072 s

Code: 10:22:36 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

// 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)
    return A.reduce((cnt,v,i)=>hasSameFactors(v,B[i]) ? cnt+1 : cnt, 0);
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    return p === 1 && q === 1;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.072 s

Code: 10:22:42 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 solution(A, B) {
    // write your code in JavaScript (Node.js 8.9.4)
    return A.reduce((cnt,v,i)=>hasSameFactors(v,B[i]) ? cnt+1 : cnt, 0);
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    return p === 1 && q === 1;
}

Code: 10:22:50 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

// 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)
    return A.reduce((cnt,v,i)=>hasSameFactors(v,B[i]) ? cnt+1 : cnt, 0);
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    return p === 1 && q === 1;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.072 s

Code: 10:22:52 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

// 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)
    return A.reduce((cnt,v,i)=>hasSameFactors(v,B[i]) ? cnt+1 : cnt, 0);
}

function gcd(p, q){
    return q ? gcd(q, p % q) : p;
}
 
function hasSameFactors(p, q){
    denom = gcd(p,q);
    while (p !== 1){
        p_gcd = gcd(p,denom);
        if (p_gcd === 1) break;
        p /= p_gcd;
    }
    while (q !== 1){
        q_gcd = gcd(q,denom);
        if (q_gcd === 1) break;
        q /= q_gcd;
    }
    return p === 1 && q === 1;
}

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

0.068 s

▶

simple_1
simple test with small values

✔

0.072 s

▶

simple_2
simple test with small values

✔

0.072 s

▶

primes
powers of primes

✔

0.072 s

▶

small_primes
small primes

✔

0.072 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.108 s

▶

large_random
large random tests, length = ~6,000

✔

0.112 s

▶

many_factors
factorial test

✔

0.124 s

▶

many_factors2
factorial test

✔

0.128 s

▶

big_powers
powers of 2 and 3

✔

0.116 s

▶

extreme_maximal
extreme test with maximal values

✔

0.108 s