0 added
0 removed
Original
2026-01-01
Modified
2026-02-26
1
int number = 50; Set<Integer> divisors = new TreeSet<>(); divisors.add(1); divisors.add(-1); for(int i = 2; i <= number / 2; i++) { if(number % i == 0) { divisors.add(i); divisors.add(-i); } } divisors.add(number); divisors.add(-number); System.out.println(divisors); // => [-50, -25, -10, -5, -2, -1, 1, 2, 5, 10, 25, 50]
1
int number = 50; Set<Integer> divisors = new TreeSet<>(); divisors.add(1); divisors.add(-1); for(int i = 2; i <= number / 2; i++) { if(number % i == 0) { divisors.add(i); divisors.add(-i); } } divisors.add(number); divisors.add(-number); System.out.println(divisors); // => [-50, -25, -10, -5, -2, -1, 1, 2, 5, 10, 25, 50]