In order to reduce the amount of time required listening to goofy excuses USCIS give in why they haven’t approved cases, we could have Kashmir write a program that will search for a list of keywords in a list of excuses identifying lame excuses. Keywords can be matched in an excuse regardless of case.
Input
Input to your program will consist of multiple sets of data. Line 1 of
each set will contain exactly two integers. The first number (1 <= K <=
20) defines the number of keywords to be used in the search. The second
number (1 <= E <= 20) defines the number of excuses in the set to be
searched. Lines 2 through K+1 each contain exactly one keyword. Lines
K+2 through K+1+E each contain exactly one excuse. All keywords in the
keyword list will contain only contiguous lower case alphabetic
characters of length L (1 <= L <= 20) and will occupy columns 1 through
L in the input line. All excuses can contain any upper or lower case
alphanumeric character, a space, or any of the following punctuation
marks [".,!?] not including the square brackets and will not exceed 70
characters in length. Excuses will contain at least 1 non-space
character.
Output
For each input set, you are to print the worst excuse(s) from the list.
• The worst excuse(s) is/are defined as the excuse(s) which contains the largest number of incidences of keywords.
• If a keyword occurs more than once in an excuse, each occurrance is considered a separate incidence.
• A keyword ``occurs" in an excuse if and only if it exists in the string in contiguous form and is delimited by the beginning or end of the line or any non-alphabetic character or a space.
For each set of input, you are to print a single line with the number of the set immediately after the string ``Excuse Set #". (See the Sample Output). The following line(s) is/are to contain the worst excuse(s) one per line exactly as read in. If there is more than one worst excuse, you may print them in any order.
After each set of output, you should print a blank line.
Sample Input
5 3
dog
ate
AOS case file
canary
died
Results...
My dog ate the AOS case file.
Can you believe my dog died after eating my canary... AND THE AOS CASE FILE?
This excuse is so good that it contain 0 keywords.
6 5
superhighway
crazy
thermonuclear
office
war
building
Results...
I am having a superhighway built in my office.
I am actually crazy.
1234567890.....,,,,,0987654321?????!!!!!!
There was a thermonuclear war!
I ate my dog, my canary, and the AOS case file ... note outdated keywords?
Sample Output
Excuse Set #1
Can you believe my dog died after eating my canary... AND THE AOS CASE FILE?
Excuse Set #2
I am having a superhighway built in my office.
There was a thermonuclear war!
Input
Input to your program will consist of multiple sets of data. Line 1 of
each set will contain exactly two integers. The first number (1 <= K <=
20) defines the number of keywords to be used in the search. The second
number (1 <= E <= 20) defines the number of excuses in the set to be
searched. Lines 2 through K+1 each contain exactly one keyword. Lines
K+2 through K+1+E each contain exactly one excuse. All keywords in the
keyword list will contain only contiguous lower case alphabetic
characters of length L (1 <= L <= 20) and will occupy columns 1 through
L in the input line. All excuses can contain any upper or lower case
alphanumeric character, a space, or any of the following punctuation
marks [".,!?] not including the square brackets and will not exceed 70
characters in length. Excuses will contain at least 1 non-space
character.
Output
For each input set, you are to print the worst excuse(s) from the list.
• The worst excuse(s) is/are defined as the excuse(s) which contains the largest number of incidences of keywords.
• If a keyword occurs more than once in an excuse, each occurrance is considered a separate incidence.
• A keyword ``occurs" in an excuse if and only if it exists in the string in contiguous form and is delimited by the beginning or end of the line or any non-alphabetic character or a space.
For each set of input, you are to print a single line with the number of the set immediately after the string ``Excuse Set #". (See the Sample Output). The following line(s) is/are to contain the worst excuse(s) one per line exactly as read in. If there is more than one worst excuse, you may print them in any order.
After each set of output, you should print a blank line.
Sample Input
5 3
dog
ate
AOS case file
canary
died
Results...
My dog ate the AOS case file.
Can you believe my dog died after eating my canary... AND THE AOS CASE FILE?
This excuse is so good that it contain 0 keywords.
6 5
superhighway
crazy
thermonuclear
office
war
building
Results...
I am having a superhighway built in my office.
I am actually crazy.
1234567890.....,,,,,0987654321?????!!!!!!
There was a thermonuclear war!
I ate my dog, my canary, and the AOS case file ... note outdated keywords?
Sample Output
Excuse Set #1
Can you believe my dog died after eating my canary... AND THE AOS CASE FILE?
Excuse Set #2
I am having a superhighway built in my office.
There was a thermonuclear war!