Orders Poj
2015-07-30 19:35
267 查看
Orders
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
Sample Output
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 9911 | Accepted: 6028 |
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
bbjdbdbj
bdjb
bjbd
bjdb
dbbj
dbjb
djbb
jbbd
jbdb
jdbb#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int main()
{
int l;char s[1000];
cin>>s;
l=strlen(s);
sort(s,s+l);
cout<<s<<endl;
while(next_permutation(s,s+l))//考察的STL中用next_permutation(s,s+l)对字符串排序的功能;注意不仅仅如此还有sort的使用
cout<<s<<endl;
return 0;
}
相关文章推荐
- 斐波那契数列——矩阵的幂求解
- c++ 解决ifstream在断点debug下无法读取文件问题
- openERP server action,最强大的功能,没有之一
- 暴力求解——打表,暴力
- JavaScript的类型转换(字符转数字,数字转字符)
- 动态生成页面(二)
- Java 8之Lambda
- 数据归一化和两种常用的归一化方法
- 纹理分割(一)Gabor滤波器学习
- 关于博士论文的撰写
- 让你的 EditText 全部清除
- 线程池
- 【leetcode】Linked List Cycle
- 字符编码格式的显示与存储示例分析
- 使用Jsoup库解析HTML、XML或URL链接中的DOM节点
- Cross Validation done wrong
- 销售预收款处理
- 企鹅通讯 1.0 官方版
- Linux cpuidle framework(1)_概述和软件架构
- Java finalize方法使用