uva 10340 All in All
2013-08-28 08:37
295 查看
题意:蛮水的一道题,只要看串a的字符是否依次出现过串b就行了
#include <iostream> #include <cstdio> #include <cstring> using namespace std; const int MAXN = 100005; char a[MAXN],b[MAXN]; int main() { while (cin>>a>>b) { int cur = 0; int len_a = strlen(a),len_b = strlen(b); for (int i = 0; i < len_b; i++) { if (cur == len_a) break; else if (a[cur] == b[i]) cur++; } if (cur == len_a) cout << "Yes" << endl; else cout << "No" << endl; } return 0; }
相关文章推荐
- 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 in All
- UVA 10340 All in All
- 【习题3-9】UVA - 10340 All in All
- uva 10340 All in All(子串)
- UVA 10340 - All in All
- 算法竞赛入门经典(紫书)第三章——All in All UVA-10340
- UVA - 10340 All in All
- Uva 10340 - All in All
- UVA-10340 All in All
- 小紫书 习题 3-9(UVA 10340)子序列(All in All)
- UVA All in All 10340
- 子序列(All in All, UVa 10340)