UVA - 10340 All in All

  You have devised a new encryption technique which encodes a message by inserting between its charac-
ters 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

分析：标准的水题，给两个指针然后判断值是否相等，若等则同时加1，否则指向t的指针加1; 结束时只用判断指向s的指针即可。

#include <stdio.h>

const int maxn = 1000000;
char s[maxn];
char t[maxn];

int main()
{
	while(~scanf("%s%s",s,t))
	{
		char *p = s;
		char *q = t;

		while(*p && *q)
		{
			if(*p == *q){p++;q++;}
			else q++;
		}
		if(*p) printf("No\n");
		else printf("Yes\n");
	}
    return 0;
}