solution/0800-0899/0808.Soup Servings/Solution.py at main

main

leetcode-beef

322 issues
2 pull requests
5,000 files
1 active branch

List view

solution\0800-0899\0808.Soup Servings\Solution.py

2 Complexity
2 Complexity / M
0 Duplication
1 Churn
18 Lines
17 Lines of Code
1 Methods
17 LOC / Method

class Solution:
    def soupServings(self, n: int) -> float:
        @cache
        def dfs(i, j):
            if i <= 0 and j <= 0:
                return 0.5
            if i <= 0:
                return 1
            if j <= 0:
                return 0
            return 0.25 * (
                dfs(i - 4, j)
                + dfs(i - 3, j - 1)
                + dfs(i - 2, j - 2)
                + dfs(i - 1, j - 3)
            )

        return 1 if n > 4800 else dfs((n + 24) // 25, (n + 24) // 25)