feat: add python3 solution to lc problem: No.2992

如果对于每个 1 <= i <= n，满足 gcd(a[i], i) == 1，数组 nums 就是 自整除 的。

Author: fxrcode

solution/2900-2999/2992.Number of Self-Divisible Permutations/README.md

@@ -108,7 +108,7 @@ class Solution:
                 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
 
@@ -267,7 +267,7 @@ class Solution:
         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]
 ```