CHALLENGE DESCRIPTION:
Your good friend Tom is admirer of tasting different types of fine wines. What he loves even more is to guess their names. One day, he was sipping very extraordinary wine. Tom was sure he had tasted it before, but what was its name? The taste of this wine was so familiar, so delicious, so pleasant… but what is it exactly? To find the answer, Tom decided to taste the wines we had. He opened wine bottles one by one, tasted different varieties of wines, but still could not find the right one. He was getting crazy, “No, it’s not that!” desperately breaking a bottle of wine and opening another one. Tom went off the deep end not knowing what this wine was. Everything he could say is just several letters of its name. You can no longer look at it and decided to help him.
Your task is to write a program that will find the wine name, containing all letters that Tom remembers.
INPUT SAMPLE:
The first argument is a path to a file. Each line includes a test case, which contains names of wines and letters that Tom remembers. Names and letters are separated by a vertical bar '|'.
For example:
Cabernet Merlot Noir | ot
Chardonnay Sauvignon | ann
Shiraz Grenache | o
OUTPUT SAMPLE:
You should print wine names, containing all letters that Tom remembered. Letters can be anywhere in wine names. If there is no name with all letters, print False.
For example:
Merlot
Chardonnay Sauvignon
False
CONSTRAINTS:
- Wine name length can be from 2 to 15 characters.
- Number of letters that Tom remembered does not exceed 5.
- Number of wine names in a test case can be from 2 to 10.
- If there is no wine name containing all letters, print False.
- The number of test cases is 40.