C++ programming using “*” for Christmas Tree Pattern
Program code:
#include<iostream>
using namespace std;
int main()
{
int width, height, i, j, k, n = 1;
cout << "Enter Christmas Tree Width & Height : ";
cin >> width >> height;
int space = width * height;
cout << "Christmas Tree \n";
for (int x = 1; x <= height; x++)
{
for (i = n; i <= width; i++)
{
for (j = space; j >= i; j--)
{
cout <<" ";
}
for (k = 1; k <= i; k++)
{
cout <<"* ";
}
cout <<"\n";
}
n = n + 2;
width = width + 2;
}
for (i = 1; i <= height - 1; i++)
{
for (j = space - 3; j >= 0; j--)
{
cout << " ";
}
for (k = 1; k <= height - 1; k++)
{
cout << "* ";
}
cout << "\n";
}
}
Enter Christmas Tree Width & Height : 4 5
Christmas Tree
*
* *
* * *
* * * *
* * *
* * * *
* * * * *
* * * * * *
* * * * *
* * * * * *
* * * * * * *
* * * * * * * *
* * * * * * *
* * * * * * * *
* * * * * * * * *
* * * * * * * * * *
* * * * * * * * *
* * * * * * * * * *
* * * * * * * * * * *
* * * * * * * * * * * *
* * * *
* * * *
* * * *
* * * *
Note: also read about Pattern Program Using Star
Please follow me to read my latest post on programming and technology if you like my post.
https://www.instagram.com/coderz.py/
https://www.facebook.com/coderz.py
Staying up to the mark is what defines me. Hi all! I’m Rabecca Fatima a keen learner, great enthusiast, ready to take new challenges as stepping stones towards flying colors.
Problem Statement: Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example…
Given an integer A. Compute and return the square root of A. If A is…
Given a zero-based permutation nums (0-indexed), build an array ans of the same length where…
A heap is a specialized tree-based data structure that satisfies the heap property. It is…
What is the Lowest Common Ancestor? In a tree, the lowest common ancestor (LCA) of…