YorKnEz

Problema 12

Dec 4th, 2021
116
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.89 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. int a[50][50], n;
  6.  
  7. void Citeste() {
  8. cin >> n;
  9.  
  10. for (int i = 0; i < n; i++) {
  11. for (int j = 0; j < n; j++) {
  12. cin >> a[i][j];
  13. }
  14. }
  15. }
  16.  
  17. int MinL (int l) {
  18. int mini = a[l][0];
  19.  
  20. for (int i = 1; i < n; i++) {
  21. if (a[l][i] < mini) {
  22. mini = a[l][i];
  23. }
  24. }
  25.  
  26. return mini;
  27. }
  28.  
  29. int MaxC (int x, int c) {
  30. int maxi = a[0][c];
  31.  
  32. for (int i = 0; i < n; i++) {
  33. if (a[i][c] > maxi) {
  34. maxi = a[i][c];
  35. }
  36. }
  37.  
  38. if (maxi == x) return 1;
  39.  
  40. return 0;
  41. }
  42.  
  43. void Scrie() {
  44. for (int i = 0; i < n; i++) {
  45. for (int j = 0; j < n; j++) {
  46. if (MaxC(MinL(i), j)) {
  47. cout << a[i][j] << " ";
  48. }
  49. }
  50. }
  51. }
  52.  
  53. int main() {
  54. Citeste();
  55.  
  56. Scrie();
  57.  
  58. return 0;
  59. }
  60.  
Advertisement
Add Comment
Please, Sign In to add comment