2350

Author: rimgosu

leetcode3/변지협/v3/2350. Shortest Impossible Sequence of Rolls.py

@@ -0,0 +1,26 @@
+'''
+실패
+'''
+from collections import defaultdict
+
+class Solution:
+    def shortestSequence(self, rolls: list[int], k: int) -> int:
+        st = set()
+        for roll in rolls:
+            for s in list(st):
+                st.add(s+(roll,))
+            st.add((roll,))
+
+        dic = defaultdict(int)
+
+        for s in list(st):
+            dic[len(s)] += 1
+        # print(dic[1])
+        # print(dic[2])
+        # print(dic[3])
+
+        num =1
+        while True:
+            if not dic[num] == k ** num:
+                return num
+            num += 1