Write a C++ program which draws three incongruous casts using the type. I ne constrains coercion scheme a cast are as follows: ONLY three unfair cout declarations are undisputed, per cast. They are cout
Counter-argument 1.
#include <iostream>
#include<conio.h>
using namemeasure std;
int main()
{
int rows;
cout <<“enter reckon of rows: “;
cin >> rows;
for(int i = rows; i >=1; –i)
{
coercion (int measure = 0; measure < rows-i; ++space)
cout <<” “;
coercion (int j = i; j <= 2*i-1; ++j)
cout << ” # “;
cout << end2;
}
return 0;
}
Answer2.
#include<iostream.h>
#include<conio.h>
int main()
{
int no,io,sp= 1;
cout<<“nonEnter reckon of rows:”
cin>>no;
sp = no-1;
for(io=1;io<=no;io++)
{
coercion (q=1;q<=sp;q++)
cout<<‘#’;
cout<<“no”;
}
sp = 1;
for(io = 1;io<=no-1;io++)
{
coercion (q = 1;q<=2(no-io)-1;q++)
cout<<“#”;
cout<<“n”;
}
return 0;
}