poj1936_All in All
2014-01-12 21:15
369 查看
时间复杂度O(n)
#include <stdio.h> #include <string.h> int main(){ int al,bl,i,j; char a[100000+100]; char b[100000+100]; while(~scanf("%s%s",a,b)){ al=strlen(a); bl=strlen(b); for(i=0,j=0;i<bl;++i){ if(a[j]==b[i]) j++; } if(j==al) printf("Yes\n"); else printf("No\n"); } return 0; }
相关文章推荐
- POJ 1936 All in All 题解
- POJ 1936 All in All 字符串 水题
- POJ 题目1936 All in All(水题,暴力)
- UVA10340 POJ1936 ZOJ1970 All in All
- POJ--1936 All in All(水题,暴力即可)
- POJ 1936 All in All (模拟)
- POJ1936——All in All
- poj 1936 All in All 水题
- [POJ](1936)All in All ---字符串匹配(串)
- poj 1936 All in All
- poj 1936 All in All
- poj 1936 All in All
- POJ--1936 All in All(水题,暴力即可)
- POJ 1936 All in All
- POJ 1936 All in All【暴搜】
- [ACM] POJ 1936 All in All (查找,一个串是否在另一个串中)
- poj 1936 all in all
- All in All(POJ--1936
- OpenJudge/Poj 1936 All in All
- POJ1936-All in All