Test results - Codility

Tasks Details

medium

1. CountSemiprimes

Count the semiprime numbers in the given range [a..b]

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 semiprime is a natural number that is the product of two (not necessarily distinct) prime numbers. The first few semiprimes are 4, 6, 9, 10, 14, 15, 21, 22, 25, 26.

You are given two non-empty arrays P and Q, each consisting of M integers. These arrays represent queries about the number of semiprimes within specified ranges.

Query K requires you to find the number of semiprimes within the range (P[K], Q[K]), where 1 ≤ P[K] ≤ Q[K] ≤ N.

For example, consider an integer N = 26 and arrays P, Q such that:

P[0] = 1 Q[0] = 26 P[1] = 4 Q[1] = 10 P[2] = 16 Q[2] = 20

The number of semiprimes within each of these ranges is as follows:

(1, 26) is 10,

(4, 10) is 4,

(16, 20) is 0.

Write a function:

function solution(N, P, Q);

that, given an integer N and two non-empty arrays P and Q consisting of M integers, returns an array consisting of M elements specifying the consecutive answers to all the queries.

For example, given an integer N = 26 and arrays P, Q such that:

P[0] = 1 Q[0] = 26 P[1] = 4 Q[1] = 10 P[2] = 16 Q[2] = 20

the function should return the values [10, 4, 0], as explained above.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [1..50,000];

M is an integer within the range [1..30,000];

each element of arrays P and Q is an integer within the range [1..N];

P[i] ≤ Q[i].

Solution

Programming language used JavaScript

Time spent on task 28 minutes

Notes

not defined yet

Code: 14:13:09 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

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

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

class Solution {
    public int[] solution(int N, int[] P, int[] Q) {
        // write your code in Java SE 8
    }
}

Code: 14:13:14 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(N, P, Q) {
    // write your code in JavaScript (Node.js 8.9.4)
}

Code: 14:18:26 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(N, P, Q) {
    
}

Code: 14:19:36 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(N, P, Q) {
    cons
}

Code: 14:19:47 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(N, P, Q) {
    const primes 
}

Code: 14:20:09 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(N, P, Q) {
    const primes = new Array(N).fill(true);
}

Code: 14:20:25 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

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

function solution(N, P, Q) {
    const primes = new Array(N).fill(true);

    for (let i = 0; i < N; i++) {
        
    }
}

Code: 14:20:41 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

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

function solution(N, P, Q) {
    const primes = new Array(N).fill(true);

    for (let i = 0; i < Math.sqrt(N); i++) {
        
    }
}

Code: 14:20:54 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

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

function solution(N, P, Q) {
    const primes = new Array(N).fill(true);

    for (let i = 0; i < Math.sqrt(N); i++) {
        if ()
    }
}

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

show code in pop-up

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

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

function solution(N, P, Q) {
    const primes = new Array(N).fill(true);

    for (let i = 0; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            
        }
    }
}

Code: 14:21:24 UTC, js, autosave

show code in pop-up

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

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

function solution(N, P, Q) {
    const primes = new Array(N).fill(true);

    for (let i = 1; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let i = 0)
        }
    }
}

Code: 14:21:55 UTC, js, autosave

show code in pop-up

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

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

function solution(N, P, Q) {
    const primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 1; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let i = 0)
        }
    }
}

Code: 14:22:12 UTC, js, autosave

show code in pop-up

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

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

function solution(N, P, Q) {
    const primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i)
        }
    }
}

Code: 14:22:27 UTC, js, autosave

show code in pop-up

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

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

function solution(N, P, Q) {
    const primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; )
        }
    }
}

Code: 14:22:49 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

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

function solution(N, P, Q) {
    const primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    console.log(primes);
}

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, Array expected, 'undefined' found
Perhaps you are missing a 'return'?

stdout:

[ false,
  false,
  true,
  true,
  false,
  true,
  false,
  true,
  false,
  false,
  false,
  true,
  false,
  true,
  false,
  false,
  false,
  true,
  false,
  true,
  false,
  false,
  false,
  true,
  false,
  false,
  false ]

Code: 14:23: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

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

function solution(N, P, Q) {
    const primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

   
}

Code: 14:23:15 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(N, P, Q) {
    const primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    
}

Code: 14:23:26 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(N, P, Q) {
    const primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = 
}

Code: 14:23:56 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

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

