Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package Uprajnenie;
- import java.util.ArrayList;
- import java.util.List;
- import java.util.Scanner;
- public class ListOfPredicates {
- public static void main(String[] args) {
- Scanner scanner = new Scanner(System.in);
- int length = scanner.nextInt();
- scanner.nextLine(); // Consume newline
- List<Integer> deviders = new ArrayList<>();
- String[] inputDeviders = scanner.nextLine().split("\\s+");
- for (String s : inputDeviders) {
- int divisor = Integer.parseInt(s);
- if (!deviders.contains(divisor)) {
- deviders.add(divisor);
- }
- }
- List<Integer> numbers = new ArrayList<>();
- for (int i = 1; i <= length; i++) {
- if (isDivisible(i, deviders)) {
- numbers.add(i);
- }
- }
- for (int num : numbers) {
- System.out.print(num + " ");
- }
- }
- private static boolean isDivisible(int n, List<Integer> deviders) {
- for (int divisor : deviders) {
- if (n % divisor != 0) {
- return false;
- }
- }
- return true;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement