Embercode: AI-powered software engineer course

1. In the bitset version, what does reachable << x do to the set of reachable totals?

Moves each reachable total s to s - xSets only bit x to 1Moves each reachable total s to s + x, the sums you get by adding xCopies the row unchanged, so the OR does nothing

2. The numbers are 1, 1, 1, 1, 1 and the target is 3. Which value of P does the subset count use?

3584

3. True or false: the bitset version of canPartition needs its size to be a compile-time constant.

False, because the size of a std::bitset can be read from input at run timeTrue, because the size is a template argument, so a variable such as limit cannot set it

4. True or false: if T + target is odd, the answer is 0, because every sign pattern has the same parity as T.

True, because flipping one sign changes the total by 2x, so every pattern has the parity of T and an odd target is unreachableFalse, because an odd T + target means P is not a whole number, so the answer must be 1

5. What does this program print? ``

cpp
#include <bitset>
#include <iostream>

int main() {
    std::bitset<12> reachable;
    reachable[0] = true;
    for (int x : {3, 4}) {
        reachable |= reachable << x;
    }
    std::cout << reachable.count() << "\n";
}

``

2345

Subset sums