JosephusChallenge

Question

This is one of my favourite programming problems: you have an n number of men in a circle every -th man will be executed until only one is alive find where(in which position ) you should stand in order to live.. you can do this in any language,if my description was not clear enough you can look it up yourself(Josephus problem)

Answer 1

*sigh*, binary is beautiful.