6 solutions

  • 2
    @ 2025-7-12 16:18:46

    #include <bits/stdc++.h> using namespace std;

    int main() { int a[3]; cin>>a[0]>>a[1]>>a[2]; sort(a,a+3); if(a[0]*a[0]+a[1]*a[1]==a[2]*a[2]){ cout<<a[2]*a[2]; }else cout<<a[1]*a[1]+a[2]*a[2]; return 0; }

    • 0
      @ 2025-7-12 16:20:28

      ####

      • -1
        @ 2025-7-12 16:21:19

        #include <bits/stdc++.h> using namespace std;

        int main() { int a[3];//数组长度 cin>>a[0]>>a[1]>>a[2];//数组位置 sort(a , a +3); if(a[0]*a[0]+a[1]*a[1]==a[2]*a[2]){ cout<<a[2]*a[2]; } else cout<<a[1]*a[1]+a[2]*a[2]; return 0; }

        • -1
          @ 2025-7-12 16:17:43

          #include <bits/stdc++.h> using namespace std;

          int main() { int a[3]; cin >> a[0] >> a[1] >> a[2]; sort(a, a + 3); if (a[0]*a[0] + a[1] == a[2]*a[2]) { cout << a[2]*a[2]; } else cout << a[1]*a[1] + a[2]*a[2]; return 0; }

          • -1
            @ 2025-7-12 16:17:24

            #include <bits/stdc++.h> using namespace std;

            int main() { int a[3]; cin>>a[0]>>a[1]>>a[2]; sort(a,a+3); if(a[0]*a[0]+a[1]*a[1]==a[2]*a[2]){ cout<<a[2]*a[2]; }else cout<<a[1]*a[1]+a[2]*a[2]; return 0; }

            • -1
              @ 2025-7-12 16:17:00

              #include <bits/stdc++.h> using namespace std;

              int main() { int a[3] ; cin >> a[0] >> a[1] >> a[2]; sort(a, a + 3); if (a[0]*a[0] + a[1]*a[1] == a[2] * a[2]) cout << a[2] * a[2]; else cout << a[1]*a[1] + a[2] * a[2]; return 0; }

              • 1

              Information

              ID
              359
              Time
              1000ms
              Memory
              64MiB
              Difficulty
              2
              Tags
              # Submissions
              52
              Accepted
              31
              Uploaded By