function solution(N, P, Q) {
    const primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value) => {
        if (value) {
            acc.p
        }
    }, [])
}

Code: 14:24:06 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

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

function solution(N, P, Q) {
    const primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value) => {
        if (value) {
            acc.push()
        }
    }, [])
}

Code: 14:24:29 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

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

function solution(N, P, Q) {
    const primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) {
            acc.push(index);
        }

        return acc;
    }, [])

    console.log(primes);
}

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:

TypeError: Assignment to constant variable.
    at solution (solution.js:16:12)
    at solutionWrapper (/tmp/exec.js:421:28)
    at Promise.resolve.then (/tmp/exec.js:447: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:24: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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) {
            acc.push(index);
        }

        return acc;
    }, [])

    console.log(primes);
}

Code: 14:24:42 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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) {
            acc.push(index);
        }

        return acc;
    }, [])

    console.log(primes);
}

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, Array expected, 'undefined' found
Perhaps you are missing a 'return'?

stdout:

[ 2, 3, 5, 7, 11, 13, 17, 19, 23 ]

Code: 14:25: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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    console.log(primes);
}

Code: 14:25: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

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

function solution(N, P, Q) {
    const primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    console.log(primes);
}

Code: 14:25:33 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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    console.log(primes);
}

Code: 14:26: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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = [];

    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            
        }
    }
}

Code: 14:26: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(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = [];

    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semi
            }
        }
    }
}

Code: 14:26:57 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(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Map();

    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.
            }
        }
    }
}

Code: 14:27:16 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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Map();

    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.set(semiPrime);
            }
        }
    }

    console.log(semiPrimes);
}

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, Array expected, 'undefined' found
Perhaps you are missing a 'return'?

stdout:

Map {
  4 => undefined,
  6 => undefined,
  10 => undefined,
  14 => undefined,
  22 => undefined,
  26 => undefined,
  9 => undefined,
  15 => undefined,
  21 => undefined,
  25 => undefined }

Code: 14:27: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 33 34 35

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();

    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.set(semiPrime);
            }
        }
    }

    console.log(semiPrimes);
}

Code: 14:27:33 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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();

    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    console.log(semiPrimes);
}

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, Array expected, 'undefined' found
Perhaps you are missing a 'return'?

stdout:

Set { 4, 6, 10, 14, 22, 26, 9, 15, 21, 25 }

Code: 14:28:00 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(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    console.log(primes);

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    console.log(semiPrimes);
}

Code: 14:28:01 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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    console.log(primes);

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    console.log(semiPrimes);
}

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, Array expected, 'undefined' found
Perhaps you are missing a 'return'?

stdout:

[ 2, 3, 5, 7, 11, 13, 17, 19, 23 ]
Set { 4, 6, 10, 14, 22, 26, 9, 15, 21, 25 }

Code: 14:28:33 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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    console.log(primes);

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

    

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    console.log(semiPrimes);
}

Code: 14:28: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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    console.log(primes);

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            console.log(semiPrime);

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    console.log(semiPrimes);
}

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, Array expected, 'undefined' found
Perhaps you are missing a 'return'?

stdout:

[ 2, 3, 5, 7, 11, 13, 17, 19, 23 ]
4
6
10
14
22
26
34
38
46
6
9
15
21
33
39
51
57
69
10
15
25
35
55
65
85
95
115
14
21
35
49
77
91
119
133
161
22
33
55
77
121
143
187
209
253
26
39
65
91
143
169
221
247
299
34
51
85
119
187
221
289
323
391
38
57
95
133
209
247
323
361
437
46
69
115
161
253
299
391
437
529
Set { 4, 6, 10, 14, 22, 26, 9, 15, 21, 25 }

Code: 14:29: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 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 solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    console.log(primes);

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            console.log(semiPrime);

            if (semiPrime <= N) {
                console
                semiPrimes.add(semiPrime);
            }
        }
    }

    console.log(semiPrimes);
}

Code: 14:29:09 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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    console.log(primes);

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                console.log(semiPrimes)
                semiPrimes.add(semiPrime);
            }
        }
    }

    console.log(semiPrimes);
}

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, Array expected, 'undefined' found
Perhaps you are missing a 'return'?

stdout:

