uva 10340 - All in All
2012-08-23 17:13
302 查看
Problem E
All in All
Input:
standard input
Output:
standard output
Time Limit: 2 seconds
Memory Limit:
32 MB
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 Specification
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 Specification
For each test case output, if s is a subsequence of
t.
Sample Input
Sample Output
All in All
Input:
standard input
Output:
standard output
Time Limit: 2 seconds
Memory Limit:
32 MB
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 Specification
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 Specification
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
#include<stdio.h> #include<string.h> int main() { char s1[100010],s2[100010]; int i,j; while (scanf("%s%s",&s1,&s2)==2) { for (i=0,j=0;s1[i]!='\0'&&s2[j]!='\0';j++) if (s1[i]==s2[j]) ++i; if (s1[i]=='\0') printf("Yes\n"); else printf("No\n"); } return 0; }
相关文章推荐
- 小紫书 习题 3-9(UVA 10340)子序列(All in All)
- UVA All in All 10340
- 子序列(All in All, UVa 10340)
- UVa10340——All in all
- 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
- J - All in All UVA - 10340
- uva10340 - All in All
- UVA - 10340 All in All
- [UVA]10340 All in All
- UVa 10340 All in All
- UVa10340-All in All
- UVA - 10340 All in All
- Uva 10340 All in All
- UVa - 10340 - All in All(暴力遍历、子序列)
- UVa 10340 - All in All
- UVA10763:Foreign Exchange&&UVA10340: All in All(水题)