-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDivisors.java
48 lines (42 loc) · 1005 Bytes
/
Divisors.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
package com.javamultiplex.number;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
/**
*
* @author Rohit Agarwal
* @category Number Problems
* @problem Print all the divisors of given number
*
*/
public class Divisors {
public static void main(String[] args) {
Scanner input = null;
List<Integer> list = new ArrayList<>();
try {
input = new Scanner(System.in);
System.out.println("Enter number :");
int num = input.nextInt();
int limit = (int) Math.sqrt(num);
int temp = 0;
for (int i = 1; i <= limit; i++) {
if (num % i == 0) {
list.add(i);
temp = num / i;
if (i != temp) {
list.add(temp);
}
}
}
// Sorting list elements.
Collections.sort(list);
int divisors = list.size();
System.out.println("There are " + divisors + " divisors : " + list);
} finally {
if (input != null) {
input.close();
}
}
}
}