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–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used JavaScript
Time spent on task 1 minutes
Notes
not defined yet
Task timeline
Code: 06:11:48 UTC,
java,
autosave
Code: 06:11:48 UTC,
java,
autosave
Code: 06:11:59 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) {
if (N===1) return 1;
let multiplier = 1;
let result = 1;
//can be even more quick if we take out the 2s
for (let i = 2; i <=Math.sqrt(N) ; i++) {
if (N % i === 0) {
multiplier = 1
while (N % i === 0) {
N /= i
multiplier++
}
result *= multiplier
}
}
//if it is a prime number, we add another factor of 2
if (N !== 1) {result *=2}
return result
}
Analysis
Code: 06:12: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(N) {
if (N===1) return 1;
let multiplier = 1;
let result = 1;
//can be even more quick if we take out the 2s
for (let i = 2; i <=Math.sqrt(N) ; i++) {
if (N % i === 0) {
multiplier = 1
while (N % i === 0) {
N /= i
multiplier++
}
result *= multiplier
}
}
//if it is a prime number, we add another factor of 2
if (N !== 1) {result *=2}
return result
}
Analysis
Code: 06:12:07 UTC,
js,
final,
score:
100
// you can write to stdout for debugging purposes, e.g.
// console.log('this is a debug message');
function solution(N) {
if (N===1) return 1;
let multiplier = 1;
let result = 1;
//can be even more quick if we take out the 2s
for (let i = 2; i <=Math.sqrt(N) ; i++) {
if (N % i === 0) {
multiplier = 1
while (N % i === 0) {
N /= i
multiplier++
}
result *= multiplier
}
}
//if it is a prime number, we add another factor of 2
if (N !== 1) {result *=2}
return result
}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.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
3.
0.068 s
OK
4.
0.068 s
OK
5.
0.068 s
OK
6.
0.068 s
OK
7.
0.068 s
OK
8.
0.068 s
OK
9.
0.068 s
OK
10.
0.068 s
OK
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
2.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
1.
0.068 s
OK
expand all
Performance 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
2.
0.068 s
OK
3.
0.068 s
OK
1.
0.068 s
OK
2.
0.068 s
OK
1.
0.068 s
OK
2.
0.072 s
OK
3.
0.068 s
OK
1.
0.068 s
OK
2.
0.076 s
OK
3.
0.068 s
OK