Tasks Details
medium
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] = 6For 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] = 6the 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].
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Total time used 60 minutes
Effective time used 60 minutes
Notes
not defined yet
Task timeline
Code: 19:37:47 UTC,
java,
autosave
Code: 19:52:39 UTC,
js,
autosave
Code: 19:53:17 UTC,
js,
autosave
Code: 19:53:28 UTC,
js,
autosave
Code: 19:53:53 UTC,
js,
autosave
Code: 19:54:23 UTC,
js,
autosave
Code: 19:55:18 UTC,
js,
autosave
Code: 19:55:34 UTC,
js,
autosave
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
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
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
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
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
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: counter is not defined at solution (solution.js:5:17) at solutionWrapper (/tmp/exec.js:409:28) at Promise.resolve.then (/tmp/exec.js:435:24) at <anonymous> at process._tickCallback (internal/process/next_tick.js:188:7) at Function.Module.runMain (module.js:686:11) at startup (bootstrap_node.js:187:16) at bootstrap_node.js:608:3
Code: 19:58:59 UTC,
js,
verify,
result: Failed
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: counter is not defined at A.map.number (solution.js:11:27) at Array.map (<anonymous>) at solution (solution.js:7:14) at solutionWrapper (/tmp/exec.js:409:28) at Promise.resolve.then (/tmp/exec.js:435: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:3stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ]
Code: 19:59:02 UTC,
js,
verify,
result: Failed
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
})
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: v is not defined at A.map.number (solution.js:12:63) at Array.map (<anonymous>) at solution (solution.js:7:14) at solutionWrapper (/tmp/exec.js:409:28) at Promise.resolve.then (/tmp/exec.js:435: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:3stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ]
Code: 19:59:12 UTC,
js,
verify,
result: Failed
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ]
Code: 19:59:22 UTC,
js,
autosave
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
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
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
})
}
Analysis
expand all
Example tests
1.
0.096 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
Code: 20:01:42 UTC,
js,
autosave
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
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
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
})
}
Analysis
expand all
Example tests
1.
0.072 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
Code: 20:04:55 UTC,
js,
verify,
result: Failed
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
})
}
Analysis
expand all
Example tests
1.
0.068 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
Code: 20:05:09 UTC,
js,
autosave
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
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
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
})
}
Analysis
expand all
Example tests
1.
0.072 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
Code: 20:15:20 UTC,
js,
autosave
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
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ]
Code: 20:16:31 UTC,
js,
verify,
result: Failed
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, integer expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ]
Code: 20:16:35 UTC,
js,
verify,
result: Failed
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ]
Code: 20:16:55 UTC,
js,
autosave
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
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
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ] Non Divisor: 5 Non Divisor: 5 Non Divisor: 5 Non Divisor: 5 Non Divisor: 5
Code: 20:19:05 UTC,
js,
autosave
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
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
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
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
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ] Non Divisor: 5 NEW NonDivisor: 4 Non Divisor: 5 NEW NonDivisor: 4 Non Divisor: 5 NEW NonDivisor: 4 Non Divisor: 5 NEW NonDivisor: 4 Non Divisor: 5 NEW NonDivisor: 4 NEW NonDivisor: 0
Code: 20:20:53 UTC,
js,
autosave
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
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
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
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
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ] Non Divisor: 5 NEW NonDivisor: 4 number3 i1 counters[number/i]2 Non Divisor: 5 NEW NonDivisor: 4 Non Divisor: 5 NEW NonDivisor: 4 number2 i1 counters[number/i]1 Non Divisor: 5 NEW NonDivisor: 4 number3 i1 counters[number/i]2 Non Divisor: 5 NEW NonDivisor: 4 number6 i1 counters[number/i]1 NEW NonDivisor: 0 number6 i2 counters[number/i]2
Code: 20:21:56 UTC,
js,
verify,
result: Failed
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ] Non Divisor: 5 NEW NonDivisor: 4 number3 i1 counters[number/i]2 Non Divisor: 5 NEW NonDivisor: 4 Non Divisor: 5 NEW NonDivisor: 4 number2 i1 counters[number/i]1 Non Divisor: 5 NEW NonDivisor: 4 number3 i1 counters[number/i]2 Non Divisor: 5 NEW NonDivisor: 4 number6 i1 counters[number/i]1 NEW NonDivisor: 0 number6 i2 counters[number/i]2
Code: 20:22:20 UTC,
js,
autosave
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
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ] Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number3 i1 counters[number/i]2 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number2 i1 counters[number/i]1 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number3 i1 counters[number/i]2 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number6 i1 counters[number/i]1 NEW NonDivisor: 0 counters[i]: 1 number6 i2 counters[number/i]2
Code: 20:23:53 UTC,
js,
autosave
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
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
})
}
Analysis
expand all
Example tests
1.
0.080 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ] Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number3 i1 counters[number/i]2 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number2 i1 counters[number/i]1 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number3 i1 counters[number/i]2 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number6 i1 counters[number/i]1 NEW NonDivisor: 0 counters[i]: 1 number6 i2 counters[number/i]2
Code: 20:24:08 UTC,
js,
verify,
result: Failed
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ] Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number3 i1 counters[number/i]2 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number2 i1 counters[number/i]1 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number3 i1 counters[number/i]2 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number6 i1 counters[number/i]1 NEW NonDivisor: 0 counters[i]: 1 number6 i2 counters[number/i]2
Code: 20:24:23 UTC,
js,
verify,
result: Failed
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ] Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number3 i1 counters[number/i]2 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number2 i1 counters[number/i]1 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number3 i1 counters[number/i]2 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number6 i1 counters[number/i]1 NEW NonDivisor: 0 counters[i]: 1 number6 i2 counters[number/i]2
Code: 20:24:31 UTC,
js,
autosave
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
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ] Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number3 i1 counters[number/i]2 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number2 i1 counters[number/i]1 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number3 i1 counters[number/i]2 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number6 i1 counters[number/i]1 NEW NonDivisor: 0 counters[i]: 1 number6 i2 counters[number/i]2
Code: 20:26:41 UTC,
js,
autosave
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
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ] Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number3 i1 counters[number/i]2 Return: 2 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 Return: 4 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number2 i1 counters[number/i]1 Return: 1 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number3 i1 counters[number/i]2 Return: 2 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number6 i1 counters[number/i]1 NEW NonDivisor: 0 counters[i]: 1 number6 i2 counters[number/i]2 Return: 2
Code: 20:27:00 UTC,
js,
verify,
result: Failed
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ] Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number3 i1 counters[number/i]2 Return: 2 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 Return: 4 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number2 i1 counters[number/i]1 Return: 1 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number3 i1 counters[number/i]2 Return: 2 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number6 i1 counters[number/i]1 NEW NonDivisor: 0 counters[i]: 1 number6 i2 counters[number/i]2 Return: 2
Code: 20:28:38 UTC,
js,
autosave
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
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ] Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number3 i1 counters[number/i]2 Return: 2 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 Return: 4 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number2 i1 counters[number/i]1 Return: 1 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number3 i1 counters[number/i]2 Return: 2 Non Divisor: 5 NEW NonDivisor: 4 counters[i]: 1 number6 i1 counters[number/i]1 NEW NonDivisor: 0 counters[i]: 1 number6 i2 counters[number/i]2 Return: 2
Code: 20:31:00 UTC,
js,
autosave
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
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
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ] Non Divisor: 5 Non Divisor: 5 Non Divisor: 5 Non Divisor: 5 Non Divisor: 5
Code: 20:31:27 UTC,
js,
verify,
result: Failed
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
})
}
Analysis
expand all
Example tests
1.
0.076 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
stdout:
[ 0, 1, 1, 2, 0, 0, 1, 0, 0, 0, 0 ]
Code: 20:31:40 UTC,
js,
autosave
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
// 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
// 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;
});
}
Analysis
Code: 20:32:47 UTC,
js,
autosave
// 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
// 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;
});
}
Analysis
Code: 20:33:15 UTC,
js,
autosave
// 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
// 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;
});
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: v is not defined at A.map.number (solution.js:13:7) at Array.map (<anonymous>) at solution (solution.js:10:12) at solutionWrapper (/tmp/exec.js:409:28) at Promise.resolve.then (/tmp/exec.js:435:24) at <anonymous> at process._tickCallback (internal/process/next_tick.js:188:7) at Function.Module.runMain (module.js:686:11) at startup (bootstrap_node.js:187:16) at bootstrap_node.js:608:3
Code: 20:33:38 UTC,
js,
verify,
result: Failed
// 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;
});
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: v is not defined at A.map.number (solution.js:13:7) at Array.map (<anonymous>) at solution (solution.js:10:12) at solutionWrapper (/tmp/exec.js:409:28) at Promise.resolve.then (/tmp/exec.js:435:24) at <anonymous> at process._tickCallback (internal/process/next_tick.js:188:7) at Function.Module.runMain (module.js:686:11) at startup (bootstrap_node.js:187:16) at bootstrap_node.js:608:3
Code: 20:33:42 UTC,
js,
verify,
result: Passed
// 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;
});
}
Analysis
Code: 20:33:47 UTC,
js,
autosave
// 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
// 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;
});
}
Analysis
Code: 20:34:14 UTC,
js,
verify,
result: Passed
// 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;
})
}
Analysis
Code: 20:34:20 UTC,
js,
autosave
// 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
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
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
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
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
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
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
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
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
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;
})
}*/
Analysis
expand all
Example tests
1.
0.068 s
WRONG ANSWER,
got [2, 4, 1, 2, 2] expected [2, 4, 3, 2, 0]
Code: 20:36:19 UTC,
js,
autosave
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
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
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;
})
}*/
Analysis
Code: 20:36:43 UTC,
js,
autosave
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
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
})
}
Analysis
Code: 20:37:05 UTC,
js,
final,
score: 
100
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
})
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N * log(N))
expand all
Correctness tests
1.
0.072 s
OK
2.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.072 s
OK
1.
0.072 s
OK
1.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
expand all
Performance tests
1.
0.088 s
OK
2.
0.084 s
OK
1.
0.116 s
OK
2.
0.116 s
OK
1.
0.140 s
OK
2.
0.152 s
OK
1.
0.212 s
OK
2.
0.104 s
OK
3.
0.112 s
OK