CCC '16 S1 - Ragaman

View as PDF
Submit solution
Points: 3 (partial)
Time limit: 2.0s
Memory limit: 256M
Problem type
Canadian Computing Competition: 2016 Stage 1, Senior #1

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 Specification

The two lines of input will both consist of N (1 \le N \le 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 Specification

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

Output for Sample Input 1

N

Sample Input 2

cccrocks
socc*rk*

Output for Sample Input 2

A

Comments


  • 0
    superman409a3ba68db544f8  commented on March 3, 2025, 7:05 p.m. ← edited

    Can someone help me I have tried everything I can but unfortunatly some test cases don't work for me.

    Edit: Never mind I fixed it using the counter module :)


  • 1
    mucube0  commented on Jan. 31, 2024, 4:45 a.m.

    I hand-typed out a Python dictionary with every letter of the English alphabet set to zero for initialization. Not my best work....