Orders
来源:互联网 发布:windows账户登录 编辑:程序博客网 时间:2024/05/16 10:30
Orders
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 7063 Accepted: 4458
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
STL中的全排列
Source
CEOI 1999
#include <iostream>
#include <string.h>
#include <algorithm>
using namespace std;
int main()
{
char str[201];
cin>>str;
int len;
len=strlen(str);
sort(str,str+len);
do
{
cout<<str<<endl;
}while(next_permutation(str,str+len));
return 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
- 服务器控件开发 绑定事件
- Android发送彩信(带图片附件)
- 强耦合与松耦合的不同,认真查了有什么不同之处,与大家分享!
- helloPe的android项目实战之连连看—设计篇
- WCF托管服务和客户端代理
- Orders
- 添加Silverlight单元测试项目模板
- Windows Phone 7 自定义按钮的实现
- Telecomm Standards
- KeyValuePair结构
- 好的网站
- linux查看系统信息命令大全
- ubuntu中的ntsysv工具: sysv-rc-conf
- IE和Firefox(火狐)在JavaScript方面的不兼容及统一方法