amp-web-push-widget button.amp-subscribe { display: inline-flex; align-items: center; border-radius: 5px; border: 0; box-sizing: border-box; margin: 0; padding: 10px 15px; cursor: pointer; outline: none; font-size: 15px; font-weight: 500; background: #4A90E2; margin-top: 7px; color: white; box-shadow: 0 1px 1px 0 rgba(0, 0, 0, 0.5); -webkit-tap-highlight-color: rgba(0, 0, 0, 0); } /** * Jetpack related posts */ /** * The Gutenberg block */ .jp-related-posts-i2 { margin-top: 1.5rem; } .jp-related-posts-i2__list { --hgap: 1rem; display: flex; flex-wrap: wrap; column-gap: var(--hgap); row-gap: 2rem; margin: 0; padding: 0; list-style-type: none; } .jp-related-posts-i2__post { display: flex; flex-direction: column; /* Default: 2 items by row */ flex-basis: calc( ( 100% - var(--hgap) ) / 2 ); } /* Quantity qeuries: see https://alistapart.com/article/quantity-queries-for-css/ */ .jp-related-posts-i2__post:nth-last-child(n+3):first-child, .jp-related-posts-i2__post:nth-last-child(n+3):first-child ~ * { /* From 3 total items on, 3 items by row */ flex-basis: calc( ( 100% - var(--hgap) * 2 ) / 3 ); } .jp-related-posts-i2__post:nth-last-child(4):first-child, .jp-related-posts-i2__post:nth-last-child(4):first-child ~ * { /* Exception for 4 total items: 2 items by row */ flex-basis: calc( ( 100% - var(--hgap) ) / 2 ); } .jp-related-posts-i2__post-link { display: flex; flex-direction: column; row-gap: 0.5rem; width: 100%; margin-bottom: 1rem; line-height: 1.2; } .jp-related-posts-i2__post-link:focus-visible { outline-offset: 2px; } .jp-related-posts-i2__post-img { order: -1; max-width: 100%; } .jp-related-posts-i2__post-defs { margin: 0; list-style-type: unset; } /* Hide, except from screen readers */ .jp-related-posts-i2__post-defs dt { position: absolute; width: 1px; height: 1px; overflow: hidden; clip: rect(1px, 1px, 1px, 1px); white-space: nowrap; } .jp-related-posts-i2__post-defs dd { margin: 0; } /* List view */ .jp-relatedposts-i2[data-layout="list"] .jp-related-posts-i2__list { display: block; } .jp-relatedposts-i2[data-layout="list"] .jp-related-posts-i2__post { margin-bottom: 2rem; } /* Breakpoints */ @media only screen and (max-width: 640px) { .jp-related-posts-i2__list { display: block; } .jp-related-posts-i2__post { margin-bottom: 2rem; } } /* Container */ #jp-relatedposts { display: none; padding-top: 1em; margin: 1em 0; position: relative; clear: both; } .jp-relatedposts:after { content: ''; display: block; clear: both; } /* Headline above related posts section, labeled "Related" */ #jp-relatedposts h3.jp-relatedposts-headline { margin: 0 0 1em 0; display: inline-block; float: left; font-size: 9pt; font-weight: bold; font-family: inherit; } #jp-relatedposts h3.jp-relatedposts-headline em:before { content: ""; display: block; width: 100%; min-width: 30px; border-top: 1px solid #dcdcde; border-top: 1px solid rgba(0,0,0,.2); margin-bottom: 1em; } #jp-relatedposts h3.jp-relatedposts-headline em { font-style: normal; font-weight: bold; } /* Related posts items (wrapping items) */ #jp-relatedposts .jp-relatedposts-items { clear: left; } #jp-relatedposts .jp-relatedposts-items-visual { margin-right: -20px; } /* Related posts item */ #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post { float: left; width: 33%; margin: 0 0 1em; /* Needs to be same as the main outer wrapper for Related Posts */ box-sizing: border-box; -moz-box-sizing: border-box; -webkit-box-sizing: border-box; } #jp-relatedposts .jp-relatedposts-items-visual .jp-relatedposts-post { padding-right: 20px; filter: alpha(opacity=80); -moz-opacity: .8; opacity: .8; } #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post:nth-child(3n+4), #jp-relatedposts .jp-relatedposts-items-visual .jp-relatedposts-post:nth-child(3n+4) { clear: both; } #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post:hover .jp-relatedposts-post-title a { text-decoration: underline; } #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post:hover { filter: alpha(opacity=100); -moz-opacity: 1; opacity: 1; } /* Related posts item content */ #jp-relatedposts .jp-relatedposts-items-visual h4.jp-relatedposts-post-title, #jp-relatedposts .jp-relatedposts-items p, #jp-relatedposts .jp-relatedposts-items time { font-size: 14px; line-height: 20px; margin: 0; } #jp-relatedposts .jp-relatedposts-items-visual .jp-relatedposts-post-nothumbs { position:relative; } #jp-relatedposts .jp-relatedposts-items-visual .jp-relatedposts-post-nothumbs a.jp-relatedposts-post-aoverlay { position:absolute; top:0; bottom:0; left:0; right:0; display:block; border-bottom: 0; } #jp-relatedposts .jp-relatedposts-items p, #jp-relatedposts .jp-relatedposts-items time { margin-bottom: 0; } #jp-relatedposts .jp-relatedposts-items-visual h4.jp-relatedposts-post-title { text-transform: none; margin: 0; font-family: inherit; display: block; max-width: 100%; } #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post .jp-relatedposts-post-title a { font-size: inherit; font-weight: normal; text-decoration: none; filter: alpha(opacity=100); -moz-opacity: 1; opacity: 1; } #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post .jp-relatedposts-post-title a:hover { text-decoration: underline; } #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post img.jp-relatedposts-post-img, #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post span { display: block; max-width: 90%; overflow: hidden; text-overflow: ellipsis; } #jp-relatedposts .jp-relatedposts-items-visual .jp-relatedposts-post img.jp-relatedposts-post-img, #jp-relatedposts .jp-relatedposts-items-visual .jp-relatedposts-post span { height: auto; max-width: 100%; } #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post .jp-relatedposts-post-date, #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post .jp-relatedposts-post-context { opacity: .6; } /* Hide the date by default, but leave the element there if a theme wants to use css to make it visible. */ .jp-relatedposts-items .jp-relatedposts-post .jp-relatedposts-post-date { display: none; } /* Behavior when there are thumbnails in visual mode */ #jp-relatedposts .jp-relatedposts-items-visual div.jp-relatedposts-post-thumbs p.jp-relatedposts-post-excerpt { display: none; } /* Behavior when there are no thumbnails in visual mode */ #jp-relatedposts .jp-relatedposts-items-visual .jp-relatedposts-post-nothumbs p.jp-relatedposts-post-excerpt { overflow: hidden; } #jp-relatedposts .jp-relatedposts-items-visual .jp-relatedposts-post-nothumbs span { margin-bottom: 1em; } /* List Layout */ #jp-relatedposts .jp-relatedposts-list .jp-relatedposts-post { clear: both; width: 100%; } #jp-relatedposts .jp-relatedposts-list .jp-relatedposts-post img.jp-relatedposts-post-img { float: left; overflow: hidden; max-width: 33%; margin-right: 3%; } #jp-relatedposts .jp-relatedposts-list h4.jp-relatedposts-post-title { display: inline-block; max-width: 63%; } /* * Responsive */ @media only screen and (max-width: 640px) { #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post { width: 50%; } #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post:nth-child(3n) { clear: left; } #jp-relatedposts .jp-relatedposts-items-visual { margin-right: 20px; } } @media only screen and (max-width: 320px) { #jp-relatedposts .jp-relatedposts-items .jp-relatedposts-post { width: 100%; clear: both; margin: 0 0 1em; } #jp-relatedposts .jp-relatedposts-list .jp-relatedposts-post img.jp-relatedposts-post-img, #jp-relatedposts .jp-relatedposts-list h4.jp-relatedposts-post-title { float: none; max-width: 100%; margin-right: 0; } } /* * Hide the related post section in the print view of a post */ @media print { .jp-relatedposts { display:none ; } }.wp-block-jetpack-rating-star span:not([aria-hidden="true"]) { display: none; } .amp-logo amp-img{width:190px} .amp-menu input{display:none;}.amp-menu li.menu-item-has-children ul{display:none;}.amp-menu li{position:relative;display:block;}.amp-menu > li a{display:block;} /* Inline styles */ ins.acss263b2{display:block;}figure.acss27061{max-width:271px;}div.acss21998{clear:both;float:left;margin:0 0 20px 0;max-width:100%;}ins.acss6cf41{display:block;text-align:center;}figure.acss7d2af{max-width:275px;}figure.acss776df{max-width:178px;}figure.acssd01c9{max-width:321px;}figure.acss9e6fa{max-width:219px;}figure.acss7559c{max-width:313px;}figure.acssa027d{max-width:295px;}div.acss138d7{clear:both;}div.acss2ef17{background:transparent url(https://code4coding.com/wp-content/plugins/related-posts-thumbnails/img/default.png) no-repeat scroll 0% 0%;height:150px;max-width:150px;}div.acss6bdea{color:#333333;font-family:Arial;font-size:12px;height:75px;}a.acss9bfd5{font-size:14.52427184466pt;}a.acssc37f8{font-size:16.427184466019pt;}a.acss29e97{font-size:16.631067961165pt;}a.acss361c8{font-size:17.174757281553pt;}a.acss51c7b{font-size:20.029126213592pt;}a.acssa2e10{font-size:20.097087378641pt;}a.acss5dd67{font-size:21.728155339806pt;}a.acssf0e8e{font-size:12.077669902913pt;}a.acss759e3{font-size:17.922330097087pt;}a.acss0abf8{font-size:21.252427184466pt;}a.acss2c000{font-size:13.300970873786pt;}a.acss349b0{font-size:10.038834951456pt;}a.acssf23c5{font-size:8pt;}a.acss7e0a8{font-size:9.2233009708738pt;}a.acsse6f77{font-size:16.970873786408pt;}a.acssc51bb{font-size:14.116504854369pt;}a.acss38f57{font-size:11.26213592233pt;}a.acss066f0{font-size:22pt;}a.acss4e811{font-size:17.31067961165pt;}a.acssfccbf{font-size:19.961165048544pt;}a.acss9cc90{font-size:12.417475728155pt;}a.acss01721{font-size:15.339805825243pt;}a.acsse9f66{font-size:15.543689320388pt;}a.acss72254{font-size:20.708737864078pt;}a.acsseedeb{font-size:20.776699029126pt;}a.acss25b87{font-size:14.320388349515pt;}a.acss7c517{font-size:12.757281553398pt;}a.acss6bf84{font-size:13.504854368932pt;}a.acss639cb{font-size:18.873786407767pt;}a.acss72378{font-size:18.126213592233pt;}a.acss551d3{font-size:16.291262135922pt;} .icon-widgets:before {content: "\e1bd";}.icon-search:before {content: "\e8b6";}.icon-shopping-cart:after {content: "\e8cc";}
pyramid triangle

Cpp program to pyramid number pattern

Cpp program to pyramid number pattern

In this tutorial, we will discuss the Cpp program to pyramid number pattern

In this topic, we will learn how to create number pattern in C++ language using for loop and while loop

pyramid number pattern programs in C++language

Pattern 1

Number Pyramid pattern 1

Pyramid triangle number pattern program 1

#include <iostream>
#include <conio.h>
using namespace std;

int main()
{
    int i,j,k,rows;
    cout<<"Enter the rows: ";
    cin>>rows;//get input from user
    for(i=1; i<=rows; i++){
            for(j=1; j<=rows; j++){
        cout <<" ";//print space

    }
    for(k=1; k<=i; k++){
        cout <<i;//print number
        cout <<" ";//print space amon  g the numbers

    }
    cout<<"\n";//move to nesxt line
    rows=rows-1;//row value decrease by 1
    }
    getch();
    return 0;
}

When the above code is compiled and executed, it produces the following results

Enter the rows: 9
          1
        2   2
      3   3   3
    4   4   4   4
 5    5   5   5   5

 

Pattern 2

Number Pyramid pattern 2

Pyramid triangle number pattern program 2

#include <iostream>
#include <conio.h>
using namespace std;

int main()
{
    int rows,i,j,k,l=1;
    cout<<"Enter the number of rows :";
    cin>>rows;//get user input from user
    cout<<"Here your pyramid pattern\n";
    for(i=1; i<=rows; i++){
        for(j=1; j<=rows-i; j++){//iterates for print space
        cout<<" ";//print space
    }
    for(k=1; k<=i; k++){
       cout<<k; //print number
       cout<<" ";//print space among the numnbers
    }
    cout<<"\n";
    k=k-1;
    }
    getch();
    return 0;
}

When the above code is compiled and executed, it produces the following results

Enter the number of rows :7
Here your pyramid pattern

                       1
                     1   2
                   1   2   3
                 1   2   3   4
              1    2   3   4   5
            1   2    3   4   5   6
          1   2    3   4   5   6   7

 

Pattern 3

Number Pyramid pattern 3

Pyramid triangle number pattern program 3

#include <iostream>
#include <conio.h>
using namespace std;

int main()
{
    int rows,i,j,k,l=1;
    cout<<"Enter the number of rows :";
    cin>>rows;
    cout<<"Here your pyramid pattern\n";
    for(i=1; i<=rows; i++){
        for(j=1; j<=rows-i; j++){//iterates for space
        cout<<" ";//print initial space for pyramid shape
    }
    for(k=1; k<=i; k++,l++){
       cout<<l;//print numbers
       cout<<" ";//print space amongthe numbers
    }
    cout<<"\n";//move to next line
    }
    getch();
    return 0;
}

When the above code is compiled and executed, it produces the following results

Enter the number of rows: 4
Here your pyramid pattern

          1
       2    3
     4   5    6
   7   8   9    10

 

Pattern 4

Number Pyramid pattern 4

Pyramid triangle number pattern program 4

Pascal triangle pyramid pattern

#include <iostream>
#include <conio.h>
using namespace std;
int main()
{
    int rows,i,j,space_count,count1=1;
    cout<<"Enter the number of rows: \n";
    cin>>rows;
    for(i=0; i<=rows; i++){//outer for loop - parent
        for(space_count=1; space_count<=rows-i; space_count++){
                cout<<" ";//print space-inner for loop
    }
    for(j=0; j<=i; j++){
            if(j==0 || i==0)
            count1=1;
    else
            count1=count1*(i-j+1)/j;
            cout<<count1<<" ";
    }
    cout<<"\n";
    }
getch();
    return 0;
}

When the above code is compiled and executed, it produces the following results

              1
            1   1
          1   2   1
        1   3   3   1
      1   4   6   4   1
   1    5   10  10  5   1
1    6    15  20  15  6   1

 

Pattern 5

Number Pyramid pattern 5

Pyramid triangle number pattern program 5

#include <iostream>
#include <conio.h>
using namespace std;
int main()
{
    int rows,i,j=0,num=0,count1=0,spaceCount;
    cout<<"Enter the number of rows: \n";
    cin>>rows;
    for(i=1; i<=rows; i++){//outer for loop - parent
        for(spaceCount=1; spaceCount<=rows-i; spaceCount++){
                cout<<" ";//print space-inner for loop
                count1++;
    }
    while(j!=2*i-1)
    {
        if(count1<=rows-1){
            cout<<i+j;
            num++;
        }
    else{
            num++;
            cout<<(i+j-2*num);
    }
    ++j;
    }
    num=count1=j=0;
    cout<<"\n";
    }
   getch();
    return 0;
}


When the above code is compiled and executed, it produces the following results

Enter the number of rows:
4
                1
            2 3 4
        3 4 5 6 7 
     4 5 6 7 8 9 10

 

Pattern 6

Number Pyramid pattern 6

Pyramid triangle number pattern program 6

#include <iostream>
#include <conio.h>
using namespace std;
int main()
{
    int rows,i,j=0,num=0,count1=0,spaceCount;
    cout<<"Enter the number of rows: \n";
    cin>>rows;
    for(i=1; i<=rows; i++){//outer for loop - parent
        for(spaceCount=1; spaceCount<=rows-i; spaceCount++){
                cout<<" ";//print space-inner for loop
                count1++;
    }
    while(j!=2*i-1)
    {
        if(count1<=rows-1){
            cout<<i+j;
            count1++;
        }
    else{
            num++;
            cout<<(i+j-2*num);
    }
    ++j;
    }
    num=count1=j=0;
    cout<<"\n";
    }
   getch();
    return 0;
}


When the above code is compiled and executed, it produces the following results

Enter the number of rows:

6

                  1
                232
              34543
            4567654
          567898765
     67891011109876

 

Pattern 7

Number Pyramid pattern 7

Pyramid triangle number pattern program 7

#include <iostream>
#include <conio.h>
using namespace std;
int main()
{
    int rows,i,j;
    cout<<"Enter the number of rows: \n";
    cin>>rows;
    for(i=1; i<=rows; i++){//outer for loop - parent
        for(j=1; j<=rows-i; j++){
                cout<<" ";//print space-inner for loop
    }
    for(j=1; j<i; j++){
            cout<<j;
            cout<<" ";
    }
    cout<<"\n" ;//move to next line
    }
   getch();
    return 0;
}



When the above code is compiled and executed, it produces the following results

Enter the number of rows:
8 
                  1
                1 2
              1 2 3
            1 2 3 4
          1 2 3 4 5
        1 2 3 4 5 6
      1 2 3 4 5 6 7

 

Suggested for you

For loop in C++ language

For loop in Java language

For loop in C language

For loop in Python language

while loop in C++ language

while loop in Java language

while loop in C language

while loop in Python language

Nested for loop in Java language

Nested for loop in C++ language

Nested for loop in C language

Nested for loop in Python language

 

If statements in Java  language

Nested if statements in Java  language

 

Floyd’s triangle number pattern using for loop in C

Floyd’s triangle pattern using nested for loop in Java

Floyd’s triangle pattern using nested while loop in Java

Hollow pyramid triangle pattern in C++ language

Pyramid star pattern in Cpp

Pyramid star pattern in C

Pyramid star pattern in Java 

Rhombus pattern in Java using for loop

Rhombus pattern in C using while loop

Rhombus pattern in C++ using do-while loop

Display Pyramid star pattern in C

Display Pyramid star pattern  in Java

 

C program to display pyramid star pattern
Inverted Pyramid number pattern in Cpp language
Karmehavannan

I am Mr S.Karmehavannan. Founder and CEO of this website. This website specially designed for the programming learners and very especially programming beginners, this website will gradually lead the learners to develop their programming skill.

View Comments

  • #include

    using namespace std;

    int main()
    {
    int i,j,k,row,c,l;
    cin>>row;
    for(i=1;i<=row;i++)
    {
    for(j=i;j<row;j++)
    cout<<" ";

    for(c=i,k=1;k<=i;k++)
    {

    cout<=1;l--)
    {

    cout<<c;
    c--;
    }

    cout<<endl;
    }
    return 0;
    }

Recent Posts

Explanation of one dimensional array (Data structure)

Explanation of one dimensional array In this post, we will discuss the concept of "Explanation…

2 months ago

Python program to calculate the sum of odd and even numbers in a list

Python program to calculate the sum of odd and even numbers in a list In…

2 months ago

Python code to Calculate sum of odd and even in a list

Python code to Calculate sum of odd and even in a list In this tutorial,…

2 months ago

How to find reverse number using method in Java

How to find reverse number using method In this article, we will discuss the concept…

2 months ago

C# inverted full pyramid star pattern

C# inverted full pyramid star pattern In this article, we will discuss the concept of…

3 months ago

C# Full Pyramid star pattern program

C# Full Pyramid star pattern program In this article, we will discuss the concept of…

3 months ago