Series Pattern C++

Download as txt, pdf, or txt
Download as txt, pdf, or txt
You are on page 1of 5

// Series of C++ Pattern

#include <iostream>
using namespace std;

int main() {

int rows;

cout << "Enter number of rows: ";


cin >> rows;

for(int i = 1; i <= rows; ++i) {


for(int j = 1; j <= i; ++j) {
cout << "* ";
}
cout << "\n";
}
return 0;
}

#include <iostream>
using namespace std;

int main() {

int rows;

cout << "Enter number of rows: ";


cin >> rows;

for(int i = 1; i <= rows; ++i) {


for(int j = 1; j <= i; ++j) {
cout << j << " ";
}
cout << "\n";
}
return 0;
}

#include <iostream>
using namespace std;

int main() {

char input, alphabet = 'A';

cout << "Enter the uppercase character you want to print in the last row: ";
cin >> input;

// convert input character to uppercase


input = toupper(input);

for(int i = 1; i <= (input-'A'+1); ++i) {


for(int j = 1; j <= i; ++j) {
cout << alphabet << " ";
}
++alphabet;
cout << endl;
}
return 0;
}

#include <iostream>
using namespace std;

int main() {

int rows;

cout << "Enter number of rows: ";


cin >> rows;

for(int i = rows; i >= 1; --i) {


for(int j = 1; j <= i; ++j) {
cout << "* ";
}
cout << endl;
}

return 0;
}

#include <iostream>
using namespace std;

int main() {

int rows;

cout << "Enter number of rows: ";


cin >> rows;

for(int i = rows; i >= 1; --i)


{
for(int j = 1; j <= i; ++j)
{
cout << j << " ";
}
cout << endl;
}

return 0;
}

#include <iostream>
using namespace std;

int main() {

int space, rows;

cout <<"Enter number of rows: ";


cin >> rows;

for(int i = 1, k = 0; i <= rows; ++i, k = 0) {


for(space = 1; space <= rows-i; ++space) {
cout <<" ";
}

while(k != 2*i-1) {
cout << "* ";
++k;
}
cout << endl;
}
return 0;
}

#include <iostream>
using namespace std;

int main() {

int rows, count = 0, count1 = 0, k = 0;

cout << "Enter number of rows: ";


cin >> rows;

for(int i = 1; i <= rows; ++i) {


for(int space = 1; space <= rows-i; ++space) {
cout << " ";
++count;
}

while(k != 2*i-1) {
if (count <= rows-1) {
cout << i+k << " ";
++count;
}
else {
++count1;
cout << i+k-2*count1 << " ";
}
++k;
}
count1 = count = k = 0;

cout << endl;


}
return 0;
}

#include <iostream>
using namespace std;

int main() {

int rows;

cout << "Enter number of rows: ";


cin >> rows;

for(int i = rows; i >= 1; --i) {


for(int space = 0; space < rows-i; ++space)
cout << " ";
for(int j = i; j <= 2*i-1; ++j)
cout << "* ";

for(int j = 0; j < i-1; ++j)


cout << "* ";

cout << endl;


}

return 0;
}

#include <iostream>
using namespace std;

int main() {

int rows, coef = 1;

cout << "Enter number of rows: ";


cin >> rows;

for(int i = 0; i < rows; i++) {


for(int space = 1; space <= rows-i; space++)
cout <<" ";

for(int j = 0; j <= i; j++) {


if (j == 0 || i == 0)
coef = 1;
else
coef = coef*(i-j+1)/j;

cout << coef << " ";


}
cout << endl;
}

return 0;
}

#include <iostream>
using namespace std;

int main() {

int rows, number = 1;

cout << "Enter number of rows: ";


cin >> rows;

for(int i = 1; i <= rows; i++) {


for(int j = 1; j <= i; ++j) {
cout << number << " ";
++number;
}

cout << endl;


}
return 0;
}

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy