Count the Number of Square-Free Subsets

Count the Number of Square-Free Subsets

You are given a positive integer 0-indexed array nums .

A subset of the array nums is square-free if the product of its elements is a square-free integer.

A square-free integer is an integer that is divisible by no square number other than $1$.

Return the number of square-free non-empty subsets of the array nums. Since the answer may be too large, return it modulo $10^9 + 7$.

A non-empty subset of nums is an array that can be obtained by deleting some (possibly none but not all) elements from nums . Two subsets are different if and only if the chosen indices to delete are different.

Example 1:

Input: nums = [3,4,4,5]
Output: 3
Explanation: There are 3 square-free subsets in this example:
- The subset consisting of the 0th element [3]. The product of its elements is 3, which is a square-free integer.
- The subset consisting of the 3rd element [5]. The product of its elements is 5, which is a square-free integer.
- The subset consisting of 0th and 3rd elements [3,5]. The product of its elements is 15, which is a square-free integer.
It can be proven that there are no more than 3 square-free subsets in the given array.

Example 2:

Input: nums = [1]
Output: 1
Explanation: There is 1 square-free subset in this example:
- The subset consisting of the 0th element [1]. The product of its elements is 1, which is a square-free integer.
It can be proven that there is no more than 1 square-free subset in the given array.

Constraints:

• $1 \leq \text{nums.length} \leq 1000$
• $1 \leq \text{nums}[i] \leq 30$

 

解题思路

　　首先一个数是所谓的“无平方因子数”等价于该数的质因数分解中每一个质因子的次数恰好是$1$。因此如果一个数的某个质因子的出现次数超过$1$，那么该数一定不是“无平方因子数”，与该数相乘得到的数明显也不是。

　　因此我们先把所有质因子次数恰好为$1$的数先筛出来，得到数组$a$，然后再从$a$中选择若干个数进行乘积，使得乘积结果的每个质因子的次数也要恰好为$1$，那么这就是一个合法的子集。注意到相乘的结果本质就是选择若干个均不同的质因子进行乘积。

　　由于每个数最大不超过$30$，而$30$以内的质数只有$10$个，因此可以考虑状压dp，状态一共有$10$个二进制位，如果状态的某位是$1$意味着相乘的结果包含该位所对应的质数。

　　定义状态$f(i,j)$表示从前$i$个数中选，乘积结果的状态为$j$（即包含了哪些质数）的所有方案的个数。根据第$i$个数是否选择来进行状态划分。设$st_{a_i}$表示第$i$个数$a_i$所包含的质因子的状态，状态转移方程为 $$f(i,j) = f(i-1,j) + f(i-1,j \wedge st_{a_i}) \ \ \ \ (\text{其中要保证} j \text{含有} st_{a_i} \text{中的所有质因子，即保证} j \ \& \ st_{a_i} = st_{a_i})$$

　　其中如果$a_i = 1$，那么$1$有选或不选这两种状态，因此$f(i,j) = f(i-1,j) + f(i-1,j)$。而如果定义$st_1 = 0$，那么上面那条状态转移方程同样适用，因为$j \ \& \ st_1 = j$，因此$f(i-1,j \wedge st_{a_i}) = f(i-1,j)$。

　　AC代码如下，时间复杂度为$O(n \cdot 2^{10})$：

class Solution {
public:
    int mod = 1e9 + 7;
    
    int squareFreeSubsets(vector<int>& nums) {
        int primes[10] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};  // 30以内的质数
        vector<int> a, st(31);
        for (auto &x : nums) {  // 对每个数进行质因数分解
            bool flag = true;   // 该数的每个质因子的次数是否均为1
            int t = x;
            for (int i = 0; i < 10; i++) {
                int p = primes[i];
                if (t % p == 0) {
                    int cnt = 0;
                    st[x] |= 1 << i;
                    while (t % p == 0) {
                        cnt++;
                        t /= p;
                    }
                    if (cnt > 1) {  // 质因子p的次数超过1个
                        flag = false;
                        break;
                    }
                }
            }
            if (flag) a.push_back(x);   // 筛出合法的数
        }
        int n = a.size();
        vector<vector<int>> f(n + 1, vector<int>(1 << 10));
        f[0][0] = 1;
        for (int i = 1; i <= n; i++) {
            for (int j = 0; j < 1 << 10; j++) {
                f[i][j] = f[i - 1][j];
                int t = st[a[i - 1]];
                if ((j & t) == t) f[i][j] = (f[i][j] + f[i - 1][j ^ t]) % mod;  // 如果要选择第i个数，那么j所表示的状态要包含第i个数的状态
            }
        }
        int ret = 0;
        for (int i = 0; i < 1 << 10; i++) { // 状态0表示空集和选择1的方案数
            ret = (ret + f[n][i]) % mod;
        }
        return (ret - 1 + mod) % mod;   // -1是除去空集的情况
    }
};

 

参考资料

　　状压 DP：https://leetcode.cn/problems/count-the-number-of-square-free-subsets/solution/zhuang-ya-dp-by-tsreaper-dwts/