Poj 1936 all in all

Find whether a string is a substring of another string.

As you can imagine, the main string is a burst of bullets, and the substring to be searched for is an enemy. Then, the character of the Main string is the target, and all the bullets in the main string are completed, whether the sub-string can be wiped out by all enemies.

Simple question.

# Include <stdio. h> const int max_n = 100001; char seq [max_n], subseq [max_n]; int main () {While (~ Scanf ("% S % s", subseq, SEQ) {char * s = seq, * t = subseq; while (* S & * t) {If (* s = * t) T ++; s ++;} If (! * T) puts ("yes"); else puts ("no") ;}return 0 ;}