package com.javamultiplex.number;

import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

/**
 *
 * @author Rohit Agarwal
 * @category Number Problems
 * @problem Print all the divisors of given number
 *
 */
public class DivisorsBruteForce {

	public static void main(String[] args) {

		Scanner input = null;
		List<Integer> list = new ArrayList<>();
		int count = 0;
		try {
			input = new Scanner(System.in);
			System.out.println("Enter number : ");
			int number = input.nextInt();
			for (int i = 1; i <= number; i++) {
				if (number % i == 0) {
					count++;
					list.add(i);
				}
			}
			System.out.println("There are " + count + " divisors : " + list);
		} finally {
			if (input != null) {
				input.close();
			}
		}

	}

}