UVA10340-All in all
来源:互联网 发布:6级野猪骑士升级数据 编辑:程序博客网 时间:2024/05/12 23:41
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.
Input
The input contains several testcases. Each is specified by two strings s, t of alphanumeric ASCII characters separated by whitespace. Input is terminated by EOF.Output
For each test case output, if s is a subsequence of t.Sample Input
sequence subsequence
person compression
VERDI vivaVittorioEmanueleReDiItalia
caseDoesMatter CaseDoesMatter
Sample Output
Yes
No
Yes
No
注意遍历过程中t与s的顺序,并不是在t中找到s的字符即可,还要有s的顺序。
代码如下:
#include <stdio.h>#include <stdlib.h>#include <string.h>#define Maxn 100010char s[Maxn],t[Maxn];int main(){ int i,j,m,c; while(scanf("%s%s",s,t)!=-1) { m=0;c=0;j=0; for(i=0;i<strlen(s);i++) {j=m; for(;j<strlen(t);) { j=m; if(s[i]==t[j]) { m++;c++;break; } m++; } } if(c==strlen(s)) printf("Yes\n"); else printf("No\n"); } return 0;}
- Uva10340 All in All
- uva10340 - All in All
- UVA10340-All in all
- UVA10340-All in all
- uva10340 - All in All
- uva10340 -All in All
- Uva10340 All in All
- UVa10340 All in All
- UVa10340 - All in All
- UVa10340-All in All
- UVA10340 All in All
- [模拟]All in All uva10340
- uva10340 all in all 字符串
- UVa10340 ALL IN ALL AC
- uva10340 - All in All(子序列判定)
- UVa10340——All in all
- 习题3-9 UVa10340 All in All
- UVA10340 POJ1936 ZOJ1970 All in All
- rTorrent + ruTorrent 安装和配置
- 手机卸载应用的一个改进想法
- 在后台运行rtorrent
- Scala入门到精通——第十二节 I/O与正则表达式
- rtorrent - 强大的命令行BT客户端
- UVA10340-All in all
- android openFileOutput
- CART 剪枝算法
- Android工程测试
- [LeetCode][Java] Best Time to Buy and Sell Stock IV
- Dynamic Programming(DP) (Optimal substructure + overlapping subproblems(memorization))DEMO
- Android基础入门教程——3.8 Gestures(手势)
- 1014. Waiting in Line (30)
- NSThread