Hi, I am trying to understand the analysis section for this problem: https://codingcompetitions.withgoogle.com/codejam/round/00000000004362d7/00000000007c1139#analysis
The analysis makes the claim: "Let's say there are M bit groups in the suffix we need to create, then we will also need to apply M or M+1 NOT operations, depending on the parity of M and the first bit of the prefix." I am having trouble understanding why this would depend on the "parity of M" and the first bit of the prefix! (I am also confused about which bit is considered "first" - is it the left-most or right-most one?) I've tried working out some toy examples and in none of them does the number of NOT operation seem to depend on these particular factors. What am I missing? Thanks! XYZT -- -- You received this message because you are subscribed to the Google Groups Code Jam group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at https://groups.google.com/d/forum/google-code?hl=en --- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/137c3e3e-894a-4058-abac-b0edf5dc2695n%40googlegroups.com.
