poj1936
来源:互联网 发布:健康系统破解软件 编辑:程序博客网 时间:2024/06/05 21:49
All in All
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 31712 Accepted: 13155
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<string.h>#include<stdlib.h>#include<malloc.h>#include<math.h>int main(){ char a[100005],b[100005]; while(~scanf("%s",a)){ scanf("%s",b); int lena=strlen(a); int lenb=strlen(b); int i,j; i=0;j=0; while(1){ if(i==lena){ printf("Yes\n"); break; } else if(i<lena&&j==lenb){ printf("No\n"); break; } if(a[i]==b[j]){ i++; j++; } else{ j++; } } } return 0;}
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异常与IO流(基础知识)
- android面试专题(1)
- JavaScript 表单脚本
- default tablespace spacename
- POJ 2376 Cleaning Shifts (贪心)
- poj1936
- HDU1251统计难题【map法】
- notifyDataSetChanged() 动态更新ListView android线程延迟
- Android 混淆配置文件(项目中的)
- 【HDU】-5363-Key Set(快速幂)
- JSP学路漫漫 之 1.1 指令标签 (1) page指令
- svn
- 欢迎使用CSDN-markdown编辑器
- HDU5735 Born Slippy