feat(cli): 支持多重目录结构与特殊解法运行，新增解法列表选项

solutions/0049.PrimePermutations/euler_49.py

@@ -70,8 +70,8 @@ def main():
     for i, v in enumerate(primes):
         if v == max_sp:
             break
-        gap = int((max_sp - v) / 3)
-        for g in range(gap, (primes[i + 1] - v - 1), -1):
+        gap = (max_sp - v) // 2
+        for g in range(gap, 0, -1):
             if v + g in primes and v + 2 * g in primes:
                 if list_com(list(str(v)), list(str(v + g))):
                     if list_com(list(str(v)), list(str(v + 2 * g))):