Lexicographic Permutations


The second problem I’ve suggested for Contest CodingLexicographic Permutations – has been posted!

Contest Coding

For the purposes of this problem the characters of the string “Contest Coding” are assigned values, the value assigned to a particular character determined by the position in the string of that character – viz:

‘C’ (1), ‘o’ (2), ‘n’ (3), …etc.…, ‘i’ (12), ‘n’ (13), ‘g’ (14)

That sequence of values is considered the 1st lexicographic permutation; given the characters to which those values are assigned, what nth lexicographic permutation will first contain the sequence of characters “tsetnoC”?

– This puzzle was suggested by Mark Bishop

Remember, to solve this puzzle and appear on the leaderboard, email both your solution and your source code (in any language) to lewiscornwall13@gmail.com. Good luck!!

View all puzzles »

View original post


No Responses Yet to “Lexicographic Permutations”

  1. Leave a Comment

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s

%d bloggers like this: