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

Notes

not defined yet

Code: 11:02:47 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: 11:02:50 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: 11:03:35 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9

// 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)
    let primes = [false, false];
    let semiPrimes = [false,false];
    
}

Code: 11:03:52 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) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [false, false];
    let semiPrimes = [false,false];
    
    for (let i = 0; i<)
}

Code: 11:04:02 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// 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)
    let primes = [false, false];
    let semiPrimes = [false,false];
    let max
    
    for (let i = 0; i<)
}

Code: 11:04:32 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.
    
    for (let i = 0; i<)
}

Code: 11:04:42 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q)
    
    for (let i = 0; i<)
}

Code: 11:05:13 UTC, js, autosave

show code in pop-up

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

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

function solution(N, P, Q) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = min; i<=max; i++) {
        
    }
}

Code: 11:05:36 UTC, js, autosave

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(N, P, Q) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = min; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
}

Code: 11:05: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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = min; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (i)
}

Code: 11:06:19 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) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = min; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (i=2; i<= parseInt(Math.sqrt(N)))
}

Code: 11:06: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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = min; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (i=2; i<= parseInt(Math.sqrt(max)); i++) {
        
    }
}

Code: 11:07: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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = min; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j*i <= )
    }
}

Code: 11:07: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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = min; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (pr)
        }
    }
}

Code: 11:07: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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = min; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                
            }
        }
    }
}

Code: 11:08: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 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(N, P, Q) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = min; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes
            }
        }
    }
}

Code: 11:08:28 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(N, P, Q) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = min; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
}

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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
}

Code: 11:09: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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    for (let i =)
}

Code: 11:09: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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    for (let i = 0; )
}

Code: 11:09: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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count
    for (let i = 1; )
}

Code: 11:10: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 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) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++)
}

Code: 11:10:28 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(N, P, Q) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        
    }
}

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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[])
    }
}

Code: 11:11:12 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
}

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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    
    
}

Code: 11:11: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 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) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    
    for (let i = 0; i< P.length; i++) {
        
    }
}

Code: 11:12: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 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) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]])
    }
}

Code: 11:12:24 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) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]]);
    }
}

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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]]);
    }
    return answer;
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

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

Code: 11:12:54 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) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]]);
    }
    console.log(answer)
    return answer;
}

Code: 11:12:56 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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]]);
    }
    console.log(answer)
    return answer;
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

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

stdout:

[ NaN, NaN, NaN ]

Code: 11:13:08 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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]]);
    }
    console.log(answer)
    return answer;
}

Analysis

expand all Example tests

▶

example
example test

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

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

stdout:

[ 0 ]
[ NaN, NaN, NaN ]

Code: 11:13: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 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) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]]);
    }
    console.log(answer)
    return answer;
}

Code: 11:13:39 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 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) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]]);
    }
    console.log(answer)
    return answer;
}

Code: 11:13:40 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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]]);
    }
    console.log(answer)
    return answer;
}

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, 3, 0 ]

Code: 11:14:00 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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    console.log(answer)
    return answer;
}

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, 4, 0 ]

Code: 11:15: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) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }

    return answer;
}

Code: 11:15: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 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40

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

function solution(N, P, Q) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

Code: 11:15:39 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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

User test case 1:

[1, [1], [1]]

Analysis

expand all Example tests

▶

example
example test

✔

0.072 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 ]

expand all User tests

▶

test_data1

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

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

stdout:

[ 0 ]

Code: 11:15:48 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40

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

function solution(N, P, Q) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

Code: 11:16: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 29 30 31 32 33 34 35 36 37 38 39 40

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

function solution(N, P, Q) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

Code: 11:16: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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

Code: 11:16: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 28 29 30 31 32 33 34 35 36 37 38 39 40

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

function solution(N, P, Q) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

User test case 1:

[1, [1], [1]]

User test case 2:

[16, [1, 11, 10], [16, 15, 10]]

Analysis

expand all Example tests

▶

example
example test

✔

0.072 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 ]

expand all User tests

▶

test_data1

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

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

stdout:

[ 0 ]

▶

test_data2

✔

0.072 s

