POJ 1731:Orders next_permutation
2015-09-08 20:51
232 查看
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
大水,直接next_permutation。
代码:
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 9940 | Accepted: 6048 |
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
大水,直接next_permutation。
代码:
#include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <string> #include <cstring> #pragma warning(disable:4996) using namespace std; char test[250]; int main() { while (cin >> test) { sort(test, test + strlen(test)); do { cout << test << endl; } while (next_permutation(test, test + strlen(test))); } return 0; }
相关文章推荐
- 【Java EE 学习 35 上】【strus2】【类型转换器】【struts2和Servlet API解耦】【国际化问题】【资源文件乱码问题已经解决】
- POJ 1731:Orders
- Html学习笔记3
- 监听EditText的变化
- 什么是高可用HA(High Availability)“脑裂"
- C++之容器---vector
- 兔子藏洞问题
- hdu 4288 Coder(线段树+离散化,lower_bound&&upper_bound的运用)
- 非阻塞的AlertDialog的代码实现
- 【我们都爱Paul Hegarty】斯坦福大学IOS8公开组个人笔记28 ScrollView 幻灯片视图
- 大龄屌丝自学笔记--Java零基础到菜鸟--015
- SPOJ 7001 VLATTICE - Visible Lattice Points(莫比乌斯反演)
- 《Ant权威指南》笔记(一)
- dom4j创建xml
- 使用udp协议给飞Q发送消息
- 打印N个数的全排列
- Html学习笔记2
- ubuntu git push 重复输入用户名和密码
- eclipse 安装SVN插件 subversive
- Linux远程管理工具