| | 1 | | // -------------------------------------------------------------------------------- |
| | 2 | | // Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | 3 | | // All Rights Reserved. |
| | 4 | | // -------------------------------------------------------------------------------- |
| | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | 9 | | // known as Yevhenii Yeriemeieiv). |
| | 10 | | // -------------------------------------------------------------------------------- |
| | 11 | |
|
| | 12 | | namespace LeetCode.Algorithms.DistributeCandiesAmongChildren2; |
| | 13 | |
|
| | 14 | | /// <inheritdoc /> |
| | 15 | | public class DistributeCandiesAmongChildren2Math : IDistributeCandiesAmongChildren2 |
| | 16 | | { |
| | 17 | | /// <summary> |
| | 18 | | /// Time complexity - O(1) |
| | 19 | | /// Space complexity - O(1) |
| | 20 | | /// </summary> |
| | 21 | | /// <param name="n"></param> |
| | 22 | | /// <param name="limit"></param> |
| | 23 | | /// <returns></returns> |
| | 24 | | public long DistributeCandies(int n, int limit) |
| 2 | 25 | | { |
| 2 | 26 | | return GetCombinationsCount(n + 2) |
| 2 | 27 | | - (GetCombinationsCount(n - limit + 1) * 3) |
| 2 | 28 | | + (GetCombinationsCount(n - (2 * (limit + 1)) + 2) * 3) |
| 2 | 29 | | - GetCombinationsCount(n - (3 * (limit + 1)) + 2); |
| 2 | 30 | | } |
| | 31 | |
|
| | 32 | | private static long GetCombinationsCount(int n) |
| 8 | 33 | | { |
| 8 | 34 | | if (n < 0) |
| 3 | 35 | | { |
| 3 | 36 | | return 0; |
| | 37 | | } |
| | 38 | |
|
| 5 | 39 | | return (long)n * (n - 1) / 2; |
| 8 | 40 | | } |
| | 41 | | } |