本篇文章主要介绍了"[模拟]All in All uva10340"，主要涉及到[模拟]All in All uva10340方面的内容，对于[模拟]All in All uva10340感兴趣的同学可以参考一下。
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.
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.
For each test case output, if s is a subsequence of t.
Source: ULM Local Contest
using namespace std;