acm.jlu.edu.cn-2098-All in All

王朝other·作者佚名  2006-01-09
窄屏简体版  字體: |||超大  

All in All

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 SpecificationThe 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 SpecificationFor each test case output, if s is a subsequence of t. Sample Inputsequence subsequence

person compression

VERDI vivaVittorioEmanueleReDiItalia

caseDoesMatter CaseDoesMatter

Sample OutputYes

No

Yes

No

此代码速度一般但较易理解

#include<iostream>

#include<cstring>

using namespace std;

void main()

{

char s[100];

while(cin>>s)

{

int len=strlen(s);

char ch;

cin>>ch;

int idx=0;

while(ch!='\n')

{

if(ch==s[idx])

idx++;

cin.get(ch);

}

if(idx==len)

cout<<"Yes"<<endl;

else

cout<<"No"<<endl;

}

}

 
 
 
免责声明:本文为网络用户发布,其观点仅代表作者个人观点,与本站无关,本站仅提供信息存储服务。文中陈述内容未经本站证实,其真实性、完整性、及时性本站不作任何保证或承诺,请读者仅作参考,并请自行核实相关内容。
 
 
© 2005- 王朝網路 版權所有 導航