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–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 102 minutes
Notes
not defined yet
Code: 15:08:09 UTC,
java,
autosave
Code: 16:39:48 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 N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
}
Analysis
expand all
Example tests
1.
0.076 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, Array expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
{ '1': 1, '2': 1, '3': 2, '6': 1 }
Code: 16:40:03 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const nu
}
Code: 16:40:33 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
for (let i = 0; i < numbers.length; i++) {
}
}
Code: 16:40:43 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
for (let i = 0; i < numbers.length; i++) {
}
}
Code: 16:41:14 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const ninDivisor
for (let i = 0; i < numbers.length; i++) {
}
}
Code: 16:41:32 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
let nonDivisors = 0;
for (let )
}
}
Code: 16:41:56 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
let nonDivisors = 0;
let i = 0;
while (i * i <= )
}
}
Code: 16:42:06 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
let nonDivisors = 0;
let i = 0;
while (i * i <= numbers[i]) {
}
}
}
Code: 16:42:21 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
let nonDivisors = 0;
let i = 0;
while (i * i <= numbers[i]) {
if (i % )
i++;
}
}
}
Code: 16:42:54 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
co
let nonDivisors = 0;
let i = 0;
while (i * i <= numbers[i]) {
if (i % )
i++;
}
}
}
Code: 16:43:08 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let nonDivisors = 0;
let i = 0;
while (i * i <= numbers[i]) {
if (i % )
i++;
}
}
}
Code: 16:43:19 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let nonDivisors = 0;
let i = 0;
while (i * i <= current) {
if (current % i === 0) {
}
i++;
}
}
}
Code: 16:43:50 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let nonDivisors = 0;
let i = 0;
while (i * i <= current) {
if (current % i === 0) {
if (counts[i]) {
nonDivisors += counts[i];
}
}
i++;
}
}
}
Code: 16:44:10 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let nonDivisors = 0;
let i = 0;
while (i * i <= current) {
if (current % i === 0) {
if (counts[i]) {
nonDivisors += counts[i];
}
if (n/i === i) {
}
}
i++;
}
}
}
Code: 16:44:37 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let nonDivisors = 0;
let i = 0;
while (i * i <= current) {
if (current % i === 0) {
if (counts[i]) {
nonDivisors += counts[i];
}
if (n/i !== i) {
}
}
i++;
}
}
}
Code: 16:44:57 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let nonDivisors = 0;
let i = 0;
while (i * i <= current) {
if (current % i === 0) {
if (counts[i]) {
nonDivisors += counts[i];
}
if (n/i !== i) {
if (counts[i]) {
nonDivisors += counts[i];
}
}
}
i++;
}
}
}
Code: 16:45:11 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let nonDivisors = 0;
let i = 0;
while (i * i <= current) {
if (current % i === 0) {
if (counts[i]) {
nonDivisors += counts[i];
}
const pairDivisor =
if (n/i !== i) {
if (counts[i]) {
nonDivisors += counts[i];
}
}
}
i++;
}
}
}
Code: 16:45:38 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let nonDivisors = 0;
let i = 0;
while (i * i <= current) {
if (current % i === 0) {
if (counts[i]) {
nonDivisors += counts[i];
}
const divisorPair = n/i;
if (divisorPair !== i) {
if (counts[divisorPair]) {
nonDivisors += counts[divisorPair];
}
}
}
i++;
}
}
}
Code: 16:46:02 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let i = 0;
while (i * i <= current) {
if (current % i === 0) {
if (counts[i]) {
nonDivisors += counts[i];
}
const divisorPair = n/i;
if (divisorPair !== i) {
if (counts[divisorPair]) {
nonDivisors += counts[divisorPair];
}
}
}
i++;
}
}
}
Code: 16:46:16 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let i = 0;
while (i * i <= current) {
if (current % i === 0) {
if (counts[i]) {
divisors += counts[i];
}
const divisorPair = n/i;
if (divisorPair !== i) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
i++;
}
nonDivisors[]
}
}
Code: 16:46:26 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let i = 0;
while (i * i <= current) {
if (current % i === 0) {
if (counts[i]) {
divisors += counts[i];
}
const divisorPair = n/i;
if (divisorPair !== i) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
i++;
}
nonDivisors[current] =
}
}
Code: 16:46: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 N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let i = 0;
while (i * i <= current) {
if (current % i === 0) {
if (counts[i]) {
divisors += counts[i];
}
const divisorPair = n/i;
if (divisorPair !== i) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
i++;
}
nonDivisors[current] = N - divisors;
}
console.log(nonDivisors);
}
Analysis
expand all
Example tests
1.
0.124 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: i is not defined at solution (solution.js:20:33) 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:
{ '1': 1, '2': 1, '3': 2, '6': 1 }
Code: 16:46:57 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let j = 0;
while (j * j <= current) {
if (current % j === 0) {
if (counts[i]) {
divisors += counts[i];
}
const divisorPair = n/i;
if (divisorPair !== i) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
i++;
}
nonDivisors[current] = N - divisors;
}
console.log(nonDivisors);
}
Code: 16:47:13 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let j = 0;
while (j * j <= current) {
if (current % j === 0) {
if (counts[j]) {
divisors += counts[j];
}
const divisorPair = n/j;
if (divisorPair !== i) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
i++;
}
nonDivisors[current] = N - divisors;
}
console.log(nonDivisors);
}
Code: 16:47:26 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 N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let j = 0;
while (j * j <= current) {
if (current % j === 0) {
if (counts[j]) {
divisors += counts[j];
}
const divisorPair = n/j;
if (divisorPair !== j) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
j++;
}
nonDivisors[current] = N - divisors;
}
console.log(nonDivisors);
}
Analysis
expand all
Example tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: n is not defined at solution (solution.js:31:37) 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:
{ '1': 1, '2': 1, '3': 2, '6': 1 }
Code: 16:47:42 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let j = 0;
while (j * j <= current) {
if (current % j === 0) {
if (counts[j]) {
divisors += counts[j];
}
const divisorPair = /j;
if (divisorPair !== j) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
j++;
}
nonDivisors[current] = N - divisors;
}
console.log(nonDivisors);
}
Code: 16:47:56 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let j = 0;
while (j * j <= current) {
if (current % j === 0) {
if (counts[j]) {
divisors += counts[j];
}
const divisorPair = current/j;
if (divisorPair !== j) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
j++;
}
nonDivisors[current] = N - divisors;
}
console.log(nonDivisors);
}
Code: 16:47:57 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 N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let j = 0;
while (j * j <= current) {
if (current % j === 0) {
if (counts[j]) {
divisors += counts[j];
}
const divisorPair = current/j;
if (divisorPair !== j) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
j++;
}
nonDivisors[current] = N - divisors;
}
console.log(nonDivisors);
}
Analysis
expand all
Example tests
1.
0.104 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
Invalid result type, Array expected, 'undefined' found Perhaps you are missing a 'return'?stdout:
{ '1': 1, '2': 1, '3': 2, '6': 1 } { '1': 4, '2': 3, '3': 2, '6': 0 }
Code: 16:48:26 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let j = 0;
while (j * j <= current) {
if (current % j === 0) {
if (counts[j]) {
divisors += counts[j];
}
const divisorPair = current/j;
if (divisorPair !== j) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
j++;
}
nonDivisors[current] = N - divisors;
}
for (let i = 0; )
}
Code: 16:48:37 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let j = 0;
while (j * j <= current) {
if (current % j === 0) {
if (counts[j]) {
divisors += counts[j];
}
const divisorPair = current/j;
if (divisorPair !== j) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
j++;
}
nonDivisors[current] = N - divisors;
}
for (let i = 0; i < N; i++) {
}
}
Code: 16:49:02 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let j = 0;
while (j * j <= current) {
if (current % j === 0) {
if (counts[j]) {
divisors += counts[j];
}
const divisorPair = current/j;
if (divisorPair !== j) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
j++;
}
nonDivisors[current] = N - divisors;
}
const result = [];
for (let i = 0; i < N; i++) {
}
}
Code: 16:49:27 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 N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
console.log(counts);
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let j = 0;
while (j * j <= current) {
if (current % j === 0) {
if (counts[j]) {
divisors += counts[j];
}
const divisorPair = current/j;
if (divisorPair !== j) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
j++;
}
nonDivisors[current] = N - divisors;
}
const result = [];
for (let i = 0; i < N; i++) {
result.push(nonDivisors[A[i]]);
}
return result;
}
Analysis
expand all
Example tests
1.
0.076 s
OK
stdout:
{ '1': 1, '2': 1, '3': 2, '6': 1 }
Code: 16:49:32 UTC,
js,
autosave
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let j = 0;
while (j * j <= current) {
if (current % j === 0) {
if (counts[j]) {
divisors += counts[j];
}
const divisorPair = current/j;
if (divisorPair !== j) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
j++;
}
nonDivisors[current] = N - divisors;
}
const result = [];
for (let i = 0; i < N; i++) {
result.push(nonDivisors[A[i]]);
}
return result;
}
Code: 16:49:34 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 N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let j = 0;
while (j * j <= current) {
if (current % j === 0) {
if (counts[j]) {
divisors += counts[j];
}
const divisorPair = current/j;
if (divisorPair !== j) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
j++;
}
nonDivisors[current] = N - divisors;
}
const result = [];
for (let i = 0; i < N; i++) {
result.push(nonDivisors[A[i]]);
}
return result;
}
Analysis
Code: 16:49: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 N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let j = 0;
while (j * j <= current) {
if (current % j === 0) {
if (counts[j]) {
divisors += counts[j];
}
const divisorPair = current/j;
if (divisorPair !== j) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
j++;
}
nonDivisors[current] = N - divisors;
}
const result = [];
for (let i = 0; i < N; i++) {
result.push(nonDivisors[A[i]]);
}
return result;
}
Analysis
Code: 16:49:45 UTC,
js,
final,
score: 
100
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(A) {
const N = A.length;
const counts = {};
for (let i = 0; i < N; i++) {
if (counts[A[i]]) {
counts[A[i]]++;
} else {
counts[A[i]] = 1;
}
}
const numbers = Object.keys(counts);
const nonDivisors = {};
for (let i = 0; i < numbers.length; i++) {
const current = numbers[i];
let divisors = 0;
let j = 0;
while (j * j <= current) {
if (current % j === 0) {
if (counts[j]) {
divisors += counts[j];
}
const divisorPair = current/j;
if (divisorPair !== j) {
if (counts[divisorPair]) {
divisors += counts[divisorPair];
}
}
}
j++;
}
nonDivisors[current] = N - divisors;
}
const result = [];
for (let i = 0; i < N; i++) {
result.push(nonDivisors[A[i]]);
}
return result;
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N * log(N))
expand all
Correctness tests
1.
0.068 s
OK
2.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
1.
0.068 s
OK
1.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
expand all
Performance tests
1.
0.088 s
OK
2.
0.080 s
OK
1.
0.148 s
OK
2.
0.100 s
OK
1.
0.208 s
OK
2.
0.112 s
OK
1.
0.120 s
OK
2.
0.100 s
OK
3.
0.108 s
OK