2016 Canadian Computing Competition
Problem S1: Ragaman
An anagram of a string is formed by rearranging the letters in the string. For example, the anagrams of aab are aab, aba, and baa.
A wildcard anagram of a string is an anagram of the string where some of the letters might have been replaced with an asterisk (*). For example, two possible wildcard anagrams of aab are *ab and *b*.
Given two strings, determine whether the second string is a wildcard anagram of the first string.
Input Format
The two lines of input will both consist of N (1 ≤ N ≤ 100) characters. Each character in the first line will be a lowercase letter. Each character in the second line will be either a lowercase letter or an asterisk.
For 8 of the 15 available marks, the second line will not contain any asterisk characters.
Output Format
Output the character A if the string on the second line is a wildcard anagram of the string on the first line. Otherwise, output the character N.
Sample Input 1
abba baaa
Sample Output 1
N
Sample Input 2
cccrocks socc*rk*
Sample Output 2
A
All Submissions
Best Solutions
Point Value: 5
Time Limit: 2.00s
Memory Limit: 16M
Added: Feb 22, 2016
Author: SourSpinach
Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3
Comments (Search)