9 条题解

  • 1

    思路

    std::max()拯救万物。

    code

    #include<bits/stdc++.h>
    using namespace std;
    int a,b;
    int main(){
    	cin>>a>>b;
    	cout<<max(a,b)*max(a,b);
    }
    
    • 1
      @ 2024-11-9 13:20:12

      #include<bits/stdc++.h> using namespace std; int main() { int a,b; cin>>a>>b; if(a<b) swap(a,b); cout<<a*a<<endl; return 0; }

    • 1
      @ 2024-11-8 16:58:40
      using namespace std;
      int main()
      {
      	int a,b;
      	cin>>a>>b;
      	if(a>b)
      	{
      		cout<<a*a<<endl;
      	}
      	else
      	{
      		cout<<b*b<<endl;
      	}
         return 0;
      }
      
      
      • 1

        #include<bits/stdc++.h> using namespace std; int main() { int a,b; cin>>a>>b; cout<<(max(a,b))*(max(a,b))<<endl; return 0;

        }

        • 1
          @ 2023-12-27 23:13:06

          #include<bits/stdc++.h> using namespace std; int main() {int a,b; cin>>a>>b; if(a>b) {cout<<aa; } else {cout<<bb; } return 0; }

          • 1
            @ 2023-12-27 13:48:18

            #include<bits/stdc++.h> using namespace std; int main() { double a,b,c,max; cin>>a>>b; max=(a>b)?a:b; c=max*max; cout<<c; return 0; }

            • 0
              @ 2024-11-22 13:52:25

              #include<bits/stdc++.h>
              using namespace std;
              int main()
              {int a,b;
              cin>>a>>b;
              cout<<(max(a,b))*(max(a,b))<<endl;
              return 0;
              }

              • -1
                @ 2023-12-26 12:54:20

                #include<bits/stdc++.h> using namespace std; int main() { int a,b,ans; cin>>a>>b; ans=(a>b?aa:bb); cout<<ans; return 0; }

                • -2

                  现在知道swap的用法了吧 #include<bits/stdc++.h> using namespace std; int main () { int a,b; cin>>a>>b; if(a>b) { cout<<aa; } else { swap(a,b); cout<<aa; } return 0; }

                  • 1

                  信息

                  ID
                  31
                  时间
                  1000ms
                  内存
                  256MiB
                  难度
                  1
                  标签
                  递交数
                  113
                  已通过
                  99
                  上传者