leetcode

0 class Solution {

1 public:

2 vector<int> missingRolls(const vector<int> &rolls, int mean, int n) const {

3 int sum = mean * (n + size(rolls));

4 int left = sum - accumulate(begin(rolls), end(rolls), 0);

5

6 if (left < n || n * 6 < left) return {};

7

8 vector<int> res(n, left / n);

9

10 for (int i = 0; i < left % n; i++) {

11 res[i]++;

12 }

13

14 return res;

15 }

16 };