leetcode

0 class Solution {

1 public:

2 vector<long long> maximumEvenSplit(long long finalSum) const {

3 if (finalSum % 2) return {};

4 vector<long long> res;

5 for (long long crnt = 2; finalSum >= crnt; crnt += 2) {

6 res.push_back(crnt);

7 finalSum -= crnt;

8 }

9 res.back() += finalSum;

10 return res;

11 }

12 };