[ 2, 3, 5, 7, 11, 13, 17, 19, 23 ]
Set {}
Set { 4 }
Set { 4, 6 }
Set { 4, 6, 10 }
Set { 4, 6, 10, 14 }
Set { 4, 6, 10, 14, 22 }
Set { 4, 6, 10, 14, 22, 26 }
Set { 4, 6, 10, 14, 22, 26 }
Set { 4, 6, 10, 14, 22, 26, 9 }
Set { 4, 6, 10, 14, 22, 26, 9, 15 }
Set { 4, 6, 10, 14, 22, 26, 9, 15, 21 }
Set { 4, 6, 10, 14, 22, 26, 9, 15, 21 }
Set { 4, 6, 10, 14, 22, 26, 9, 15, 21 }
Set { 4, 6, 10, 14, 22, 26, 9, 15, 21, 25 }
Set { 4, 6, 10, 14, 22, 26, 9, 15, 21, 25 }
Set { 4, 6, 10, 14, 22, 26, 9, 15, 21, 25 }
Set { 4, 6, 10, 14, 22, 26, 9, 15, 21, 25 }
Set { 4, 6, 10, 14, 22, 26, 9, 15, 21, 25 }

Code: 14:29: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 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(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    console.log(primes);

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    console.log(semiPrimes);
}

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, Array expected, 'undefined' found
Perhaps you are missing a 'return'?

stdout:

[ 2, 3, 5, 7, 11, 13, 17, 19, 23 ]
Set { 4, 6, 10, 14, 22, 26, 9, 15, 21, 25 }

Code: 14:29:50 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(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    console.log(primes);

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    const or
}

Code: 14:30:14 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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    console.log(primes);

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    const orderedSemiPrimes = [...semiPrimes].sort((a, b) => b - a);

    console.log(orderedSemiPrimes);
}

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, Array expected, 'undefined' found
Perhaps you are missing a 'return'?

stdout:

[ 2, 3, 5, 7, 11, 13, 17, 19, 23 ]
[ 26, 25, 22, 21, 15, 14, 10, 9, 6, 4 ]

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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    console.log(primes);

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    const orderedSemiPrimes = [...semiPrimes].sort((a, b) => a - b);

    console.log(orderedSemiPrimes);
}

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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    console.log(primes);

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    const orderedSemiPrimes = [...semiPrimes].sort((a, b) => a - b);

    console.log(orderedSemiPrimes);
}

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, Array expected, 'undefined' found
Perhaps you are missing a 'return'?

stdout:

[ 2, 3, 5, 7, 11, 13, 17, 19, 23 ]
[ 4, 6, 9, 10, 14, 15, 21, 22, 25, 26 ]

Code: 14:30:38 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(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    const orderedSemiPrimes = [...semiPrimes].sort((a, b) => a - b);
    const 
}

Code: 14:31: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 33 34 35 36 37

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    const orderedSemiPrimes = [...semiPrimes].sort((a, b) => a - b);
    const cumSum = [];

    fo
}

Code: 14:31: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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    const orderedSemiPrimes = [...semiPrimes].sort((a, b) => a - b);
    const cumSum = [];

    for (let i = 0; i <= N; i++) {
        
    }
}

Code: 14:31: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 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 solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    const orderedSemiPrimes = [...semiPrimes].sort((a, b) => a - b);
    const cumSum = [0];

    for (let i = 1; i <= N; i++) {
        cumSum.push()
    }
}

Code: 14:32: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 36 37 38 39

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    const orderedSemiPrimes = [...semiPrimes].sort((a, b) => a - b);
    const cumSum = [0];

    for (let i = 1; i <= N; i++) {
        cumSum.push(cumSum)
    }
}

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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    const orderedSemiPrimes = [...semiPrimes].sort((a, b) => a - b);
    const cumSum = [0];

    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        
    }
}

Code: 14:33: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 33 34 35 36 37 38 39 40 41

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    const orderedSemiPrimes = [...semiPrimes].sort((a, b) => a - b);
    const cumSum = [0];

    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (orde)
    }
}

Code: 14:33:33 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

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.)
    }
}

Code: 14:34: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 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 solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i)) {
            cumSum[i + 1]++;
        }
    }

    console.log(cumSum);
}

Code: 14:34:05 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 solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i)) {
            cumSum[i + 1]++;
        }
    }

    console.log(cumSum);
}

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, Array expected, 'undefined' found
Perhaps you are missing a 'return'?

stdout:

