UVA 10340 All in All

Description

You have devised a new encryption technique which encodes a message by inserting between its characters randomly generated strings in a clever way. Because of pending patent issues we will not discuss in detail how the strings are generated and inserted into the original message. To validate your method, however, it is necessary to write a program that checks if the message is really encoded in the final string. Given two strings s and t, you have to decide whether s is a subsequence of t, i.e. if you can remove characters from t such that the concatenation of the remaining characters is s.

Input

The input contains several testcases. Each is specified by two strings s, t of alphanumeric ASCII characters separated by whitespace. Input is terminated by EOF.

Output

For each test case output, if s is a subsequence of t.

Sample Input

sequence subsequence 

person compression 

VERDI vivaVittorioEmanueleReDiItalia 

caseDoesMatter CaseDoesMatter

Sample Output

Yes 

No 

Yes 

No

题意：输入两个字符串，问第一个串是否出现在第二个串中，可以不连续；

思路：for循环跑一遍即可，代码不出错就没问题，代码如下：

#include <stdio.h>
#include <string.h>
char c1[1000005];
char c2[1000005];
int main() {

	int m1 , m2 , t;
	while(~scanf("%s",c1)) {
		scanf("%s",c2);
		m1 = strlen(c1);
		m2 = strlen(c2);
		if(m1 > m2) {
			printf("No\n");
			continue;
		}
		t = 0;
		for(int i = 0; i < m2; i++) {
			if(c2[i] == c1[t]) {
				t++;
			}
		}
		if(t == m1)
		printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}