2 solutions

  • -1
    @ 2026-7-31 22:05:24
    #include<bits/stdc++.h>
    using namespace std;
    int A[5][5];
    int main() {
        for (int i = 0; i < 5; ++i) {
            for (int j = 0; j < 5; ++j) {
                cin >> A[i][j];
            }
        }
    
        bool b = false;
        for (int i = 0; i < 5; ++i) {
            //最大
            int Max = INT_MIN, max = 0;
            for (int j = 0; j < 5; ++j) {
                if (A[i][j] > Max) {
                    Max = A[i][j];
                    max = j;
                }
            }
            //最小
            int Min = INT_MAX;
            for (int k = 0; k < 5; ++k) {
                if (A[k][max] < Min) {
                    Min = A[k][max];
                }
            }
            if (Max == Min) {
                cout << i + 1 << " " << max + 1 << " " << Max << endl;
                b = true;
                break;
            }
        }
        if (!b) {
            cout << "not found" << endl;
        }
        return 0;
    }
    • -1
      @ 2026-7-8 14:16:23
      #include<bits/stdc++.h>
      using namespace std;
      int A[5][5];
      int main() {
          for (int i = 0; i < 5; ++i) {
              for (int j = 0; j < 5; ++j) {
                  cin >> A[i][j];
              }
          }
      
          bool b = false;
          for (int i = 0; i < 5; ++i) {
              //最大
              int Max = INT_MIN, max = 0;
              for (int j = 0; j < 5; ++j) {
                  if (A[i][j] > Max) {
                      Max = A[i][j];
                      max = j;
                  }
              }
              //最小
              int Min = INT_MAX;
              for (int k = 0; k < 5; ++k) {
                  if (A[k][max] < Min) {
                      Min = A[k][max];
                  }
              }
              if (Max == Min) {
                  cout << i + 1 << " " << max + 1 << " " << Max << endl;
                  b = true;
                  break;
              }
          }
          if (!b) {
              cout << "not found" << endl;
          }
          return 0;
      }
      
      • 1

      Information

      ID
      544
      Time
      1000ms
      Memory
      128MiB
      Difficulty
      3
      Tags
      (None)
      # Submissions
      78
      Accepted
      22
      Uploaded By