w3resource

C++ Exercises: Display the pattern like right angle triangle with number increased by 1

C++ For Loop: Exercise-38 with Solution

Write a program in C++ to make such a pattern like right angle triangle with number increased by 1.

Pictorial Presentation:

C++ Exercises: Display the pattern like right angle triangle with number increased by 1

Sample Solution:-

C++ Code :

#include <iostream>
#include <string>
using namespace std;

int main()
{
   int i,j,rows,k=1;
    cout << "\n\n Display such a pattern like right angle triangle with number increased by 1:\n";
    cout << "---------------------------------------------------------------------------------\n";
    cout << " Input number of rows: ";
    cin >> rows;
   for(i=1;i<=rows;i++)
   {
	for(j=1;j<=i;j++)
	   cout<<k++<<" ";
	cout<<endl;
   }	
}

Sample Output:

 Display such a pattern like right angle triangle with number increased by 1:                                                                 
---------------------------------------------------------------------------------                                                             
 Input number of rows: 4                                               
1                                                                      
2 3                                                                    
4 5 6                                                                  
7 8 9 10

Flowchart:

Flowchart: Display the pattern like right angle triangle with number increased by 1

C++ Code Editor:

Contribute your code and comments through Disqus.

Previous: Write a program in C++ to make such a pattern like right angle triangle using number which will repeat the number for that row.
Next: Write a program in C++ to make such a pattern like a pyramid with numbers increased by 1.

What is the difficulty level of this exercise?



Share this Tutorial / Exercise on : Facebook and Twitter

C++ Programming: Tips of the Day

Which is faster: Stack allocation or Heap allocation

Stack allocation is much faster since all it really does is move the stack pointer. Using memory pools, you can get comparable performance out of heap allocation, but that comes with a slight added complexity and its own headaches.

Also, stack vs. heap is not only a performance consideration; it also tells you a lot about the expected lifetime of objects.

Ref : https://bit.ly/3COrdfj