Update Solution.py

Author: yanglbme

solution/2300-2399/2338.Count the Number of Ideal Arrays/Solution.py

@@ -1,21 +1,21 @@
 class Solution:
     def idealArrays(self, n: int, maxValue: int) -> int:
-        @cache
-        def dfs(i, cnt):
-            res = c[-1][cnt - 1]
-            if cnt < n:
-                k = 2
-                while k * i <= maxValue:
-                    res = (res + dfs(k * i, cnt + 1)) % mod
-                    k += 1
-            return res
-
         c = [[0] * 16 for _ in range(n)]
         mod = 10**9 + 7
         for i in range(n):
             for j in range(min(16, i + 1)):
                 c[i][j] = 1 if j == 0 else (c[i - 1][j] + c[i - 1][j - 1]) % mod
+        f = [[0] * 16 for _ in range(maxValue + 1)]
+        for i in range(1, maxValue + 1):
+            f[i][1] = 1
+        for j in range(1, 15):
+            for i in range(1, maxValue + 1):
+                k = 2
+                while k * i <= maxValue:
+                    f[k * i][j + 1] = (f[k * i][j + 1] + f[i][j]) % mod
+                    k += 1
         ans = 0
         for i in range(1, maxValue + 1):
-            ans = (ans + dfs(i, 1)) % mod
+            for j in range(1, 16):
+                ans = (ans + f[i][j] * c[-1][j - 1]) % mod
         return ans