标签：
Problem E
All in All
Input: standard input
Output: standard output
Time Limit: 2 seconds
Memory Limit: 32 MB
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 Specification
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 Specification
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
Source: ULM Local Contest
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <algorithm>
#include <set>
#include <queue>
#include <stack>
#include <map>
using namespace std;
const int inf=0x3f3f3f3f;
int main()
{
string str1,str2;
int i,j;
while(cin>>str1>>str2){
int len1=str1.length();
int len2=str2.length();
int cnt=0;
i=j=0;
while(i<len1&&j<len2){
if(str1[i]==str2[j]){
i++;
j++;
cnt++;
}
else
j++;
}
//printf("i==%d j==%d\n",i,j);
//printf("cnt==%d\n",cnt);
if(cnt==len1)
printf("Yes\n");
else
printf("No\n");
}
return 0;
}
标签：
原文地址：http://blog.csdn.net/u013486414/article/details/43523521