[ 0, 0, 0, 0, 0, 1, 1, 2, 2, 2, 3, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 7, 8, 8, 8, 9, 10 ]

Code: 14:34:31 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 43 44 45

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i)) {
            cumSum[i + 1]++;
        }
    }

    const results = [];
    for (let i = 0; i < P.length; i++) {
        
    }
}

Code: 14:35:00 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 43 44 45 46 47

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i)) {
            cumSum[i + 1]++;
        }
    }

    const results = [];
    for (let i = 0; i < P.length; i++) {
        results.push(cumSum[Q[i]] - cumSum[P[i]]);
    }

    return return;
}

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:

solution.js:46
    return return;
           ^^^^^^

SyntaxError: Unexpected token return
    at createScript (vm.js:80:10)
    at Object.runInNewContext (vm.js:135:10)
    at getSolution (/tmp/exec.js:411:29)
    at Promise.resolve.then (/tmp/exec.js:445:34)
    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:35:03 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 43 44 45 46 47

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i)) {
            cumSum[i + 1]++;
        }
    }

    const results = [];
    for (let i = 0; i < P.length; i++) {
        results.push(cumSum[Q[i]] - cumSum[P[i]]);
    }

    return results;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got [9, 3, 0] expected [10, 4, 0]

0.072 s

WRONG ANSWER, got [9, 3, 0] expected [10, 4, 0]

Code: 14:35: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 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i)) {
            cumSum[i + 1]++;
        }
    }

    

    const results = [];
    for (let i = 0; i < P.length; i++) {
        results.push(cumSum[Q[i]] - cumSum[P[i]]);
    }

    return results;
}

Code: 14:35:33 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 43 44 45 46 47 48 49

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i)) {
            cumSum[i + 1]++;
        }
    }

    console.log(cumSum);

    const results = [];
    for (let i = 0; i < P.length; i++) {
        results.push(cumSum[Q[i]] - cumSum[P[i]]);
    }

    return results;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got [9, 3, 0] expected [10, 4, 0]

0.076 s

WRONG ANSWER, got [9, 3, 0] expected [10, 4, 0]

stdout:

[ 0, 0, 0, 0, 0, 1, 1, 2, 2, 2, 3, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 7, 8, 8, 8, 9, 10 ]

Code: 14:37:45 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 43 44 45 46 47 48 49

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i )) {
            cumSum[i + 1]++;
        }
    }

    console.log(cumSum);

    const results = [];
    for (let i = 0; i < P.length; i++) {
        results.push(cumSum[Q[i]] - cumSum[P[i]]);
    }

    return results;
}

Code: 14:37:47 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 43 44 45 46 47 48 49

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i + 1)) {
            cumSum[i + 1]++;
        }
    }

    console.log(cumSum);

    const results = [];
    for (let i = 0; i < P.length; i++) {
        results.push(cumSum[Q[i]] - cumSum[P[i]]);
    }

    return results;
}

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got [10, 3, 0] expected [10, 4, 0]

0.076 s

WRONG ANSWER, got [10, 3, 0] expected [10, 4, 0]

stdout:

[ 0, 0, 0, 0, 1, 1, 2, 2, 2, 3, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 7, 8, 8, 8, 9, 10, 10 ]

Code: 14:38: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 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i + 1)) {
            cumSum[i + 1]++;
        }
    }

    console.log(cumSum);

    const results = [];
    for (let i = 0; i < P.length; i++) {
        results.push(cumSum[Q[i]] - cumSum[P[i] - 1]);
    }

    return results;
}

Code: 14:38:59 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 45 46 47 48 49

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i + 1)) {
            cumSum[i + 1]++;
        }
    }

    console.log(cumSum);

    const results = [];
    for (let i = 0; i < P.length; i++) {
        results.push(cumSum[Q[i]] - cumSum[P[i] - 1]);
    }

    return results;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.076 s

stdout:

[ 0, 0, 0, 0, 1, 1, 2, 2, 2, 3, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 7, 8, 8, 8, 9, 10, 10 ]

Code: 14:39:03 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 45 46 47

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

function solution(N, P, Q) {
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i + 1)) {
            cumSum[i + 1]++;
        }
    }

    const results = [];
    for (let i = 0; i < P.length; i++) {
        results.push(cumSum[Q[i]] - cumSum[P[i] - 1]);
    }

    return results;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.068 s

