Grey Codes to Binary and reverse

Revision en2, by RNR, 2017-03-16 20:41:06

UVa 11173 — Grey Codes with a one-liner bit manipulation expression for each test case, i.e. find the k-th Gray code.

Solution is k^(k>>1)

Let’s reverse the UVa 11173 problem above. Given a gray code, find its position k using bit manipulation.

Solution: ????

Tags bitmasks, binary, grey codes, gray code

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English RNR 2017-03-16 20:41:06 1
en1 English RNR 2017-03-16 20:36:24 308 Initial revision (published)