Reference no: EM132211142

Question :

Write a program pyramid.cpp that reads a positive odd whole number n and prints a pyramid where the last row contains all numbers from n down to 1 (i.e., descending order), the second to last row displays all numbers from n - 1 down to 2, the third to last row displays all numbers from n - 2 down to 3, etc.

The first row will contain only a single value, i.e. the middle value in the range, i.e. n down to 1.

Each successive row contains two more values than the previous row. This is the original problem , I WANT TO INVERSE the picture, here is my code, I don't know where is wrong? #include using namespace std;

int main(){

int n;

cout << "Enter n : ";

cin >> n;

int mid = (n+1)/2;

for(int i =1;i<=mid;i++){

for(int j=1;j<=i;j++){

cout << " ";}

int a=n;
int bb=n;
for(int h=bb;h>=1;h--){

if((a-i+1)>=10){

cout << (a-i+1)%10;}

else{ cout << a-i+1; }

a--; }

cout << endl;

bb = bb-2; }

return 0; }

The result runs the same as the original problem.