Test results - Codility

Tasks Details

medium

1. CountNonDivisible

Calculate the number of elements of an array that are not divisors of each element.

Task Score

100%

Correctness

100%

Performance

100%

You are given an array A consisting of N integers.

For each number A[i] such that 0 ≤ i < N, we want to count the number of elements of the array that are not the divisors of A[i]. We say that these elements are non-divisors.

For example, consider integer N = 5 and array A such that:

A[0] = 3 A[1] = 1 A[2] = 2 A[3] = 3 A[4] = 6

For the following elements:

A[0] = 3, the non-divisors are: 2, 6,

A[1] = 1, the non-divisors are: 3, 2, 3, 6,

A[2] = 2, the non-divisors are: 3, 3, 6,

A[3] = 3, the non-divisors are: 2, 6,

A[4] = 6, there aren't any non-divisors.

Write a function:

function solution(A);

that, given an array A consisting of N integers, returns a sequence of integers representing the amount of non-divisors.

Result array should be returned as an array of integers.

For example, given:

A[0] = 3 A[1] = 1 A[2] = 2 A[3] = 3 A[4] = 6

the function should return [2, 4, 3, 2, 0], as explained above.

Write an efficient algorithm for the following assumptions:

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

each element of array A is an integer within the range [1..2 * N].

Solution

Programming language used JavaScript

Time spent on task 60 minutes

Notes

not defined yet

Code: 19:37: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[] A) {
        // write your code in Java SE 8
    }
}

Code: 19:48:25 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6

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

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

Code: 19:48:55 UTC, js, autosave

show code in pop-up

1 2 3 4 5

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA).fill(0)
    
}

Code: 19:49:23 UTC, js, autosave

show code in pop-up

1 2 3 4 5

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
}

Code: 19:50:01 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    conso.
}

Code: 19:50:13 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map()
}

Code: 19:50:25 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        
    })
}

Code: 19:50:55 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        
    })
}

Code: 19:51:28 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        let non
    })
}

Code: 19:51:40 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        let nonDivisor = A.length
        
    })
}

Code: 19:52:18 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        let nonDivisor = A.length
        for
    })
}

Code: 19:52:39 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 0; i< Math.sqrt(number); i++){
            
        }
    })
}

Code: 19:53:17 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 0; i<= Math.sqrt(number); i++){
            
        }
    })
}

Code: 19:53:28 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 0; i <= Math.sqrt(number); i++){
            
        }
    })
}

Code: 19:53:53 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i <= Math.sqrt(number); i++){
            
        }
    })
}

Code: 19:54:23 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i <= Math.sqrt(number); i++){
            if(number % i !== 0) continue;
        }
    })
}

Code: 19:55:18 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i <= Math.sqrt(number); i++){
            if(number % i !== 0) continue;
            
        }
    })
}

Code: 19:55:34 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i <= Math.sqrt(number); i++){
            if(number % i !== 0) continue;
            nonDivisor -= counter[i]
        }
    })
}

Code: 19:57:26 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i <= Math.sqrt(number); i++){
            if(number % i !== 0) continue;
            nonDivisor -= counter[i]
            if
        }
    })
}

Code: 19:57:44 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i <= Math.sqrt(number); i++){
            if(number % i !== 0) continue;
            nonDivisor -= counter[i]
            if(i !== Math.sqrt(number)) nonDivisor = 
        }
    })
}

Code: 19:58:01 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i <= Math.sqrt(number); i++){
            if(number % i !== 0) continue;
            nonDivisor -= counter[i]
            if(i !== Math.sqrt(number)) nonDivisor = counters[v/i]
        }
    })
}

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i <= Math.sqrt(number); i++){
            if(number % i !== 0) continue;
            nonDivisor -= counter[i]
            if(i !== Math.sqrt(number)) nonDivisor = counters[v/i]
        }
        ret
    })
}

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counter);
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i <= Math.sqrt(number); i++){
            if(number % i !== 0) continue;
            nonDivisor -= counter[i]
            if(i !== Math.sqrt(number)) nonDivisor = counters[v/i]
        }
        return nonDivisor
    })
}

The submission is being evaluated.

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters);
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i <= Math.sqrt(number); i++){
            if(number % i !== 0) continue;
            nonDivisor -= counter[i]
            if(i !== Math.sqrt(number)) nonDivisor = counters[v/i]
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 19:59:02 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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters);
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i <= Math.sqrt(number); i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i !== Math.sqrt(number)) nonDivisor = counters[v/i]
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 19:59:12 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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters);
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i <= Math.sqrt(number); i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i !== Math.sqrt(number)) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 19:59:22 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i <= Math.sqrt(number); i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i !== Math.sqrt(number)) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

