Two strings are considered anagrams if we can rearrange the letters of one to obtain the other. So, for instance, the words
silentare anagrams, as it’s possible to rearrange the letters of
William Shakespeareis an anagram of
I am a weakish speller. So, when determining if two strings are anagrams, the comparison should be case insensitive, and the two strings can have a different number of spaces.
Given a string
nother strings, you are asked to calculate how many of those are anagrams of the string
The first line of the input contains the string
s(1 ≤ |s| ≤ ). The second line contains the number
n(0 ≤ n ≤ ). The next
nlines contain strings of lengths not exceeding 100.
The program should print the number of anagrams of the string
Tom Marvolo Riddle 2 Some random string I am Lord Voldemort
Time limit: 1 seconds
Memory limit: 512 MB
Output limit: 1 MB