poj1936
来源:互联网 发布:北京久其软件 编辑:程序博客网 时间:2024/05/17 01:59
All in All
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 29905 Accepted: 12444
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
Source
Ulm Local 2002
#include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>using namespace std;int main(){ char s[100010],t[100010]; while(~scanf("%s%s",s,t)) { int num=0; int len1=strlen(s); int len2=strlen(t); if(len1>len2) printf("No\n"); else { int i=0,j=0; for(; i<len1&&j<len2;) //判断子川 { if(s[i]==t[j]) { i++; j++; num++; } else {<span id="transmark"></span>j++; } } if(num==len1)printf("Yes\n");elseprintf("No\n"); } }}
0 0
- poj1936
- poj1936
- poj1936
- poj1936
- poj1936
- poj1936
- poj1936
- poj1936
- poj1936
- POJ1936
- poj1936
- poj1936
- poj1936
- poj1936 水题
- poj1936找子串
- poj1936 All in All
- POJ1936--All in All
- POJ1936:All in All
- 黑马程序员——Java网络编程
- Search a 2D Matrix II
- HDU_1166 敌兵布阵(线段树)
- Java字符串操作、基本运算方法等优化策略
- linux终端和控制台
- poj1936
- Android-基本控件(五大布局 Layout)
- 数字8(eight )题解
- OpenStack点滴积累1--Url映射的实现
- [HTML] CSS + JS 多级下拉菜单
- 如何计算时间复杂度
- css兼容问题总结
- 华为OJ(四则运算)
- poj2388 排序