1239：Increasing Sequences

题目描述
Given a string of digits, insert commas to create a sequence of strictly increasing numbers so as to minimize the magnitude of the last number. For this problem, leading zeros are allowed in front of a number.
输入解释
Input will consist of multiple test cases. Each case will consist of one line, containing a string of digits of maximum length 80. A line consisting of a single 0 terminates input.
输出解释
For each instance, output the comma separated strictly increasing sequence, with no spaces between commas or numbers. If there are several such sequences, pick the one which has the largest first value;if there's a tie, the largest second number, etc.
输入样例 
3456
3546
3526
0001
100000101
0
输出样例 
3,4,5,6
35,46
3,5,26
0001
100,000101
该题目是Virtual Judge题目，来自 北京大学POJ
题目来源 East Central North America 2002
源链接： POJ-1239
最后修改于 2020-10-29 05:58:37 UTC 由爬虫自动更新
共提交 1 次
通过率 0.0%
时间上限 内存上限
1000 10000

·

·

·

·

登陆或注册以提交代码