Speed Reading | MatCom Online Grader

The 5th Cuban Programming League (Real Contest)

Ended

Overview
Problems
Standing
Submissions
Submit
Clarifications
Virtual participation

Register

Are you sure you want to participate in this contest ? If you select a team then virtual participation for other team members will be disabled. So, pick one if and only if your teammates are ready to compete with you.

C - Speed Reading

Languages: C++, Java, Python, Kotlin

Time & Memory limits: (details)

<p style='text-align: justify;'>
A very interesting study indicates that it does not matter the order in which the letters of a word are written as long as the first and last ones are well located.

The brain is capable of identifying them correctly according to the context in which they are used. Nevertheless, a well-written text will help the reader to read faster.

In the following problem, we want to detect, given a set of words whose letters are disordered except for the first and last letter, how many of them can be guaranteed to be written correctly after passing an spell checker. For this purpose, a dictionary with the set of known words and a set of disordered words as described above will be given.

Note that some words, despite not being in the dictionary, can be corrected. In the text "y ese gooooool" all the words can always be corrected even if they are not in the dictionary.

If there are words that can be written in multiple ways according to the dictionary, the spell checker will not be able to correctly identify which one corresponds, so it will not correct them.
</p>

Input