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 |
package practice; import java.util.ArrayList; import java.util.Scanner; public class DivisorSum { public static void main(String[] args) { Scanner sc = new Scanner(System.in); ArrayList<Integer> arrayList = new ArrayList<Integer>(); int val = sc.nextInt(); if (val > 0) { arrayList = countDivisor(val); } else { System.exit(0); } for (Integer a : arrayList) { System.out.println(a); } } private static ArrayList<Integer> countDivisor(int n) { int i; ArrayList al = new ArrayList<>(); for (i = 1; i <= n; i++) { if (n % i == 0) { al.add(i); } } return al; } } |