POJ-1936-All in All
来源:互联网 发布:各种排序算法比较 编辑:程序博客网 时间:2024/06/05 06:44
All in All
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 31754 Accepted: 13179
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.
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 subsequenceperson compressionVERDI vivaVittorioEmanueleReDiItaliacaseDoesMatter CaseDoesMatter
Sample Output
YesNoYesNo
#include<stdio.h>#include<queue>#include<string.h>#include<math.h>#include<algorithm>#include<functional>using namespace std;const int N = 100010;int main(){ char s1[N], s2[N]; while(~scanf("%s%s",s1,s2)) { int l1 = strlen(s1), l2 = strlen(s2); int i = 0, j= 0; while(i<l1&&j<l2) { if(s1[i]==s2[j]) { ++i, ++j; } else { ++j; } } if(i==l1)printf("Yes\n"); else printf("No\n"); } return 0;}
0 0
- 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
- 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
- All in All(poj 1936)
- poj 1936 All in All
- poj 1936 All in All
- css优先级
- [leetcode] 38. Count and Say
- You must restart adb and Eclipse
- 用js去除重复元素的两种方法总结
- Codevs 4560 NOIP2015 D2T2 子串
- POJ-1936-All in All
- 内存映射
- poj1466
- 【u222】选课
- POJ-2533-Longest Ordered Subsequence
- 使用Thinkphp小结1,增删改查
- 125. Valid Palindrome
- 剑指offer面试题43:n个骰子的点数
- Wifi小车之 - 第一版小车问世