-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathLab05 CSE110_JAVA.txt
345 lines (229 loc) · 7.63 KB
/
Lab05 CSE110_JAVA.txt
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
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
Lab05 - CSE110_JAVA
Classwork###################################################################################################
Task02------------------------------------------------------------------------------
class Main {
public static void main(String[] args) {
int N=5;
int prime_count=0;
int num =1;
while (prime_count<N){
int count = 0;
for (int i=1; i<=num; i++){
if (num%i==0){
count++;
}
}
if (count==2){
prime_count++;
System.out.println(num+" is a Prime number.");
}
num++;
}
}
}
Alter Task02-------------------
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of prime numbers you want to print: ");
int N = scanner.nextInt();
scanner.close();
int count = 0;
int number = 2;
while (count < N) {
boolean isPrime = true;
for (int i = 2; i <number; i++) {
if (number % i == 0) {
isPrime = false;
break;
}
}
if (isPrime) {
System.out.println(number);
count++;
}
number++;
}
}
}
Alter Task01 using both for loop--------------------------------------------------------------
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of prime numbers you want to print: ");
int N = scanner.nextInt();
scanner.close();
int number = 2;
for (int count=0; count < N; number++) {
boolean isPrime = true;
for (int i = 2; i <number; i++) {
if (number % i == 0) {
isPrime = false;
break;
}
}
if (isPrime) {
System.out.println(number);
count++;
}
}
}
}
Task03---------------------------------------------------------------------------
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the starting number: ");
int start = scanner.nextInt();
System.out.print("Enter the ending number: ");
int end = scanner.nextInt();
scanner.close();
System.out.println("Armstrong numbers:");
for (int number = start; number <= end; number++) {
int originalNumber = number;
int n = 0;
int result = 0;
// Count number of digits
while (originalNumber != 0) {
originalNumber /= 10;
++n;
}
originalNumber = number;
// Calculate sum of nth power of individual digits
while (originalNumber != 0) {
int remainder = originalNumber % 10;
result += Math.pow(remainder, n);
originalNumber /= 10;
}
// Check if the number is Armstrong
if (result == number) {
System.out.println(number);
}
}
}
}
Class Evaluation#######################################################################
Task01----------------------------------------------------------------------------
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
// Input range
System.out.print("Enter number 'N': ");
int N= scanner.nextInt();
int sum=0;
for (int i=1; i <=N; i++) {
for (int j=1; j<=i; j++) {
sum-=j;
}
}
System.out.println("The value of y: "+sum);
scanner.close();
}
}
Task02-----------------------------------------------------------------------
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
// Input range
while (true) {
System.out.print("Enter number 'N': ");
int N= scanner.nextInt();
if (N%2==0) {
int count=0;
for (int i=1; i<=N; i++) {
if (N%i==0) {
count += 1;
}
}
System.out.println(N+" has "+count+" divisors");
}
else{
System.out.println(N+" is an odd number. So, now stop. Run again!");
break;
}
}
}
}
Homework#############################################################################
Task05-----------------------------------------------------------------
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of perfect numbers to print: ");
int N = scanner.nextInt();
scanner.close();
int count = 0;
int number = 2;
System.out.println("Perfect numbers:");
for (; count < N; number++) {
int sum = 0;
for (int i = 1; i < number; i++) {
if (number % i == 0) {
sum += i;
}
}
if (sum == number) {
System.out.println(number);
count++;
}
}
}
}
Task06------------------------------------------------------------------------------
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Start: ");
int start = scanner.nextInt();
System.out.print("Stop: ");
int stop = scanner.nextInt();
scanner.close();
for (int i = start; i <= stop; i++) {
System.out.println("Times Table of " + i + ":");
for (int j = 1; j <= 10; j++) {
System.out.println(i + " x " + j + " = " + (i * j));
}
System.out.println();
}
}
}
Task07-----------------------------------------------------------------------------------
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
// Input range
System.out.print("Enter starting number (inclusive): ");
int start = scanner.nextInt();
System.out.print("Enter ending number (inclusive): ");
int end = scanner.nextInt();
// Input divisor
System.out.print("Enter divisor: ");
int divisor = scanner.nextInt();
// Loop through each number in the range
for (int num = start; num <= end; num++) {
if (divisor==0 || start==end){
System.out.print("Divisor cannot be 0 OR start and ending cannot be same");
break;
}
int product = 1;
int temp = num;
while (temp != 0) {
int digit = temp % 10;
product *= digit;
temp /= 10;
}
if (product % divisor == 0) {
System.out.print(product + " ");
}
}
scanner.close();
}
}