UVA - 10340 All in All
2014-10-30 22:41
429 查看
题目大意:判断一个字符串的所有字符是否都在另一个字符串里面
解题思路:水题
解题思路:水题
#include<cstdio> #include<cstring> char s[100000],t[100000]; int main() { while(scanf("%s %s",s,t) != EOF) { int len1 = strlen(s); int len2 = strlen(t); int count = 0; for(int i = 0; i < len2; i++) { if(t[i] == s[count]) count++; if(len1 - count > len2 -i) break; } if(count == len1) printf("Yes\n"); else printf("No\n"); } return 0; }
相关文章推荐
- 【习题3-9】UVA - 10340 All in All
- uva 10340 All in All(子串)
- UVa 10340 - All in All
- UVa 10340 All in All
- UVa 10340 - All in All
- UVA - 10340 All in All
- 习题3-9 子序列(All in All, UVa 10340)
- UVA - 10340 All in All
- UVA 10340 All in All
- UVA 10340 All in All
- UVA - 10340 All in All :简单字符串处理
- uva - 10340 All in All(字符串、贪心)
- uva 10340 - All in All
- UVA 10340 - All in All 水~
- UVa 10340:All in All(字符串)
- UVa 10340 All inAll
- UVA 10340-ALL in ALL
- UVA 10340 - All in All 水~
- UVa10340--All in All 子序列 紫书习题3-9
- UVA10763:Foreign Exchange&&UVA10340: All in All(水题)