Help needed in Google APAC 2016 Round E problem C

Revision en3, by yashv, 2016-01-31 22:03:11

I can't understand the problem in my solution described below

We can create a tree and then find the pattern as follows:

As can be seen above, there are only 8 possible numbers (not necessarily distinct) shown below: {0, x, x&k, x|k, (∼x)&k, x&(∼k), x^k, k} (where ∼n represents bitwise negation of n; and all operators have their usual meanings)

So we can create a transition table for each of these numbers for each of the possiblities of AND, OR, XOR. Using this logic I arrived at this solution

But the program is giving incorrect answer. Can someone point out the flaw in logic and/or implementation, please.

Tags google apac 2016, round e, problem c

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English yashv 2016-01-31 22:06:32 0 (published)
en4 English yashv 2016-01-31 22:05:56 124 Tiny change: 'rd#s=p2)\nI can't ' -> 'rd#s=p2)\n\nI can't '
en3 English yashv 2016-01-31 22:03:11 134 Tiny change: '(where n' represent' -
en2 English yashv 2016-01-31 21:57:40 564
en1 English yashv 2016-01-31 16:34:00 167 Initial revision (saved to drafts)