Code: 20:00:59 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i <= Math.sqrt(number); i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

Code: 20:01: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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i <= Math.sqrt(number); i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:01:42 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i <= number); i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

Code: 20:01:52 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

Code: 20:01:58 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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:04:55 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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2+1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:05:09 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    
    return A.map(number=>{
        let nonDivisor = A.length
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

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

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    
    return A.map(number=>{
        nonDivisor = A.length
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

Code: 20:07:21 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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    
    return A.map(number=>{
        nonDivisor = A.length
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:15:20 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    co
    return A.map(number=>{
        nonDivisor = A.length
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

Code: 20:15:25 UTC, js, verify, result: Failed

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        nonDivisor = A.length
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:16:31 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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        nonDivisor = A.length
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        // return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:16:35 UTC, js, verify, result: Failed

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        nonDivisor = A.length
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:16:55 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    constcounters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        nonDivisor = A.length
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

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

function solution(A) {
    lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        nonDivisor = A.length
        cons
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

Code: 20:18:19 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

function solution(A) {
    lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        nonDivisor = A.length
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:19:05 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = A.length
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

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

function solution(A) {
    lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = len
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

Code: 20:20:09 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor)
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

Code: 20:20:25 UTC, js, verify, result: Failed

show code in pop-up

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor)
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:20:53 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) {continue;console.log(`number${number} \t i`)
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor)
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

Code: 20:21: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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) {continue;console.log(`number${number} \t i${i}`)}
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor)
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

Code: 20:21: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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) {continue;console.log(`number${number} \t i${i}`)}
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor)
            if(i*i !== number){ nonDivisor = counters[number/i];}
        }
        return nonDivisor
    })
}

Code: 20:21:29 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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) {continue;console.log(`number${number} \t i${i}`)}
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor)
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i}`)}
        }
        return nonDivisor
    })
}

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) {continue;console.log(`number${number} \t i${i}`)}
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor)
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i} \t counters[number/i]${counters[number/i]}`)}
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:21: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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) {console.log(`number${number} \t i${i}`);continue;}
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor)
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i} \t counters[number/i]${counters[number/i]}`)}
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:22: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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) {console.log(`number${number} \t i${i}`);continue;}
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor, )
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i} \t counters[number/i]${counters[number/i]}`)}
        }
        return nonDivisor
    })
}

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) {console.log(`number${number} \t i${i}`);continue;}
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor, "\t counters[i]:",counters[i])
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i} \t counters[number/i]${counters[number/i]}`)}
        }
        return nonDivisor
    })
}

The submission is being evaluated.

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) {console.log(`number${number} \t i${i} cc`);continue;}
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor, "\t counters[i]:",counters[i])
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i} \t counters[number/i]${counters[number/i]}`)}
        }
        return nonDivisor
    })
}

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) {console.log(`number${number} \t i${i} cc`);continue;}
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor, "\t counters[i]:",counters[i])
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i} \t counters[number/i]${counters[number/i]}`)}
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:24: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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) {console.log(`number${number} \t i${i} ccccccc`);continue;}
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor, "\t counters[i]:",counters[i])
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i} \t counters[number/i]${counters[number/i]}`)}
        }
        return nonDivisor
    })
}

The submission is being evaluated.

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) {console.log(`ccccccc`);continue;}
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor, "\t counters[i]:",counters[i])
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i} \t counters[number/i]${counters[number/i]}`)}
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:24: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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) {console.log(`ccccccc`);continue
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor, "\t counters[i]:",counters[i])
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i} \t counters[number/i]${counters[number/i]}`)}
        }
        return nonDivisor
    })
}

Code: 20:24:34 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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor, "\t counters[i]:",counters[i])
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i} \t counters[number/i]${counters[number/i]}`)}
        }
        return nonDivisor
    })
}

The submission is being evaluated.

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor, "\t counters[i]:",counters[i])
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i} \t counters[number/i]${counters[number/i]}`)}
        }
        
        return nonDivisor
    })
}

Code: 20:26: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 18

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor, "\t counters[i]:",counters[i])
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i} \t counters[number/i]${counters[number/i]}`)}
        }
        console.log("Return: ", nonDivisor)
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:27: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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA; i++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor, "\t counters[i]:",counters[i])
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i} \t counters[number/i]${counters[number/i]}`)}
        }
        console.log("Return: ", nonDivisor)
        console.log("")
        return nonDivisor
    })
}

