new exercise

[alabhastam]

hi every one .
im begginer in c++ programing.
our master ask a question about printing a double diamond next to each other.
if we write 2 in cmd :

* *
* * * *
* *
* * <--------------:or tree
* * * *
* * * * * *
* * * *
* *
i will be tnxful :)
unfortunately i cant paint two diamond next to each other

[Handy Andy]

Hello alabhastam,

So what have you tried?

Post what code you have.

Andy

[seeplus]

What should the display look like? What are you meaning by a 'double diamond'?

[dutch]

@seeplus, you can look at the page source to see how he meant it to look:

         *    *
        * *  * *
         *    *
        *     *   <--------------:or tree
       * *   * *
      * * * * * *
       * *   * *
        *     *

Still looks a little off, though.
And I have no idea what "or tree" means.

@alabhastam, "new exercise" is a useless title. Something like "printing a double diamond" would be better.

[Ganado]

Neat tip, didn't know the whitespace was preserved client-side.

[salem c]

For anything more complicated than a simple geometric shape, it's better to start with something like

char screen[25][80];

Then you can 'draw' into any screen[y][x] you like in any order that makes your code life easy for you.

I mean, once you've figured out how to put one diamond at some screen[y][x] coordinate, doing the same 4 times is a doddle.

When you've finished 'drawing', you just print the whole grid.

[seeplus]

Maybe:

#include <iomanip>
#include <iostream>

void diamond(size_t width, size_t no)
{
	width += 1 - width % 2;

	const size_t rows {(width + 1) / 2};

	const auto outline {[no, rows](auto r) {
		for (size_t n = 0; n < no; ++n)
			std::cout << std::setw(rows - r) << "" << std::setw(r * 2 - 1) << std::setfill('*') << "" << std::setw(rows - r) << std::setfill(' ') << "";
		std::cout << '\n';
	}};

	for (size_t i = 1; i <= rows; ++i)
		outline(i);

	for (size_t i = rows - 1; i > 0; --i)
		outline(i);
}

int main()
{
	size_t width {}, across {}, deep {};

	std::cout << "Enter width, no across, no deep: ";
	std::cin >> width >> across >> deep;

	for (size_t n {}; n < deep; ++n)
		diamond(width, across);
}

Enter width, no across, no deep: 9 4 3
    *        *        *        *
   ***      ***      ***      ***
  *****    *****    *****    *****
 *******  *******  *******  *******
************************************
 *******  *******  *******  *******
  *****    *****    *****    *****
   ***      ***      ***      ***
    *        *        *        *
    *        *        *        *
   ***      ***      ***      ***
  *****    *****    *****    *****
 *******  *******  *******  *******
************************************
 *******  *******  *******  *******
  *****    *****    *****    *****
   ***      ***      ***      ***
    *        *        *        *
    *        *        *        *
   ***      ***      ***      ***
  *****    *****    *****    *****
 *******  *******  *******  *******
************************************
 *******  *******  *******  *******
  *****    *****    *****    *****
   ***      ***      ***      ***
    *        *        *        *

[seeplus]

For a tree, consider:

#include <iomanip>
#include <iostream>

void tree(size_t width, size_t no)
{
	width += 1 - width % 2;

	const auto outline {[no](auto r, auto pad, auto rows) {
		for (size_t n = 0; n < no; ++n)
			std::cout << std::setw(rows - r + pad) << "" << std::setw(r * 2 - 1) << std::setfill('*') << "" << std::setw(rows - r + pad) << std::setfill(' ') << "";
		std::cout << '\n';
	}};

	for (size_t t = width + 1; t > 0; t -= 2) {
		const size_t rows {t / 2};

		for (size_t i = 1; i <= rows; ++i)
			outline(i, (width - t + 1) / 2, rows);
	}
}

int main()
{
	size_t width {}, across {};

	std::cout << "Enter width, no across: ";
	std::cin >> width >> across;

	tree(width, across);
}

Enter width, no across: 9 3
    *        *        *
   ***      ***      ***
  *****    *****    *****
 *******  *******  *******
***************************
    *        *        *
   ***      ***      ***
  *****    *****    *****
 *******  *******  *******
    *        *        *
   ***      ***      ***
  *****    *****    *****
    *        *        *
   ***      ***      ***
    *        *        *