| # | Problem | Pass Rate (passed user / total user) |
|---|---|---|
| 13290 | Matching Strings |
|
| 13573 | String Operations 2 |
|
Description
Given a set of strings S1 and some query strings S2. For each strings in S2, you need to determine whether it exists in set S1 or not.
Input
First line contains 2 integers n and m, which is the size of S1 and S2. (0 < n,m <= 100)
Next, there're n lines, each representing a string in S1.
Last, m lines are provided, each representing a string in S2.
The length of strings is not greater than 10^3.
Output
Print m lines. Each line contains "Yes" or "No", which means whether the i-th string in S2 exists in S1 or not.
Print '\n' in the last line.
Sample Input Download
Sample Output Download
Tags
Discuss
Description
Input
The first line contains a string s, which consists of only lowercase Latin characters.
The second line contains a integer Q.
The next Q lines, each contains a operation.
Constraints
- 1≤|s|≤106
- 1≤Q≤105
- 0≤id≤|s|-1
- A,B,C ∈[a−z]
for testcases 1~3, 1≤|s|≤1000
for testcases 4~6, there’s no additional constraints.
Output
Print the resulting string in one line after applying the Q operations.
(remember to print a new line character)
Aftermath, a student in NTHU, is very good at programming. Today, as usual, she comes up with a programming problem but felt bored to solve it by herself(it’s too easy for her!). Thus, she left the problem to you, that is:
Given a string that consists of only lowercase Latin characters, there are Q operations to apply on this string.
There are two types of operations, with the following two forms:
For operation of type 1, you have to turn every A in the given string to B.
For operation of type 2, you have to set the idth character to C.
After the Q operations, you should print the resulting string in one line(remember to print a new line character).