poj 1396 All in All【字符串】
2012-08-02 02:10
393 查看
水题一道
View Code
View Code
#include<stdio.h> #include<string.h> char a[100001],b[100001]; int main() { while(scanf("%s %s", a, b) != EOF) { char *ta = a; char *tb = b; while(*tb) { if(*ta == *tb) { ta++, tb++; } else { tb++; } } if(ta-a == strlen(a)) printf("Yes\n"); else printf("No\n"); } return 0; }
相关文章推荐
- poj 1396 All in All 字符串处理,短小精悍的题目
- poj_1936 All in All(简单字符串)
- POJ 1936 All in All 字符串 水题
- poj 1936 All in All (字符串处理)
- (Relax ST1.9)POJ 1936 All in All(判断一个字符串去掉一部分以后是否等价于另一个字符串)
- POJ-1936 All in All(字符串另类解法)
- POJ 1936 All in All(简单的字符串的字符列)
- POJ 1396 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 G++
- poj1936——All in All
- LeetCode 438. Find All Anagrams in a String (在字符串中找到所有的变位词)
- poj1936 All in All
- POJ 题目1936 All in All(水题,暴力)
- POJ训练计划1936_All in All(串处理)
- poj 1936 All in All
- uva - 10340 All in All(字符串、贪心)