2 条题解

  • 1
    @ 2024-7-25 13:01:16

    参考答案:

    #include<iostream>
    
    using namespace std;
    
    int main()
    {
        int a, b, c;
        scanf("%d\n%d\n%d", &a, &b, &c);
    
        int sum1, sum2, sum3, sum4, sum5, sum6;
        sum1 = a * b * c;
        sum2 = (a + b) * c;
        sum3 = a * (b + c);
        sum4 = a + b + c;
        sum5 = a * b + c;
        sum6 = a + b * c;
        int d[6] = { sum1,sum2,sum3,sum4,sum5,sum6 };
    
        for (int i = 0; i < 5; i++)
        {
            if (d[i] > d[i + 1])
            {
                swap(d[i], d[i + 1]);
            }
        }
        printf("%d", d[5]);
    }
    
    • 0
      @ 2025-10-17 18:15:44

      Python:

      a, b, c = map(int, input().split())
      expr1 = a + b + c
      expr2 = a * b * c
      expr3 = a + b * c
      expr4 = (a + b) * c
      expr5 = a * b + c
      expr6 = a * (b + c)
      result = max(expr1, expr2, expr3, expr4, expr5, expr6)
      print(result)
      
      • 1

      信息

      ID
      43
      时间
      1000ms
      内存
      32MiB
      难度
      10
      标签
      递交数
      3
      已通过
      2
      上传者