poj1936 假期计划第一水
2015-08-03 10:04
288 查看
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: 29651 | Accepted: 12312 |
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
#include<string.h> #include<stdio.h> #include<iostream> #include<algorithm> using namespace std; char s[100005],t[100005]; int main(){ while(scanf("%s %s",s,t)!=EOF){ getchar(); int len1=strlen(s); int len2=strlen(t); int ans=0; for(int i=0;i<len2;i++){ if(s[ans]==t[i]){ ans++; } } if(ans==len1) printf("Yes\n"); else printf("No\n"); memset(s,0,sizeof(s)); memset(t,0,sizeof(t)); } return 0; }
相关文章推荐
- Winform界面异步初始化
- Linux 软件包管理
- 数据库连接错误---------
- 驱动编程学习笔记之IO处理
- poj 1655 Balancing Act 【树形DP 求树的重心】
- 关于github上一个可拓展和折叠的测试demo源码详解
- hdu 1452 happy 2004
- Angular Js ng-repeat指令
- H.264解码器原理
- HTML5与搜索引擎优化[转载]
- 从智能电视开始,PPTV与Letv全线开战?
- uva820 最大流模板题
- 南邮 OJ 1009 2的N次方
- hdoj-1864-最大报销额【动态规划】
- 机电行业如何进行信息化建设
- H.264编码器原理
- H.264量化参数QP和量化步长Qstep
- C#将字节数组加到List中
- xampp终端启动
- yum仅下载RPM包不安装