1 task: Dana matrix of size nxm, determine the number of b1, ..., bm, respectively, equal to:

1). the amounts of the elements of rows;

2). product of the elements of lines;

3). the lowest values \u200b\u200bof the elements of lines;

4). values \u200b\u200bof arithmetic elements lines;

5). differences of maximum and minimum values \u200b\u200bof the elements of strings.

3 task: Find the value of the leftmost and rightmost elements.

2 Challenge: Implement insertion sort the columns of the matrix.

4 task: Given a positive integer n, the integers a1, ..., an. Replace all seven members of the large sequence a1, ..., an the number 7. Calculate the number of such members.

Wednesday write: turboC ++;