Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "stdafx.h"
- #include <stdio.h>
- #include <math.h>
- #include <conio.h>
- #include <iostream>
- #include <iostream>
- #include <windows.h>
- #include <algorithm>
- using namespace std;
- float maxtop(float* A) {
- float max = 0;
- for (int j = 0; j < 4; j++) {
- if (A[j] > max) {
- max = A[j];
- }
- }
- return max;
- }
- float* maxsort(float* A) {
- std::sort(A, A + 3);
- return A;
- }
- int main()
- {
- system("chcp 1251");
- system("cls");
- float A[3][4] = {},
- B[3] = {},
- C[3] = {},
- D[4][3] = {},
- E[3][4];
- for (int i = 0; i < 3; i++) {
- for (int j = 0; j < 4; j++) {
- cout << "Введите A[" << i + 1 << "][" << j + 1 << "]" << endl;
- cin >> A[i][j];
- }
- }
- cout << "Исходная матрица:" << endl;
- for (int i = 0; i < 3; i++) {
- for (int j = 0; j < 4; j++) {
- cout << A[i][j] << " ";
- }
- cout << endl;
- }
- for (int i = 0; i < 3; i++) {
- B[i] = maxtop(A[i]);
- cout << "Максимальный элемент в строке №" << i + 1 << " это: " << B[i] << endl;
- }
- for (int j = 0; j < 4; j++) {
- for (int i = 0; i < 3; i++) {
- D[j][i] = A[i][j];
- }
- float* C = maxsort(D[j]);
- for (int i = 0; i < 3; i++) {
- E[j][i] = C[i];
- }
- cout << "Ряд №" << j + 1 << " по позрастанию: " << C[0] << " " << C[1] << " " << C[2] << " " << endl;
- }
- cout << "Обработанная матрица:" << endl;
- for (int i = 0; i < 3; i++) {
- for (int j = 0; j < 4; j++) {
- cout << E[j][i] << " ";
- }
- cout << endl;
- }
- int k;
- cin >> k;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement