英语翻译DescriptionThe stores manager has sorted all kinds of goods in an alphabetical order of their labels.All the kinds having labels starting with the same letter are stored in the same warehouse (i.e.in the same building) labelled with this

英语翻译DescriptionThe stores manager has sorted all kinds of goods in an alphabetical order of their labels.All the kinds having labels starting with the same letter are stored in the same warehouse (i.e.in the same building) labelled with this
英语翻译
Description
The stores manager has sorted all kinds of goods in an alphabetical order of their labels.All the kinds having labels starting with the same letter are stored in the same warehouse (i.e.in the same building) labelled with this letter.During the day the stores manager receives and books the orders of goods which are to be delivered from the store.Each order requires only one kind of goods.The stores manager processes the requests in the order of their booking.
You know in advance all the orders which will have to be processed by the stores manager today,but you do not know their booking order.Compute all possible ways of the visits of warehouses for the stores manager to settle all the demands piece after piece during the day.
Input
Input contains a single line with all labels of the requested goods (in random order).Each kind of goods is represented by the starting letter of its label.Only small letters of the English alphabet are used.The number of orders doesn't exceed 200.
Output
Output will contain all possible orderings in which the stores manager may visit his warehouses.Every warehouse is represented by a single small letter of the English alphabet -- the starting letter of the label of the goods.Each ordering of warehouses is written in the output file only once on a separate line and all the lines containing orderings have to be sorted in an alphabetical order (see the example).No output will exceed 2 megabytes.
Sample Input
bbjd
Sample Output
bbdj
bbjd
bdbj
bdjb
bjbd
bjdb
dbbj
dbjb
djbb
jbbd
jbdb
jdbb

英语翻译DescriptionThe stores manager has sorted all kinds of goods in an alphabetical order of their labels.All the kinds having labels starting with the same letter are stored in the same warehouse (i.e.in the same building) labelled with this
描述
商店经理已分类的各种商品在一个字母顺序的标签.所有的种类有标签以相同字母都储存在同一仓库(即在同一栋大楼)上的这封信.白天,商店经理接收和书籍的订单的货物要脱离了商店.每次只需要一种商品.商店经理处理的要求,在他们的预订.
你事先知道所有的订单将不得不处理的商店经理今天,但是你不知道他们的预订.计算所有可能的方式进行访问的商店经理来解决所有的要求后,白天一块一块.
输入
输入包含一个符合所有标签所要求的货物(随机的顺序).各类产品均由起始字母的标签.只有字母.订单的数量不会超过200.
输出
输出将包含所有可能的商店经理赋值可以访问他的仓库.每个仓库是由一个小信的英文字母——开始的标签.每一个排序的仓库是写在输出文件只曾在一个单独的线条和所有的线条包含赋值必须是在一个字母顺序分类(见例).没有产量将超过2兆.
样品的输入
bbjd
样品输出
bbdj
bbjd
bdbj
bdjb
bjbd
bjdb
dbbj
dbjb
djbb
jbbd
jbdb
jdbb

这些商店经理排序在标签的字母顺序排列的各种商品。所有的种类有标签以同一个字母开头的存储在同一个仓库，此信标（即在同一建筑物）。白天收到的商店经理和书籍的货物将被从商店交付的订单。每个订单只需要一个商品的。商店经理进程在其预定的顺序要求。
你事先知道所有的订单，将要由今天的商店经理处理，但你不知道他们的预约订单。计算出的为商店经理处理后，白天一块一块的所有要求仓库的访问一切可能的方式。 <...

全部展开

这些商店经理排序在标签的字母顺序排列的各种商品。所有的种类有标签以同一个字母开头的存储在同一个仓库，此信标（即在同一建筑物）。白天收到的商店经理和书籍的货物将被从商店交付的订单。每个订单只需要一个商品的。商店经理进程在其预定的顺序要求。
你事先知道所有的订单，将要由今天的商店经理处理，但你不知道他们的预约订单。计算出的为商店经理处理后，白天一块一块的所有要求仓库的访问一切可能的方式。
输入
输入包含一个与所要求的所有货物标签（排名不分先后）一行。每一种商品所代表的信，其标签开始。英文字母只有小写字母被使用。订单的人数不超过200人。
输出
输出将包含所有可能的排序中，商店经理可以访问他的仓库。每个仓库是由一个单一小信的英文字母 - 该货物的标签开始的信。每个仓库顺序写在输出文件中只有一次在一个单独的行和所有的行序都必须包含在一个字母顺序排列（见示例）。无输出将超过2兆字节。
采样输入
bbjd
输出范例
bbdj
bbjd
bdbj
bdjb
bjbd
bjdb
dbbj
dbjb
djbb
jbbd
jbdb
jdbb

收起