-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathpattern(1).cpp
138 lines (113 loc) · 1.96 KB
/
pattern(1).cpp
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
/*
*
**
*** /// cout << "*";
****
*****
1
12
123 /// cout << j;
1234
12345
1
22
333 /// cout << i;
4444
55555
1
23
456
78910
1
22
303
4004
50005
600006
7000007
*/
#include<iostream>
using namespace std;
int main ()
{
int n{0};
cout << "Enter number of lines: " << endl;
cin >> n;
int i{1},j;
while (i<=n){
j=1; /// j is initialized every time before it is checked
while (j<=i){
cout << "*";
j=j+1;
}
cout << endl;
i=i+1;
}
return 0;
}
/// For the fourth pattern another variable needs to be defined named counter (k), print k and increment it.
/// Code:
#include<iostream>
using namespace std;
int main ()
{
int n{0};
cout << "Enter number of lines: " << endl;
cin >> n;
int i{1},j;
int k{1};
while (i<=n){
j=1; /// j is initialized every time before it is checked
while (j<=i){
cout << k;
j=j+1;
k=k+1;
}
cout << endl;
i=i+1;
}
return 0;
}
///Another approach for 4 pattern
#include<iostream>
using namespace std;
int main ()
{
int n{0};
cout << "Enter number of lines: " << endl;
cin >> n;
int i{1},j;
while (i<=n){
j=1; /// j is initialized every time before it is checked
while (j<=i){
cout << i*(i+1)/2+j;
j=j+1;
}
cout << endl;
i=i+1;
}
return 0;
}
///For pattern 5
#include<iostream>
using namespace std;
int main ()
{
int n{0};
cout << "Enter number of lines: " << endl;
cin >> n;
int i{1},j;
while (i<=n){
j=1; /// j is initialized every time before it is checked
while (j<=i){
if (j==1 || j==i)
cout << i;
else
cout << 0;
j=j+1;
}
cout << endl;
i=i+1;
}
return 0;
}