-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathLab1Numbers.java
More file actions
106 lines (94 loc) · 3.4 KB
/
Lab1Numbers.java
File metadata and controls
106 lines (94 loc) · 3.4 KB
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
import java.util.Scanner;
public class Lab1Numbers {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int[] integernumbers;
System.out.println("Enter in the list of numbers, separated by spaces. Enter n for default range (1-100) and hit enter for the end of the list: ");
String userSingleInput = input.nextLine();
if( userSingleInput.equals("n") ) {
integernumbers = new int[100];
for( int i = 1; i <= 100; i++ ) {
integernumbers[i-1] = i;
}
} else {
String[] userInput = userSingleInput.split(" ");
for( String num : userInput ) {
System.out.println(num);
}
integernumbers = new int[userInput.length];
for( int i = 0; i < userInput.length; i++ ) {
integernumbers[i] = Integer.parseInt(userInput[i]);
}
}
System.out.println("Even Numbers:");
printEvenNumbers(integernumbers);
System.out.println("Odd Numbers:");
printOddNumbers(integernumbers);
System.out.println("Sum of numbers:");
printSum(integernumbers);
System.out.println("Largest Prime Number:");
printLargestPrimeNumber(integernumbers);
System.out.println("Perfect Square Numbers:");
printPerfectSquareNumbers(integernumbers);
input.close();
}
public static void printEvenNumbers(int[] numbers) {
for( int i = 0; i < numbers.length; i++ ) {
if( numbers[i] % 2 == 0 ) {
System.out.println(numbers[i]);
}
}
}
public static void printOddNumbers(int[] numbers) {
for( int i = 0; i < numbers.length; i++ ) {
if( numbers[i] % 2 != 0 ) {
System.out.println(numbers[i]);
}
}
}
public static void printSum(int[] numbers) {
int sum = 0;
for( int i = 0; i < numbers.length; i++ ) {
sum += numbers[i];
}
System.out.println("Sum: " + sum);
}
public static void printLargestPrimeNumber(int[] numbers) {
int largestPrime = -1;
for( int i = 0; i < numbers.length; i++ ) {
if( isPrime(numbers[i]) && numbers[i] > largestPrime ) {
largestPrime = numbers[i];
}
}
if( largestPrime != -1 ) {
System.out.println(largestPrime);
} else {
System.out.println("No prime numbers found.");
}
}
public static boolean isPrime(int num) {
if( num <= 1 ) {
return false;
}
for( int i = 2; i <= Math.sqrt(num); i++ ) {
if( num % i == 0 ) {
return false;
}
}
return true;
}
public static void printPerfectSquareNumbers(int[] numbers) {
for( int i = 0; i < numbers.length; i++ ) {
if( isPerfectSquare(numbers[i]) ) {
System.out.println(numbers[i]);
}
}
}
public static boolean isPerfectSquare(int num) {
if(Math.round(Math.sqrt(num))==Math.sqrt(num)) {
return true;
} else {
return false;
}
}
}