CPMagical CP Library

Problem solution · Java

Count the Number of Square-Free Subsets

Count the Number of Square-Free Subsets: a Java solution using direct simulation. Learn the idea, check the complexity, and read the full code, with credit to walkccc LeetCode Solutions.

Technique
Direct simulation
Source
walkccc LeetCode Solutions
Length
48 lines
Start with the idea.

Try the problem first. If you get stuck, read the approach below, then write your own solution. The full code is at the bottom.

Approach

Direct simulation

For Count the Number of Square-Free Subsets, the implementation follows the problem’s operations directly while maintaining only the state needed for the next decision.

  1. Translate each rule into one explicit state update.
  2. Maintain the invariant after every processed item.
  3. Return the accumulated state once all relevant input has been handled.

Code notes

  • 48 lines of Java from the credited upstream file 2572.java.
  • The implementation visibly relies on sequence storage.
  • 3 loop blocks detected.

Complexity

Count the number and nesting of passes over the input, then include the maintained containers in the memory estimate.

Check the problem constraints before deciding whether this complexity will pass.

Source

Code and credit

This code comes from walkccc LeetCode Solutions by P.-Y. Chen (walkccc) and is used under the MIT licence.

Open problem ↗Original source ↗
Full codeCount the Number of Square-Free Subsets · JavaJava
Use this to learn the idea, then write your own version.
class Solution {  public int squareFreeSubsets(int[] nums) {    Integer[][] mem = new Integer[nums.length][1 << (PRIMES_COUNT + 1)];    int[] masks = new int[nums.length];     for (int i = 0; i < nums.length; ++i)      masks[i] = getMask(nums[i]);     // -1 means that we take no number.    // `used` is initialized to 1 so that -1 & 1 = 1 instead of 0.    return (squareFreeSubsets(masks, 0, /*used=*/1, mem) - 1 + MOD) % MOD;  }   private static final int MOD = 1_000_000_007;  private static final int PRIMES_COUNT = 10;  private static final int[] primes = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29};   private int squareFreeSubsets(int[] masks, int i, int used, Integer[][] mem) {    if (i == masks.length)      return 1;    if (mem[i][used] != null)      return mem[i][used];    final int pick =        (masks[i] & used) == 0 ? squareFreeSubsets(masks, i + 1, used | masks[i], mem) : 0;    final int skip = squareFreeSubsets(masks, i + 1, used, mem);    return mem[i][used] = (pick + skip) % MOD;  }   // e.g. num = 10 = 2 * 5, so mask = 0b101 -> 0b1010 (append a 0)  //      num = 15 = 3 * 5, so mask = 0b110 -> 0b1100 (append a 0)  //      num = 25 = 5 * 5, so mask =  0b-1 -> 0b1..1 (invalid)  private int getMask(int num) {    int mask = 0;    for (int i = 0; i < primes.length; ++i) {      int rootCount = 0;      while (num % primes[i] == 0) {        num /= primes[i];        ++rootCount;      }      if (rootCount >= 2)        return -1;      if (rootCount == 1)        mask |= 1 << i;    }    return mask << 1;  }}

Keep practising

Did this explanation save you time? I'm a Grade 11 student building this free library to make difficult algorithms easier to understand.

Buy me a coffee ↗