#278. CS240 project Problem 2
CS240 project Problem 2
Problem Statement
You are presented with two primary strings: S
and T
, and a target string X
of the same length as S
, initially filled entirely with the character #
. Your task is to determine if it's possible to transform X
into S
by repeatedly overlaying the string T
onto X
.
Constraints
- The string
S
is composed of letters and has a lengthN
. - The string
T
also consists of letters and has a lengthM
, whereM
is less than or equal toN
. X
is a string of lengthN
filled entirely with the character#
.- You can overlay
T
on any part ofX
, replacingM
consecutive characters, as many times as you want. - Given lengths: and .
Input
The input is given from Standard Input in the following format:
N M
S
T
Output
Print Yes
if it is possible to make X match S; print No
otherwise.
Sample Input 1
5 3
ABCBC
ABC
Sample Output 1
Yes
Below, let denote the part from the -th through the -th character of .
You can make match by operating as follows.
- Replace with . becomes
##ABC
. - Replace with . becomes
ABCBC
.
Sample Input 2
7 3
ABBCABC
ABC
Sample Output 2
No
it's impossible to make match .
Sample Input 3
12 2
XYXXYXXYYYXY
XY
Sample Output 3
Yes
Related
In following contests: