C++ Taskbook Level 10.10

Given an array. Output to the console all possible permutations of the elements of this array.

Given two numbers, output to the console the process of multiplying these numbers in a column, like in school.

Given an arbitrary two-dimensional array:

{
	{11, 32, 13, 44, 55},
	{31, 42, 53, 66, 75},
	{12, 26, 33, 45, 52},
	{15, 22, 35, 64, 57},
	{21, 52, 32, 44, 38},
}

Find the maximum and minimum elements and swap them.

Given an arbitrary two-dimensional array:

{
	{11, 12, 13, 14, 15},
	{21, 22, 23, 24, 25},
	{31, 32, 33, 34, 35},
	{41, 42, 43, 44, 45},
	{51, 52, 53, 54, 55},
}

Write code that will reset the specified column:

{
	{11, 12,  0, 14, 15},
	{21, 22,  0, 24, 25},
	{31, 32,  0, 34, 35},
	{41, 42,  0, 44, 45},
	{51, 52,  0, 54, 55},
}

Given an arbitrary two-dimensional array:

{
	{11, 12, 13, 14, 15},
	{21, 22, 23, 24, 25},
	{31, 32, 33, 34, 35},
	{41, 42, 43, 44, 45},
	{51, 52, 53, 54, 55},
}

Transpose it:

{
	{11, 21, 31, 41, 51},
	{12, 22, 32, 42, 52},
	{13, 23, 33, 43, 53},
	{14, 24, 34, 44, 54},
	{15, 25, 35, 45, 55},
}