微软实习生线测试2014.doc

题目1 : String reorder 时间限制:10000ms 单点时限:1000ms 内存限制:256MB Description For this question, your program is required to process an input string containing only ASCII characters between ‘0’ and ‘9’, or between ‘a’ and ‘z’ (including ‘0’, ‘9’, ‘a’, ‘z’). Your program should reorder and split all input string characters into multiple segments, and output all segments as one concatenated string. The following requirements should also be met,1. Characters in each segment should be in strictly increasing order. For ordering, ‘9’ is larger than ‘0’, ‘a’ is larger than ‘9’, and ‘z’ is larger than ‘a’ (basically following ASCII character order).2. Characters in the second segment must be the same as or a subset of the first segment; and every following segment must be the same as or a subset of its previous segment. Your program should output string “invalid input string” when the input contains any invalid characters (i.e., outside the 0-9 and a-z range). Input Input consists of multiple cases, one case per line. Each case is one string consisting of ASCII characters. Output For each case, print exactly one line with the reordered string based on the criteria above. 样例输入 aabbccdd 007799aabbccddeeff113355zz 1234.89898 abcdefabcdefabcdefaaaaaaaaaaaaaabbbbbbbddddddee 样例输出 abcdabcd 013579abcdefz013579abcdefz invalid input string abcdefabcdefabcdefabdeabdeabdabdabdabdabaaaaaaa 题目2 : K-th string 时间限制:10000ms 单点时限:1000ms 内存限制:256MB Description Consider a string set that each of them consists of {0, 1} only. All strings in the set have the same number of 0s and 1s. Write a program to find and output the K-th string according to the dictionary order. If such a string doesn’t exist, or the input is not valid, please output “Impossible”. For example, if we have two ‘0’s and two ‘1’s, we will have a set with 6 different strings, {0011, 0101, 0110, 1001, 1010, 1100}, and the 4th string is 1001. Input The first line of the input file contains a single integer t (1 ≤ t ≤ 10000), th