Fix self-divisible condition using gcd function

Author: yanglbme

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

@@ -5,6 +5,6 @@ def selfDivisiblePermutationCount(self, n: int) -> int:
         for mask in range(1 << n):
             i = mask.bit_count()
             for j in range(1, n + 1):
-                if (mask >> (j - 1) & 1) == 1 and (i % j == 0 or j % i == 0):
+                if (mask >> (j - 1) & 1) == 1 and gcd(i, j) == 1:
                     f[mask] += f[mask ^ (1 << (j - 1))]
         return f[-1]