Code: 14:39:23 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 43 44 45 46 47 48

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

function solution(N, P, Q) {
    
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i + 1)) {
            cumSum[i + 1]++;
        }
    }

    const results = [];
    for (let i = 0; i < P.length; i++) {
        results.push(cumSum[Q[i]] - cumSum[P[i] - 1]);
    }

    return results;
}

Code: 14:39:33 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 43 44 45 46 47 48

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

function solution(N, P, Q) {
    // Sieve of Eratosthenes
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i + 1)) {
            cumSum[i + 1]++;
        }
    }

    const results = [];
    for (let i = 0; i < P.length; i++) {
        results.push(cumSum[Q[i]] - cumSum[P[i] - 1]);
    }

    return results;
}

Code: 14:39:51 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 43 44 45 46 47 48 49 50

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

function solution(N, P, Q) {
    // Sieve of Eratosthenes
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    // converting to list of primes
    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    // calculating semiprimes
    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i + 1)) {
            cumSum[i + 1]++;
        }
    }

    const results = [];
    for (let i = 0; i < P.length; i++) {
        results.push(cumSum[Q[i]] - cumSum[P[i] - 1]);
    }

    return results;
}

Code: 14:40:20 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 45 46 47 48 49 50 51 52 53

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

function solution(N, P, Q) {
    // Sieve of Eratosthenes
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    // converting to list of primes
    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    // calculating semiprimes
    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    // computing prefix sums of semiprimes
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i + 1)) {
            cumSum[i + 1]++;
        }
    }

    // running queries
    const results = [];
    for (let i = 0; i < P.length; i++) {
        results.push(cumSum[Q[i]] - cumSum[P[i] - 1]);
    }

    return results;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.072 s

Code: 14:40:30 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 45 46 47 48 49 50 51 52 53

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

function solution(N, P, Q) {
    // Sieve of Eratosthenes
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    // converting to list of primes
    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    // calculating semiprimes
    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    // computing prefix sums of semiprimes
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i + 1)) {
            cumSum[i + 1]++;
        }
    }

    // running queries
    const results = [];
    for (let i = 0; i < P.length; i++) {
        results.push(cumSum[Q[i]] - cumSum[P[i] - 1]);
    }

    return results;
}

Analysis

expand all Example tests

▶

example
example test

✔

0.072 s

Code: 14:40:32 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 45 46 47 48 49 50 51 52 53

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

function solution(N, P, Q) {
    // Sieve of Eratosthenes
    let primes = new Array(N).fill(true);
    primes[0] = primes[1] = false;

    for (let i = 2; i < Math.sqrt(N); i++) {
        if (primes[i]) {
            for (let j = i + i; j <= N; j+=i) {
                primes[j] = false;
            }
        }
    }

    // converting to list of primes
    primes = primes.reduce((acc, value, index) => {
        if (value) acc.push(index);
    
        return acc;
    }, [])

    // calculating semiprimes
    const semiPrimes = new Set();
    for (let i = 0; i < primes.length; i++) {
        for (let j = 0; j < primes.length; j++) {
            const semiPrime = primes[i] * primes[j];

            if (semiPrime <= N) {
                semiPrimes.add(semiPrime);
            }
        }
    }

    // computing prefix sums of semiprimes
    const cumSum = [0];
    for (let i = 0; i <= N; i++) {
        cumSum.push(cumSum[i]);

        if (semiPrimes.has(i + 1)) {
            cumSum[i + 1]++;
        }
    }

    // running queries
    const results = [];
    for (let i = 0; i < P.length; i++) {
        results.push(cumSum[Q[i]] - cumSum[P[i] - 1]);
    }

    return results;
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N * log(log(N)) + M)

expand all Example tests

▶

example
example test

✔

0.072 s

expand all Correctness tests

▶

extreme_one
small N = 1

✔

0.068 s

▶

extreme_four
small N = 4

✔

0.072 s

▶

small_functional
small functional

✔

0.068 s

▶

small_random
small random, length = ~40

✔

0.072 s

expand all Performance tests

▶

medium_random
small random, length = ~300

✔

0.072 s

▶

large_small_slices
large with very small slices, length = ~30,000

✔

0.164 s

▶

large_random1
large random, length = ~30,000

✔

0.216 s

▶

large_random2
large random, length = ~30,000

✔

0.220 s

▶

extreme_large
all max ranges

✔

0.216 s