-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathNumbers.java
More file actions
189 lines (154 loc) · 3.86 KB
/
Copy pathNumbers.java
File metadata and controls
189 lines (154 loc) · 3.86 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
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
/* Write a Java program to find all the divisors of a given number.
Example:
Input:
36 → 1, 2, 3, 4, 6, 9, 12, 18, 36
28 → 1, 2, 4, 7, 14, 28 */
import java.util.Scanner;
class PrintDivisor {
public static void main(String[] args) {
System.out.println("Enter a number: ");
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for(int i = 1; i <= n; i++) {
if(n % i == 0) {
System.out.println(i);
}
}
}
}
/*
Write a Java program to print all divisors of a number with improved time complexity.
Example:
36 → 1, 2, 3, 4, 6, 9, 12, 18, 36
28 → 1, 2, 4, 7, 14, 28 */
class PrintDivisor2 {
public static void main(String[] args) {
System.out.println("Enter a number: ");
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for(int i = 1; i <= n/2; i++) {
if(n % i == 0) {
System.out.println(i);
}
}
System.out.println(n);
}
}
/* Write a Java program to print all divisors of a number using an optimized approach (up to √n).
Example Output:
Enter a number:
36
1
36
2
18
3
12
4
9
6 */
class DivisorNumber_2 {
public static void main(String[] args) {
System.out.println("Enter a number: ");
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for(int i = 1; i * i <= n; i++) {
if(n % i == 0) {
System.out.println(i);
if(n / i != i) {
System.out.println(n / i);
}
}
}
}
}
/* Write a Java program to print all divisors of a number and calculate the sum of all divisors using an optimized approach (up to √n).
Example Output:
Enter a number:
36
1
36
2
18
3
12
4
9
6
sum= 91 */
class SumOfDivisor {
public static void main(String[] args) {
System.out.println("Enter a number: ");
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int sum = 0;
for(int i = 1; i * i <= n; i++) {
if(n % i == 0) {
sum += i;
System.out.println(i);
if(n / i != i) {
System.out.println(n / i);
sum = sum + (n / i);
}
}
}
System.out.println("sum= " + sum);
sc.close();
}
}
/* Write a Java program to print the following number pattern using nested loops:
1 1 1 1 1
2 2 2 2 2
3 3 3 3 3
4 4 4 4 4
5 5 5 5 5 */
class NumberPattern{
public static void main(String[] args) {
for(int i = 1; i <= 5; i++) {
for(int j = 1; j <= 5; j++) {
System.out.print(" " + i);
}
System.out.println();
}
}
}
/* Write a Java program to print the following number pattern using nested loops.
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5
1 2 3 4 5 */
class NumberPattern2{
public static void main(String[] args) {
System.out.println("Enter row number: ");
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
System.out.print(" " + j);
}
System.out.println();
}
}
}
/* Write a Java program that takes a number as input and prints the following pattern:
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 */
class Demo {
public static void main(String[] args) {
System.out.println("Enter a number: ");
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int val = 1;
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
System.out.print(val + "\t");
val++;
}
System.out.println();
}
}
}