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:
class Solution { public int solution(int 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 Java 8
Time spent on task 1 minutes
Notes
not defined yet
Task timeline
Code: 11:46:49 UTC,
java,
autosave
Code: 11:46:52 UTC,
java,
verify,
result: Passed
// 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 N) {
// write your code in Java SE 8
int result = 0;
//1..2..3..4..6..8..12..24
//즉 제곱근까지의 반까지 나눠지는 갯수 x 2 = 총 개수
double sqrt = Math.sqrt(N);
for (int i = 1; i <= sqrt; i++) {
if (N % i == 0) {
result++;
}
}
int checkint = (int) sqrt;
result *= 2;
if (sqrt == checkint) {
result--;
}
return result;
}
}
Analysis
Code: 11:46:57 UTC,
java,
verify,
result: Passed
// 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 N) {
// write your code in Java SE 8
int result = 0;
//1..2..3..4..6..8..12..24
//즉 제곱근까지의 반까지 나눠지는 갯수 x 2 = 총 개수
double sqrt = Math.sqrt(N);
for (int i = 1; i <= sqrt; i++) {
if (N % i == 0) {
result++;
}
}
int checkint = (int) sqrt;
result *= 2;
if (sqrt == checkint) {
result--;
}
return result;
}
}
Analysis
Code: 11:47:01 UTC,
java,
final,
score:
100
// 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 N) {
// write your code in Java SE 8
int result = 0;
//1..2..3..4..6..8..12..24
//즉 제곱근까지의 반까지 나눠지는 갯수 x 2 = 총 개수
double sqrt = Math.sqrt(N);
for (int i = 1; i <= sqrt; i++) {
if (N % i == 0) {
result++;
}
}
int checkint = (int) sqrt;
result *= 2;
if (sqrt == checkint) {
result--;
}
return result;
}
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(sqrt(N))
expand all
Correctness tests
1.
0.008 s
OK
2.
0.008 s
OK
1.
0.004 s
OK
2.
0.008 s
OK
3.
0.004 s
OK
4.
0.004 s
OK
5.
0.004 s
OK
6.
0.004 s
OK
7.
0.008 s
OK
8.
0.004 s
OK
9.
0.008 s
OK
10.
0.004 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
1.
0.008 s
OK
2.
0.004 s
OK
1.
0.008 s
OK
2.
0.004 s
OK
1.
0.004 s
OK
expand all
Performance tests
1.
0.004 s
OK
2.
0.008 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
1.
0.008 s
OK
2.
0.004 s
OK
3.
0.004 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
1.
0.004 s
OK
2.
0.004 s
OK
3.
0.008 s
OK
1.
0.008 s
OK
2.
0.004 s
OK
3.
0.008 s
OK