-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathProblemG2.cpp
More file actions
166 lines (154 loc) · 3.48 KB
/
Copy pathProblemG2.cpp
File metadata and controls
166 lines (154 loc) · 3.48 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
/*
Jingi Min
CIS 22A 2023 Fall
Laboratory Assignment G
ProblemG2
open the file, get a integers and find sum, smallest, largest and average of integers
*/
#include <iostream>
#include <string>
using namespace std;
int main() {
int menuSelect = 0, patternLength;
int i, j;
while(menuSelect != 5) {
cout << "1. Square pattern \n2. Triangle pattern \n3. Diagnoal pattern \n4. Reverse diagnoal pattern \n5. Quit" << endl;
cout << "Enter the number: ";
cin >> menuSelect;
if(menuSelect < 1 || menuSelect > 5) {
cout << "Error, enter between 1 ~ 5" << endl;
continue;
}
else if(menuSelect == 5) {
break;
}
cout << "Enter the size: ";
cin >> patternLength;
if(patternLength < 1 || patternLength > 9) {
cout << "Error, enter size between 1 ~ 9" << endl;
}
if(menuSelect == 1) {
for(i = 0; i < patternLength; ++i) {
for(j = 0; j < patternLength; ++j) {
cout << patternLength;
}
cout << endl;
}
}
else if(menuSelect == 2) {
for(i = 1; i <= patternLength; ++i) {
for(j = 0; j < i; ++j) {
cout << patternLength;
}
cout << endl;
}
}
else if(menuSelect == 3) {
for(i = 1; i <= patternLength; ++i) {
for(j = 1; j <= patternLength; ++j) {
if(i == j) {
cout << patternLength;
}
else {
cout << "*";
}
}
cout << endl;
}
}
else if(menuSelect == 4) {
for(i = 0; i < patternLength; ++i) {
for(j = 1; j <= patternLength; ++j) {
if(patternLength - i == j) {
cout << patternLength;
}
else {
cout << "*";
}
}
cout << endl;
}
}
}
return 0;
}
/*
1. Square pattern
2. Triangle pattern
3. Diagnoal pattern
4. Reverse diagnoal pattern
5. Quit
Enter the number: 9
Error, enter between 1 ~ 5
1. Square pattern
2. Triangle pattern
3. Diagnoal pattern
4. Reverse diagnoal pattern
5. Quit
Enter the number: 1
Enter the size: 11
Error, enter size between 1 ~ 9
1111111111111111111111
1111111111111111111111
1111111111111111111111
1111111111111111111111
1111111111111111111111
1111111111111111111111
1111111111111111111111
1111111111111111111111
1111111111111111111111
1111111111111111111111
1111111111111111111111
1. Square pattern
2. Triangle pattern
3. Diagnoal pattern
4. Reverse diagnoal pattern
5. Quit
Enter the number: 1
Enter the size: 3
333
333
333
1. Square pattern
2. Triangle pattern
3. Diagnoal pattern
4. Reverse diagnoal pattern
5. Quit
Enter the number: 2
Enter the size: 4
4
44
444
4444
1. Square pattern
2. Triangle pattern
3. Diagnoal pattern
4. Reverse diagnoal pattern
5. Quit
Enter the number: 3
Enter the size: 5
5****
*5***
**5**
***5*
****5
1. Square pattern
2. Triangle pattern
3. Diagnoal pattern
4. Reverse diagnoal pattern
5. Quit
Enter the number: 4
Enter the size: 6
*****6
****6*
***6**
**6***
*6****
6*****
1. Square pattern
2. Triangle pattern
3. Diagnoal pattern
4. Reverse diagnoal pattern
5. Quit
Enter the number: 5
*/