The submission is being evaluated.

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let i = 0; i<lenOfA;ji++) counters[A[i]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor, "\t counters[i]:",counters[i])
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i} \t counters[number/i]${counters[number/i]}`)}
        }
        console.log("Return: ", nonDivisor)
        console.log("")
        return nonDivisor
    })
}

Code: 20:28:46 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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA;j++) counters[A[j]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            console.log("NEW NonDivisor: ", nonDivisor, "\t counters[i]:",counters[i])
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i} \t counters[number/i]${counters[number/i]}`)}
        }
        console.log("Return: ", nonDivisor)
        console.log("")
        return nonDivisor
    })
}

The submission is being evaluated.

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA;j++) counters[A[j]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            if(i*i !== number){ nonDivisor = counters[number/i];console.log(`number${number} \t i${i} \t counters[number/i]${counters[number/i]}`)}
        }
        console.log("Return: ", nonDivisor)
        console.log("")
        return nonDivisor
    })
}

Code: 20:31:16 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA;j++) counters[A[j]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        console.log("Return: ", nonDivisor)
        console.log("")
        return nonDivisor
    })
}

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA;j++) counters[A[j]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        console.log("Non Divisor: ", nonDivisor)
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:31:27 UTC, js, verify, result: Failed

show code in pop-up

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA;j++) counters[A[j]]++;
    console.log(counters)
    return A.map(number=>{
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:31:40 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA;j++) counters[A[j]]++;
    
    return A.map(number=>{
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

Code: 20:32:36 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(A) {
  // write your code in JavaScript (Node.js 8.9.4)
  const counters = Array(A.length * 2 + 1).fill(0);

  for (let i = 0; i < A.length; i++) {
    counters[A[i]]++;
  }

  return A.map(v => {
    let nonDivisors = A.length;
    for (let i = 1; i * i <= v; i++) {
      if (v % i !== 0) {
        continue;
      }
      nonDivisors -= counters[i];
      if (i * i !== v) {
        nonDivisors -= counters[v / i];
      }
    }
    return nonDivisors;
  });
}

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

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

function solution(A) {
  // write your code in JavaScript (Node.js 8.9.4)
  const counters = Array(A.length * 2 + 1).fill(0);

  for (let i = 0; i < A.length; i++) {
    counters[A[i]]++;
  }

  return A.map(v => {
    let nonDivisors = A.length;
    for (let i = 1; i * i <= v; i++) {
      if (v % i !== 0) {
        continue;
      }
      nonDivisors -= counters[i];
      if (i * i !== v) {
        nonDivisors -= counters[v / i];
      }
    }
    return nonDivisors;
  });
}

The submission is being evaluated.

Code: 20:32:47 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

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

function solution(A) {
  const counters = Array(A.length * 2 + 1).fill(0);

  for (let i = 0; i < A.length; i++) {
    counters[A[i]]++;
  }

  return A.map(v => {
    let nonDivisors = A.length;
    for (let i = 1; i * i <= v; i++) {
      if (v % i !== 0) {
        continue;
      }
      nonDivisors -= counters[i];
      if (i * i !== v) {
        nonDivisors -= counters[v / i];
      }
    }
    return nonDivisors;
  });
}

Code: 20:33:04 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

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

function solution(A) {
    const lenOfA = A.length
  const counters = Array(A.length * 2 + 1).fill(0);

  for (let i = 0; i < lenOfA; i++) {
    counters[A[i]]++;
  }

  return A.map(v => {
    let nonDivisors = lenOfA;
    for (let i = 1; i * i <= v; i++) {
      if (v % i !== 0) {
        continue;
      }
      nonDivisors -= counters[i];
      if (i * i !== v) {
        nonDivisors -= counters[v / i];
      }
    }
    return nonDivisors;
  });
}

The submission is being evaluated.

Code: 20:33: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 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(A) {
    const lenOfA = A.length
    const counters = Array(A.length * 2 + 1).fill(0);

  for (let i = 0; i < lenOfA; i++) {
    counters[A[i]]++;
  }

  return A.map(v => {
    let nonDivisors = lenOfA;
    for (let i = 1; i * i <= v; i++) {
      if (v % i !== 0) {
        continue;
      }
      nonDivisors -= counters[i];
      if (i * i !== v) {
        nonDivisors -= counters[v / i];
      }
    }
    return nonDivisors;
  });
}

Code: 20:33:35 UTC, js, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(A.length * 2 + 1).fill(0);

    for (let i = 0; i < lenOfA; i++) counters[A[i]]++;

  return A.map(number => {
    let nonDivisors = lenOfA;
    for (let i = 1; i * i <= number; i++) {
      if (v % i !== 0) {
        continue;
      }
      nonDivisors -= counters[i];
      if (i * i !== v) {
        nonDivisors -= counters[number / i];
      }
    }
    return nonDivisors;
  });
}

The submission is being evaluated.

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

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(A.length * 2 + 1).fill(0);

    for (let i = 0; i < lenOfA; i++) counters[A[i]]++;

  return A.map(number => {
    let nonDivisors = lenOfA;
    for (let i = 1; i * i <= number; i++) {
      if (v % i !== 0) {
        continue;
      }
      nonDivisors -= counters[i];
      if (i * i !== number) {
        nonDivisors -= counters[number / i];
      }
    }
    return nonDivisors;
  });
}

The submission is being evaluated.

Code: 20:33:42 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

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(A.length * 2 + 1).fill(0);

    for (let i = 0; i < lenOfA; i++) counters[A[i]]++;

  return A.map(number => {
    let nonDivisors = lenOfA;
    for (let i = 1; i * i <= number; i++) {
      if (number % i !== 0) {
        continue;
      }
      nonDivisors -= counters[i];
      if (i * i !== number) {
        nonDivisors -= counters[number / i];
      }
    }
    return nonDivisors;
  });
}

