poj 1936 All in All
2014-06-13 17:12
726 查看
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.The length of s and t will no more than 100000.
Output
For each test case output "Yes", if s is a subsequence of t,otherwise output "No".
Sample Input
Sample Output
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 27353 | Accepted: 11188 |
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.The length of s and t will no more than 100000.
Output
For each test case output "Yes", if s is a subsequence of t,otherwise output "No".
Sample Input
sequence subsequence person compression VERDI vivaVittorioEmanueleReDiItalia caseDoesMatter CaseDoesMatter
Sample Output
Yes No Yes No
判断a串删除若干字符后是否与b串相同
#include <iostream> #include <stdio.h> #include <stdlib.h> #include <algorithm> #include <string.h> using namespace std; int main() { char a[100001],b[100001]; int i,k; while(~scanf("%s %s",a,b)) { int lena=strlen(a); int lenb=strlen(b); k=0; for(i=0;i<lenb;i++) if(a[k]==b[i]) k++; if(k==lena) printf("Yes\n"); else printf("No\n"); } return 0; }
相关文章推荐
- POJ 1936 All in All(water)
- poj 1936 All in All
- poj 1936 All in All
- poj 1936 All in All 【串】
- POJ 1936 All in All
- poj 1936 All in All (字符串处理)
- poj 1936 all in all
- POJ 1936 All in All
- poj 1936 All in All 水题
- POJ1936--All in All
- zoj 1970 || poj 1936 All in All(水题,想说爱你不容易 = =)
- [POJ1936 All in All]
- POJ1936-All in All
- POJ 1936 all in all
- POJ 1936 All in All(简单的字符串的字符列)
- All in All--POJ 1936
- POJ1936-All in All
- POJ 1936 All in All
- POJ1936:All in All
- POJ 1936 All in All