Orders
来源:互联网 发布:knock it off 编辑:程序博客网 时间:2024/06/05 17:43
Orders
Time Limit: 1000MS
Memory Limit: 10000KTotal Submissions: 9432
Accepted: 5756
Memory Limit: 10000KTotal Submissions: 9432
Accepted: 5756
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.
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
bbdjbbjdbdbjbdjbbjbdbjdbdbbjdbjbdjbbjbbdjbdbjdbb
<span style="font-size:18px;"></span>
<span style="font-size:18px;">#include <iostream>#include<stdio.h>#include<string.h>#include<math.h>#include<stdlib.h>#include<algorithm>using namespace std;int main(){ char str[201]; while(scanf("%s",str)!=EOF) { int len=strlen(str); sort(str,str+len); printf("%s\n",str); while(next_permutation(str,str+len)) printf("%s\n",str); }}</span>
0 0
- Orders
- Orders
- Orders
- Orders
- poj1731 - Orders
- to_date orders
- POJ1731 Orders
- poj1270Following Orders
- Orders Poj
- Orders - 1731
- Storage orders
- poj1731 Orders
- Orders POJ
- customer's orders list
- 1731 Orders 排列
- POJ 1270 Following Orders
- introduction of VIM orders
- 1731 Orders POJ
- PAT 1001. A+B Format (20)
- stm32IO口方向设置
- 线段树+树状数组+二分+划分树+主席树+hdu4417
- 高性能网络编程(一)----accept建立连接
- ios--XML解析类型介绍
- Orders
- printf的一个常用技巧
- 高富帅seajs使用示例及spm合并压缩工具露脸
- 统计一个字符串在另一个字符串中出现的次数(Java mysql)
- Learning OpenCV Chapter3 初探OpenCV上
- 简学lingo(一)——基础篇
- Vedio.js视频播放
- ElasticSearch插件
- 中国剩余定理