Uvs: 10340

Question: 10340-All in All

Returns the string s and t and asks if s is a substring of t. If the characters removed by s can be the same as t, t is a substring of s.

Solution: Match characters. Each character of t matches the character in s. Note that the size of the character array must be greater.

Code:

# Include <stdio. h> # include <string. h> const int N = 1000005; char s [N], t [N]; bool match () {int I = 0; int lens = strlen (s ); int lent = strlen (t); for (int j = 0; j <lent; j ++) {if (I = lens) return true; if (lens-I> lent-j) return false; if (s [I] = t [j]) I ++;} if (I = lens) return true; return false;} int main () {while (scanf ("% s", s )! = EOF) {scanf ("% s", t); printf ("% s \ n", match ()? "Yes": "No");} return 0 ;}