C++ Taskbook Level 10.8

Write a program that will check whether it is possible to obtain from one string another by rearranging its letters.

Implement the Eratosthenes algorithm to find prime numbers in a given interval.

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},
}

Swap the two given rows:

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

Given an arbitrary two-dimensional array:

{
	{1, 2, 3, 4, 5},
	{1, 2, 3, 4, 5},
	{1, 2, 3, 4, 5},
	{1, 2, 3, 4, 5},
	{1, 2, 3, 4, 5},
}

Get the sum of the columns of this array. Present the result as an array of sums:

{
	5, 10, 15, 20, 25
}

Given a string containing any number of nested paired parentheses, write code that will check that the parentheses are positioned correctly.

This is correct:

"()()"

This is correct:

"(())"

This is incorrect, since the number of open brackets does not match the number of closed ones:

"())"

This is incorrect, because although the number of open brackets matches the number of closed ones, they are in the wrong order:

"))(("