ZOJ 1970
来源:互联网 发布:mac os 10.9.5 编辑:程序博客网 时间:2024/05/16 06:17
All in All
Input: standard input
Output: standard output
Time Limit: 2 seconds
Memory Limit: 32 MB
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 Specification
The input contains several testcases. Each is specified by two strings s, t of alphanumeric ASCII characters separated by whitespace. Input is terminated by EOF.
Output Specification
For each test case output, if s is a subsequence of t.
Sample Input
sequence subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter
Sample Output
Yes
No
Yes
No
#include <iostream>#include<string>using namespace std;int main(){ string s,t; while(cin>>s>>t) { int len1=s.size(); int len2=t.size(); int i,j; for(i=0,j=0;i<len1,j<len2;j++) { if(s[i]==t[j]) i++; } if(i==len1) cout<<"Yes"<<endl; else cout<<"No"<<endl; } return 0;}
- zoj 1970
- zoj 1970
- ZOJ 1970
- ZOJ 1970
- ZOJ-1970
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- ZOJ
- Android长按事件实例
- 【有趣的面试算法题】 数组循环移动算法细究
- 一生有你
- crontab追加信息
- 利用Objective-C运行时hook函数的三种方法
- ZOJ 1970
- 337D Book of Evil
- iOS实现透视效果
- ns2 AODV sendhello() recvhello()不执行解决方案
- iOS的三维透视投影
- Android的Menu的横向纵向排列问题
- xcode反汇编调试iOS模拟器程序(一)查看反汇编
- Fragment讲解
- 自定义按页翻动的CCScrollView