Fix self-divisible condition in permutation calculation

Author: yanglbme

solution/2900-2999/2992.Number of Self-Divisible Permutations/Solution.py

@@ -7,7 +7,7 @@ def dfs(mask: int) -> int:
                 return 1
             ans = 0
             for j in range(1, n + 1):
-                if (mask >> j & 1) == 0 and (i % j == 0 or j % i == 0):
+                if (mask >> j & 1) == 0 and gcd(i, j) == 1:
                     ans += dfs(mask | 1 << j)
             return ans