CodeForces 1992A Only Pluses

合集 - Codeforces(21)

1.CodeForces 1992E Novice's Mistake2024-07-162.CodeForces 1935A Entertainment in MAC2024-06-163.CodeForces 1992C Gorilla and Permutation2024-07-164.CodeForces 1992D Test of Love2024-07-165.CodeForces 1992B Angry Monk2024-07-16

6.CodeForces 1992A Only Pluses2024-07-16

7.CodeForces 1983B Corner Twist2024-07-168.CodeForces 1983A Array Divisibility2024-07-169.CodeForces 1983C Have Your Cake and Eat It Too2024-07-1610.CodeForces 1883B Chemistry2024-07-2611.CodeForces 1883A Morning2024-07-2612.CodeForces 1883C Raspberries2024-07-2813.CodeForces 1883D In Love2024-07-2814.CodeForces 1883E Look Back2024-07-2815.CodeForces 1883F You Are So Beautiful2024-07-2816.CodeForces 1883G1 Dances (Easy version)2024-07-2817.CodeForces 908B New Year and Buggy Bot2024-08-0118.CodeForces 908C New Year and Curling2024-08-0119.CodeForces 1132B Discounts2024-08-0120.CodeForces 1619D New Year's Problem2024-08-0121.Codeforces Round 964 (Div. 4)2024-08-07

收起

题目链接：CodeForces 1992A【Only Pluses】

---

---

思路

       

---

代码

#include <functional>
#include <iostream>
#include <algorithm>
#include <queue>
using namespace std;
#define ll long long
const int N = 500 + 10;
 
int a[N];
void solve() {
  int n, m = 5;
  priority_queue<int> q;
  for (int i = 1; i <= 3; i++) {
    cin >> a[i];
  }
 
  int res = 1;
  for (int i = 0; i <= 5; i++) {
    for (int j = 0; i + j <= 5; j++) {
      for (int k = 0; i + j + k <= 5; k++) {
        res = max(res, (a[1] + i) * (a[2] + j) * (a[3] + k));
      }
    }
  }
  cout << res << endl;
}
 
int main() {
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}