The submission is being evaluated.

Code: 20:33:47 UTC, js, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(A.length * 2 + 1).fill(0);

    for (let i = 0; i < lenOfA; i++) counters[A[i]]++;

  return A.map(number => {
    let nonDivisors = lenOfA;
    for (let i = 1; i * i <= number; i++) {
      if (number % i !== 0) 
        continue;

      nonDivisors -= counters[i];
      if (i * i !== number) {
        nonDivisors -= counters[number / i];
      }
    }
    return nonDivisors;
  });
}

Code: 20:34:01 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

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(A.length * 2 + 1).fill(0);

    for (let i = 0; i < lenOfA; i++) counters[A[i]]++;

  return A.map(number => {
    let nonDivisors = lenOfA;
    for (let i = 1; i * i <= number; i++) {
      if (number % i !== 0) continue;
      nonDivisors -= counters[i];
      if (i * i !== number) nonDivisors -= counters[number / i];
    }
    return nonDivisors;
  });
}

The submission is being evaluated.

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

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(A.length * 2 + 1).fill(0);

    for (let i = 0; i < lenOfA; i++) counters[A[i]]++;

  return A.map(number => {
    let nonDivisors = lenOfA;
    for (let i = 1; i * i <= number; i++) {
      if (number % i !== 0) continue;
      nonDivisors -= counters[i];
      if (i * i !== number) nonDivisors -= counters[number / i];
    }
    return nonDivisors;
  })
}

The submission is being evaluated.

Code: 20:34: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

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(A.length * 2 + 1).fill(0);

    for (let i = 0; i < lenOfA; i++) counters[A[i]]++;

  return A.map(number => {
    let nonDivisors = lenOfA;
    for (let i = 1; i * i <= number; i++) {
      if (number % i !== 0) continue;
      nonDivisors -= counters[i];
      if (i * i !== number) {
        nonDivisors -= counters[number / i];
      }
    }
    return nonDivisors;
  });
}