OK
function result: [6, 2, 1]

stdout:

[ 0, 0, 0, 0, 1, 1, 2, 2, 2, 3, 4, 4, 4, 4, 5, 6, 6 ]

Code: 11:16:53 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

Code: 11:17: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 29 30 31 32 33 34 35 36 37 38 39 40

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

function solution(N, P, Q) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

Code: 11:17:09 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

// 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)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

User test case 1:

[1, [1], [1]]

User test case 2:

[16, [1, 11, 10], [16, 15, 10]]

User test case 3:

[30000, [1], [26]]

Analysis

expand all Example tests

▶

example
example test

✔

0.072 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 ]

expand all User tests

▶

test_data1

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

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

stdout:

[ 0 ]

▶

test_data2

✔

0.076 s

OK
function result: [6, 2, 1]

stdout:

[ 0, 0, 0, 0, 1, 1, 2, 2, 2, 3, 4, 4, 4, 4, 5, 6, 6 ]

▶

test_data3

✔

0.076 s

OK
function result: [10]

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 ]

Code: 11:18: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) {
    // write your code in JavaScript (Node.js 8.9.4)
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

Code: 11:18:28 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

// 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)
    if (N === 1) {
        return
    }
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

Code: 11:18: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

// 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)
    if (N === 1) {
        return 
    }
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

Code: 11:19: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 42 43

// 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)
    if (N === 1) {
        return Array.from({ length: P.length})
    }
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

Code: 11:19: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 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

// 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)
    if (N === 1) {
        return Array.from({ length: P.length }, 0)
    }
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

Code: 11:19:19 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

// 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)
    if (N === 1) {
        return Array.from({ length: P.length }, 0);
    }
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

User test case 1:

[1, [1], [1]]

User test case 2:

[16, [1, 11, 10], [16, 15, 10]]

User test case 3:

[30000, [1], [26]]

Analysis

expand all Example tests

▶

example
example test

✔

0.072 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 ]

expand all User tests

▶

test_data1

✘

RUNTIME ERROR
tested program terminated with exit code 1

0.072 s

RUNTIME ERROR, tested program terminated with exit code 1

stderr:

TypeError: 0 is not a function
    at Function.from (native)
    at solution (solution.js:7:22)
    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

▶

test_data2

✔

0.072 s

OK
function result: [6, 2, 1]

stdout:

[ 0, 0, 0, 0, 1, 1, 2, 2, 2, 3, 4, 4, 4, 4, 5, 6, 6 ]

▶

test_data3

✔

0.072 s

OK
function result: [10]

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 ]

Code: 11:19: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 37 38 39 40 41 42 43

// 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)
    if (N === 1) {
        return Array.from({ length: P.length }, (0);
    }
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

Code: 11:19:54 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

// 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)
    if (N === 1) {
        return Array.from({ length: P.length }, () => 0);
    }
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

User test case 1:

[1, [1], [1]]

User test case 2:

[16, [1, 11, 10], [16, 15, 10]]

User test case 3:

[30000, [1], [26]]

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 ]

expand all User tests

▶

test_data1

✔

0.072 s

OK
function result: [0]

▶

test_data2

✔

0.076 s

OK
function result: [6, 2, 1]

stdout:

[ 0, 0, 0, 0, 1, 1, 2, 2, 2, 3, 4, 4, 4, 4, 5, 6, 6 ]

▶

test_data3

✔

0.076 s

OK
function result: [10]

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 ]

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

// 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)
    if (N === 1) {
        return Array.from({ length: P.length }, () => 0);
    }
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    console.log(count)
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

User test case 1:

[1, [1, 1, 1], [1, 1, 1]]

User test case 2:

[16, [1, 11, 10], [16, 15, 10]]

User test case 3:

[30000, [1], [26]]

Analysis

expand all Example tests

▶

example
example test

✔

0.104 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 ]

expand all User tests

▶

test_data1

✔

0.072 s

OK
function result: [0, 0, 0]

▶

test_data2

✔

0.076 s

OK
function result: [6, 2, 1]

stdout:

[ 0, 0, 0, 0, 1, 1, 2, 2, 2, 3, 4, 4, 4, 4, 5, 6, 6 ]

▶

test_data3

✔

0.072 s

OK
function result: [10]

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 ]

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

// 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)
    if (N === 1) {
        return Array.from({ length: P.length }, () => 0);
    }
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }
    
    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

Code: 11:20:35 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

// 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)
    if (N === 1) {
        return Array.from({ length: P.length }, () => 0);
    }
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }

    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

User test case 1:

[1, [1, 1, 1], [1, 1, 1]]

User test case 2:

[16, [1, 11, 10], [16, 15, 10]]

User test case 3:

[30000, [1], [26]]

Analysis

expand all Example tests

▶

example
example test

✔

0.072 s

expand all User tests

▶

test_data1

✔

0.072 s

OK
function result: [0, 0, 0]

▶

test_data2

✔

0.072 s

OK
function result: [6, 2, 1]

▶

test_data3

✔

0.068 s

OK
function result: [10]

Code: 11:21: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 30 31 32 33 34 35 36 37 38 39 40 41 42 43

// 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)
    if (N === 1) {
        return Array.from({ length: P.length }, () => 0);
    }
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }

    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

Code: 11:21:09 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

// 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)
    if (N === 1) {
        return Array.from({ length: P.length }, () => 0);
    }
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }

    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

User test case 1:

[1, [1, 1, 1], [1, 1, 1]]

User test case 2:

[16, [1, 11, 10], [16, 15, 10]]

User test case 3:

[30000, [1], [26]]

User test case 4:

[3, [1, 1, 1], [1, 1, 3]]

Analysis

expand all Example tests

▶

example
example test

✔

0.068 s

expand all User tests

▶

test_data1

✔

0.068 s

OK
function result: [0, 0, 0]

▶

test_data2

✔

0.068 s

OK
function result: [6, 2, 1]

▶

test_data3

✔

0.068 s

OK
function result: [10]

▶

test_data4

✔

0.068 s

OK
function result: [0, 0, 0]

Code: 11:21:25 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

// 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)
    if (N === 1) {
        return Array.from({ length: P.length }, () => 0);
    }
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }

    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

User test case 1:

[1, [1, 1, 1], [1, 1, 1]]

User test case 2:

[16, [1, 11, 10], [16, 15, 10]]

User test case 3:

[30000, [1], [26]]

User test case 4:

[3, [1, 1, 1], [1, 1, 3]]

Analysis

expand all Example tests

▶

example
example test

✔

0.072 s

expand all User tests

▶

test_data1

✔

0.072 s

OK
function result: [0, 0, 0]

▶

test_data2

✔

0.072 s

OK
function result: [6, 2, 1]

▶

test_data3

✔

0.072 s

OK
function result: [10]

▶

test_data4

✔

0.072 s

OK
function result: [0, 0, 0]

Code: 11:21:28 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

// 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)
    if (N === 1) {
        return Array.from({ length: P.length }, () => 0);
    }
    let primes = [];
    let semiPrimes = [];
    let max = Math.max(...Q);
    let min = Math.min(...P);
    
    for (let i = 2; i<=max; i++) {
        primes[i] = true;
        semiPrimes[i] = false;
    }
    
    for (let i = 2; i <= parseInt(Math.sqrt(max)); i++) {
        for (let j = i; j * i <= max; j++) {
            primes[j*i] = false;
            if (primes[j] && primes[i]) {
                semiPrimes[i*j] = true;
            } else {
                semiPrimes[i*j] = false;
            }
        }
    }
    
    let count = [0]
    for (let i = 1; i < semiPrimes.length; i++) {
        count[i] = count[i-1];
        if (semiPrimes[i]) {
            count[i]++;
        }
    }

    let answer = [];
    for (let i = 0; i< P.length; i++) {
        answer.push(count[Q[i]] - count[P[i]-1]);
    }
    return answer;
}

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

▶

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

✔

0.140 s

▶

large_random1
large random, length = ~30,000

✔

0.144 s

▶

large_random2
large random, length = ~30,000

✔

0.144 s

▶

extreme_large
all max ranges

✔

0.136 s