A calligrapher checks how often a chosen mark appears in an inscription. Task: Count occurrences of character c in token string s. Input format: A token string s followed by one visible ASCII character c. Output format: Print exact, case-sensitive matches; s contains no whitespace. Constraints: 1 <= length(s) <= 1000
Example 1:
Example 2:
Example 3:
Constraints:
1 <= length(s) <= 1000
Tags:
