Pro.ID21768 TitleThe k-th String sequence Title链接http://10.20.2.8/oj/exercise/problem?problem_id=21768 AC0 Submit0 Ratio- 时间&空间限制描述Given a String s, we will first collect all distinct positive length subsequences of s, and place them in a list L. A subsequence of s is obtained by deleting 0 or more characters. Next, sort L into ascending order by length. Where ties occur, break them lexicographically. Here uppercase letters occur before lowercase letters. Finally, return the String in position k % TOTAL (0-based), where TOTAL is the number of elements in L. 输入Line 1: The input contains a single integer T , the number of test cases. Line 2...T+1: s k (The input string s and the position of the output string). (The length of s is between 2 and 50. Each character in s will be a letter ('A'-'Z','a'-'z'). k will be an integral value between 0 and 263 - 1 inclusive. ). 输出Description Given a String s, we will first collect all distinct positive length subsequences of s, and place them in a list L. A subsequence of s is obtained by deleting 0 or more characters. Next, sort L into ascending order by length. Where ties occur, break them lexicographically. Here uppercase letters occur before lowercase letters. Finally, return the String in position k % TOTAL (0-based), where TOTAL is the number of elements in L. Input Line 1: The input contains a single integer T , the number of test cases. Line 2...T+1: s k (The input string s and the position of the output string). (The length of s is between 2 and 50. Each character in s will be a letter ('A'-'Z','a'-'z'). k will be an integral value between 0 and 263 - 1 inclusive. ). Output Line 1...T: Output the string for each test case. Sample Input 3 Sample Output A Source 样例输入3 样例输出A 作者 |
|Archiver|手机版|小黑屋|同和创作矩阵
( 粤ICP备20019636号-1 )
GMT+8, 2025-2-3 20:52 , Processed in 0.036914 second(s), 14 queries .
Powered by Discuz! X3.4 Licensed
© 2001-2017 Comsenz Inc.
