-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathTeste001.java
More file actions
66 lines (45 loc) · 1.1 KB
/
Copy pathTeste001.java
File metadata and controls
66 lines (45 loc) · 1.1 KB
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
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
package Programa;
import java.util.ArrayList;
import java.util.List;
public class Teste001 {
public static List<Integer> divisores(int n){
List<Integer> divs = new ArrayList<>();
for (int i = 1; i <= n/2; i++) {
if (n % i == 0) {
divs.add(i);
}
}
divs.add(n);
return divs;
}
public static void main(String[] args) {
long startTime = System.nanoTime();
int numero1 = 20;
System.out.println(numero1);
System.out.println(divisores(numero1));
int numero2 = 28;
System.out.println(numero2);
System.out.println(divisores(numero2));
int numero3 = 37;
System.out.println(numero3);
System.out.println(divisores(numero3));
System.out.println("--------------------------");
// Your code here
long endTime = System.nanoTime();
long duration = (endTime - startTime); // total time in nanoseconds
//milliseconds
System.out.println("Execution time: " + (duration / 1000000) + " ms");
}
}
/*
cód. mostrar lista de divisores de um número
20
[1, 2, 4, 5, 10, 20]
28
[1, 2, 4, 7, 14, 28]
37
[1, 37]
--------------------------
Execution time: 0 ms
*/
;