Your Task

Work on the corresponding lab first to get familiar with bit puzzles generally.
Go to the custom code environment and solve the homework problems.

Note that there is partial credit if you violate some of the restrictions of a puzzle (like the operator count limit) but otherwise solve it.

Hints

The puzzles are not arranged in order of difficulty. You should not feel obliged to do them in order.

You may assume that integer overflow for + acts as in two’s complement.
Arithmetic right shift is equivalent to dividing a signed integer by a power of two but always rounding down. Integer division in C always rounds towards zero.
Section 2.3.6 (“Multiplying by Constants”) and 2.3.7 (“Dividing by Powers of Two”) in the textbook describes the overall solution strategy, including how to compensate for arithmetic right shift rounding differently than normal integer division.
If your initial solution idea has problems with loosing information about the fractional part of something/8, think about what would happen to the bits “after the decimal” point if they were preserved by the division (like if the result did not have to be an integer) and still around for the later operations.
Similarly, if your initial solution idea has problems with loosing information due to overflow from something*5, think about what happen to the extra bits if they were preserved by the multiplication (like if the result was bigger than 32 bits) and around for later operations.
For both types of cases where there are extra bits you want to track, one idea is to divide the input number into two pieces, one of which will include those extra bits.

^ is almost all you need.
To reach the desired operation count, you will probably need to ensure that you were computing useful values for multiple bits at a time when you do most ^ operations. The strategy used for “is any bit set” discussed in lecture is helpful.