Facebook Hacker Cup Qualification Round Studious Student


You’ve been given a list of words to study and memorize. Being a diligent student of language and the arts, you’ve decided to not study them at all and instead make up pointless games based on them. One game you’ve come up with is to see how you can concatenate the words to generate the lexicographically lowest possible string.

Input

As input for playing this game you will receive a text file containing an integer N, the number of word sets you need to play your game against. This will be followed by N word sets, each starting with an integer M, the number of words in the set, followed by M words. All tokens in the input will be separated by some whitespace and, aside from N and M, will consist entirely of lowercase letters.

Output

Your submission should contain the lexicographically shortest strings for each corresponding word set, one per line and in order.

Constraints

1 <= N <= 100
1 <= M <= 9
1 <= all word lengths <= 10

Example input
5
6 facebook hacker cup for studious students
5 k duz q rc lvraw
5 mybea zdr yubx xe dyroiy
5 jibw ji jp bw jibw
5 uiuy hopji li j dcyi
Example output
cupfacebookforhackerstudentsstudious
duzklvrawqrc
dyroiymybeaxeyubxzdr
bwjibwjibwjijp
dcyihopjijliuiuy
That 2nd task have a lot of text and i don’t have any wish to read it whole.
Copy text from .txt file to .doc file or any other one and you will have proper lines
Also, that task with text – do not copy numbers inside (you will get wrong answer)
Goran
Share this, they like shareing
http://www.mediafire.com/?pbd91h49fg7lew6

1 thought on “Facebook Hacker Cup Qualification Round Studious Student”

  1. Okay, this sucks. I couldn’t solve this one on my own and tried to cheat using your software….and I failed miserably.
    The result in your program comes in a non-selectable text. How do you expect me to write down the solution for 20 huge strings in just 6 minutes?
    Aaargh! Lost.

    Anyways, thanks for writing the code 🙂

Leave a Reply

Your email address will not be published. Required fields are marked *