Algorithm for finding a graph.

情杀之翼

*****
                           * *
                          * *
                         * *
                        ***************
                          
                     Print an isosceles trapezoid with a height and an upper base of 5,
        
               Who can help me talk about the algorithm. Thank you

wenbinjiao

Output 5 *, and wrap
Cycle 5-K lines
   Back i box output a *
   Output 5 + 2 * i-2 spaces
   Output a *
   Output newline
   // The above can also generate the entire string before outputting
cycle
Output 5 + 2 * K *

yashiroxyz

Take a look at the following program to count triangles, which should help you:

#include<iostream.h>

void main()
{
const int position = 30; // Specify the position of the triangle vertex
const int lines = 6; // Specify the number of lines to be printed
    // Front lines-1 line
for( int i=0; i<lines-1; ++i)
{
for(int stars=0; stars<=80; ++stars)
{
if ((stars==position-i) || (stars==position+i))
cout <<'*';
else
cout << '';
}
cout << endl;
}
    // the last line
for(int stars=0; stars<=80; ++stars)
{
if ((stars>=position-i)&&(stars<=position+i))
cout <<'*';
else
cout << '';
}
}

soongsoong

cout<<" *****"<<endle;
for(int i=1;i<=3;i++){
   for(int j=5-i;j>0;j--)
     cout<<'';
     cout<<'*';
   for(int k=5;k<=9;k+2)
     cout<<'';
     cout<<'*'<<endle;}
cout<<"*********"<<endle;

soongsoong

There was a small mistake just now. Let’s take a look at this one
#include <iostream.h>

void main(){
cout<<" ***"<<endl;
for(int i=1;i<=3;i++){
   for(int j=5-i;j>0;j--)
     cout<<'';
     cout<<'*';
   for(int k=4;k<=4+2*i;k++)
     cout<<'';
     cout<<'*'<<endl;}
cout<<" *********"<<endl;
}