-
Notifications
You must be signed in to change notification settings - Fork 0
/
Main.java
44 lines (34 loc) · 1.2 KB
/
Main.java
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
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
/**
* This program generates a list of prime numbers from 2 to 49.
*/
class Main {
public static void main(String[] args) {
// Create an empty ArrayList to store prime numbers
List<Integer> primeNumbers = new ArrayList<>();
Scanner scanner = new Scanner(System.in);
// Prompt user for number
System.out.print("Enter a number: ");
int number = scanner.nextInt();
// Iterate over numbers from 2 to 49
for (int i = 2; i <= number; i++) {
boolean isPrime = true;
// Check if the number is divisible by any number in the primeNumbers list
for (int j : primeNumbers) {
if (i % j == 0) {
// If it is divisible, then mark it as non-prime and break out of the loop
isPrime = false;
break;
}
}
// If the number is prime, add it to the primeNumbers list
if (isPrime) {
primeNumbers.add(i);
}
}
// Print the list of prime numbers
System.out.println(primeNumbers);
}
}