Code: 20:34:37 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA;j++) counters[A[j]]++;
    
    return A.map(number=>{
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}

Code: 20:34: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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA;j++) counters[A[j]]++;
    
    return A.map(number=>{
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}
/*

    const lenOfA = A.length
    const counters = Array(A.length * 2 + 1).fill(0);

    for (let i = 0; i < lenOfA; i++) counters[A[i]]++;

  return A.map(number => {
    let nonDivisors = lenOfA;
    for (let i = 1; i * i <= number; i++) {
      if (number % i !== 0) continue;
      nonDivisors -= counters[i];
      if (i * i !== number) nonDivisors -= counters[number / i];
    }
    return nonDivisors;
  })
}*/

Code: 20:34: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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA;j++) counters[A[j]]++;
    
    return A.map(number=>{
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}
/*

    const counters = Array(A.length * 2 + 1).fill(0);

    for (let i = 0; i < lenOfA; i++) counters[A[i]]++;

  return A.map(number => {
    let nonDivisors = lenOfA;
    for (let i = 1; i * i <= number; i++) {
      if (number % i !== 0) continue;
      nonDivisors -= counters[i];
      if (i * i !== number) nonDivisors -= counters[number / i];
    }
    return nonDivisors;
  })
}*/

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA;j++) counters[A[j]]++;
    
    return A.map(number=>{
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}
/*


    for (let i = 0; i < lenOfA; i++) counters[A[i]]++;

  return A.map(number => {
    let nonDivisors = lenOfA;
    for (let i = 1; i * i <= number; i++) {
      if (number % i !== 0) continue;
      nonDivisors -= counters[i];
      if (i * i !== number) nonDivisors -= counters[number / i];
    }
    return nonDivisors;
  })
}*/

Code: 20:35: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 18 19 20 21 22 23 24 25 26

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA; j++) counters[A[j]]++;
    
    return A.map(number=>{
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}
/*
  return A.map(number => {
    let nonDivisors = lenOfA;
    for (let i = 1; i * i <= number; i++) {
      if (number % i !== 0) continue;
      nonDivisors -= counters[i];
      if (i * i !== number) nonDivisors -= counters[number / i];
    }
    return nonDivisors;
  })
}*/

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA; j++) counters[A[j]]++;
    
    return A.map(number=> {
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++){
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}
/*
  
    for (let i = 1; i * i <= number; i++) {
      if (number % i !== 0) continue;
      nonDivisors -= counters[i];
      if (i * i !== number) nonDivisors -= counters[number / i];
    }
    return nonDivisors;
  })
}*/

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA; j++) counters[A[j]]++;
    
    return A.map(number=> {
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++) {
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}
/*
  
    for (let i = 1; i * i <= number; i++) {
      if (number % i !== 0) continue;
      nonDivisors -= counters[i];
      if (i * i !== number) nonDivisors -= counters[number / i];
    }
    return nonDivisors;
  })
}*/

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA; j++) counters[A[j]]++;
    
    return A.map(number=> {
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++) {
            if(number % i !== 0) continue
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}
/*
  
      if (number % i !== 0) continue;
      nonDivisors -= counters[i];
      if (i * i !== number) nonDivisors -= counters[number / i];
    }
    return nonDivisors;
  })
}*/

Code: 20:36:07 UTC, js, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA; j++) counters[A[j]]++;
    
    return A.map(number=> {
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++) {
            if(number % i !== 0) continue;
            nonDivisor -= counters[i]
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}
/*
  
      if (number % i !== 0) continue;
      nonDivisors -= counters[i];
      if (i * i !== number) nonDivisors -= counters[number / i];
    }
    return nonDivisors;
  })
}*/

The submission is being evaluated.

Code: 20:36: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 18 19 20 21 22 23

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA; j++) counters[A[j]]++;
    
    return A.map(number=> {
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++) {
            if(number % i !== 0) continue;
            nonDivisor -= counters[i];
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}
/*
  
      nonDivisors -= counters[i];
      if (i * i !== number) nonDivisors -= counters[number / i];
    }
    return nonDivisors;
  })
}*/

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA; j++) counters[A[j]]++;
    
    return A.map(number=> {
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++) {
            if(number % i !== 0) continue;
            nonDivisor -= counters[i];
            if(i*i !== number) nonDivisor = counters[number/i]
        }
        return nonDivisor
    })
}
/*
  
      if (i * i !== number) nonDivisors -= counters[number / i];
    }
    return nonDivisors;
  })
}*/

Code: 20:36:36 UTC, js, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA; j++) counters[A[j]]++;
    
    return A.map(number=> {
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++) {
            if(number % i !== 0) continue;
            nonDivisor -= counters[i];
            if(i*i !== number) nonDivisor -= counters[number/i]
        }
        return nonDivisor
    })
}
/*
  
      if (i * i !== number) nonDivisors -= counters[number / i];
    }
    return nonDivisors;
  })
}*/

The submission is being evaluated.

Code: 20:36:43 UTC, js, autosave

show code in pop-up

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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA; j++) counters[A[j]]++;
    
    return A.map(number=> {
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++) {
            if(number % i !== 0) continue;
            nonDivisor -= counters[i];
            if(i*i !== number) nonDivisor -= counters[number/i]
        }
        return nonDivisor
    })
}

Code: 20:37: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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA; j++) counters[A[j]]++;
    
    return A.map(number=> {
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++) {
            if(number % i !== 0) continue;
            nonDivisor -= counters[i];
            if(i*i !== number) nonDivisor -= counters[number/i]
        }
        return nonDivisor
    })
}

The submission is being evaluated.

Code: 20:37:05 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

function solution(A) {
    const lenOfA = A.length
    const counters = Array(lenOfA*2 + 1).fill(0)
    for(let j = 0; j<lenOfA; j++) counters[A[j]]++;
    
    return A.map(number=> {
        let nonDivisor = lenOfA
        for(let i = 1; i*i <= number; i++) {
            if(number % i !== 0) continue;
            nonDivisor -= counters[i];
            if(i*i !== number) nonDivisor -= counters[number/i]
        }
        return nonDivisor
    })
}

The submission is being evaluated.