Tasks Details
easy
1.
CountFactors
Count factors of given number n.
Task Score
100%
Correctness
100%
Performance
100%
A positive integer D is a factor of a positive integer N if there exists an integer M such that N = D * M.
For example, 6 is a factor of 24, because M = 4 satisfies the above condition (24 = 6 * 4).
Write a function:
function solution(N);
that, given a positive integer N, returns the number of its factors.
For example, given N = 24, the function should return 8, because 24 has 8 factors, namely 1, 2, 3, 4, 6, 8, 12, 24. There are no other factors of 24.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..2,147,483,647].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 2 minutes
Notes
not defined yet
Code: 11:46:37 UTC,
java,
autosave
Code: 11:46:37 UTC,
java,
autosave
Code: 11:46:45 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(N) {
let i = 0;
let count = 0;
while (i * i <= N) {
if (N % i === 0) {
count += 2;
}
i++;
}
return count;
}
User test case 1:
[1]
Analysis
Code: 11:46:57 UTC,
js,
autosave
Code: 11:47:09 UTC,
js,
autosave
Code: 11:47:25 UTC,
js,
verify,
result: Failed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(N) {
let i = 0;
let count = 0;
while (i * i <= N) {
if (N % i === 0) {
if (i === n / i) {
count++;
} else {
count += 2;
}
}
i++;
}
return count;
}
User test case 1:
[1]
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:11:23)
at solutionWrapper (/tmp/exec.js:394:28)
at Promise.resolve.then (/tmp/exec.js:420: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
expand all
User tests
1.
0.072 s
RUNTIME ERROR,
tested program terminated with exit code 1
stderr:
ReferenceError: n is not defined
at solution (solution.js:11:23)
at solutionWrapper (/tmp/exec.js:394:28)
at Promise.resolve.then (/tmp/exec.js:420: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: 11:47:32 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(N) {
let i = 0;
let count = 0;
while (i * i <= N) {
if (N % i === 0) {
if (i === N / i) {
count++;
} else {
count += 2;
}
}
i++;
}
return count;
}
User test case 1:
[1]
Analysis
Code: 11:47:36 UTC,
js,
verify,
result: Passed
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(N) {
let i = 0;
let count = 0;
while (i * i <= N) {
if (N % i === 0) {
if (i === N / i) {
count++;
} else {
count += 2;
}
}
i++;
}
return count;
}
User test case 1:
[1]
Analysis
Code: 11:47:39 UTC,
js,
final,
score:
100
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(sqrt(N))
expand all
Correctness tests
1.
0.068 s
OK
2.
0.072 s
OK
1.
0.072 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.072 s
OK
6.
0.072 s
OK
7.
0.068 s
OK
8.
0.068 s
OK
9.
0.072 s
OK
10.
0.072 s
OK
1.
0.068 s
OK
2.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
3.
0.068 s
OK
1.
0.072 s
OK
2.
0.068 s
OK
1.
0.068 s
OK
2.
0.072 s
OK
1.
0.072 s
OK
2.
0.072 s
OK
1.
0.072 s
OK
expand all
Performance 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
2.
0.072 s
OK
3.
0.072 s
OK
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
2.
0.072 s
OK
3.
0.072 s
OK