All in All
来源:互联网 发布:c语言的书 编辑:程序博客网 时间:2024/06/06 00:14
All in All
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 32401 Accepted: 13472
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<stdio.h>#include<string.h>#define N 100005int main(){ char str[N],s[N]; while(~scanf("%s %s",str,s)) { int n = strlen(str); int m = strlen(s); int i = 0,j = 0; while( i < n && j < m) { if(str[i] == s[j]) { i++;j++; } else { j++; } if( i == n) break; } if(i == n) { printf("Yes\n"); } else { printf("No\n"); } } return 0;}
0 0
- pku_1936 All in All
- 2098: All in All
- JOJ2098:All in All
- poj1936 All in All
- 10340 - All in All
- POJ1936--All in All
- POJ1936:All in All
- 10340 - All in All
- POJ1936《All in All》
- UVaOJ10340 - All in All
- 10340 - All in All
- All in All
- poj1936 All in All
- poj1936 All in All
- Uva10340 All in All
- uva10340 - All in All
- All in All
- poj1936--All in All
- LeetCode 438: Find All Anagrams in a String
- 类与对象
- 天赋 VS 勤奋,“一万小时定律” 没你想得那么简单
- Python正则表达式
- CSDN-markdown编辑器
- All in All
- oracle 锁机制
- Android Universal Image Loader 源码分析
- Memory Networks原理及其代码解析
- Linux上配置FastCGI的详细过程
- 牛客网-java一般版专项练习
- jquery选择器选择select
- POJ 1061青蛙的约会(扩展欧几里得)
- Java中的高级I/O流-缓冲流、数据流以及对象流