All in All ( UVA – 10340 )

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 ?nal string. Given two strings s and t, you have to decide whether s is a subsequence of t, ie 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 speci? ed by two strings s, t of alphanumeric ASCII characters separated by whitespace. Input is terminated by EOF.
Output< /strong>
For each test case output, if s is a subsequence of t.
Sample Input
sequence subsequence person compression VERDI vivaVittorioEmanueleReDiItalia caseDoesMatter CaseDoesMatter< /strong>
Sample Output
Yes No Yes No

Select Code #include   using namespace std; int main() {string st r,sub; int sum=0,ans=0; while(cin >>sub>>str) {int j=0,ans=0,k=0 ; for(int span> i=0;i) {< span style="color: #0000ff;">for(;j) {if(sub[i]==str[j]) {j++;ans++;break;}} if(ans==sub.size()) {cout<<"Yes"<1;}} if span>(!k) cout<<"No"<<endl;} return 0; }

Select Code #include  using namespace std; int main() {string str,sub; int sum=0,ans=0; while(cin>>sub>>str) {int j=0,ans=0,k=0; for(int i= 0;i) {for (;j) {if(sub[i ]==str[j]) {j++;ans++;break;}} < span style="color: #0000ff;">if(ans==sub.size()) {cout<<"Yes"<1< span style="color: #000000;">;}} if(!k) cout<<"No"<<endl;} return 0; }