Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <climits>
- #include <iomanip>
- #include <cmath>
- using namespace std;
- const int max = 5;
- void unos(int[][max]);
- int min_red(int[][max]);
- int max_red(int[][max]);
- void zamjeni(int[][max], int, int);
- void ispis(int[][max]);
- int main()
- {
- int matrica[max][max];
- unos(matrica);
- int najmanji_red = min_red(matrica), najveci_red = max_red(matrica);
- ispis(matrica);
- zamjeni(matrica, najmanji_red, najveci_red);
- ispis(matrica);
- system("pause >null");
- return 0;
- }
- void unos(int m[][max])
- {
- cout << "unesi vrijednosti matrice: " << "\n===================================\n";
- for (int i = 0; i < max; i++)
- {
- for (int j = 0; j < max; j++)
- {
- cout << i + 1 << " " << j + 1 << " --> ";
- cin >> m[i][j];
- }
- cout << endl;
- }
- }
- int min_red(int m[][max])
- {
- int x = INT_MAX, red;
- for (int i = 0; i < max; i++)
- {
- for (int j = 0; j < max; j++)
- {
- if (m[i][j]<x)
- {
- x = m[i][j];
- red = i;
- }
- }
- }
- return red;
- }
- int max_red(int m[][max])
- {
- int x = INT_MIN, red;
- for (int i = 0; i < max; i++)
- {
- for (int j = 0; j < max; j++)
- {
- if (m[i][j]>x)
- {
- x = m[i][j];
- red = i;
- }
- }
- }
- return red;
- }
- void zamjeni(int m[][max], int mini, int maxi)
- {
- for (int i = 0; i < max; i++)
- {
- int pom_var = m[mini][i];
- m[mini][i] = m[maxi][i];
- m[maxi][i] = pom_var;
- }
- }
- void ispis(int m[][max])
- {
- for (int i = 0; i < max; i++)
- {
- for (int j = 0; j < max; j++)
- {
- cout << setw(3) << m[i][j];
- }
- cout << endl;
- }
- cout << endl;
- }
Advertisement
Add Comment
Please, Sign In to add comment