POJ1731Orders next_permutation全排列
来源:互联网 发布:漫威宇宙 知乎 编辑:程序博客网 时间:2024/05/17 03:01
Orders
Time Limit: 1000MS Memory Limit: 10000KB 64bit IO Format: %I64d & %I64u
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
Source
CEOI 1999
对一个字符串进行全排列
#include <stdio.h>#include <string.h>#include <algorithm>using namespace std;int main(){ char a[1010]; while(~scanf("%s",a)) { sort(a,a+strlen(a)); do { printf("%s\n",a); }while(next_permutation(a,a + strlen(a))); }}
0 0
- POJ1731Orders next_permutation全排列
- STL next_permutation 全排列
- next_permutation全排列算法
- next_permutation(自动全排列)
- [STL]next_permutation全排列
- (全排列) next_permutation
- next_permutation(,,) C++全排列
- 全排列(STL next_permutation)
- next_permutation(全排列算法)
- 全排列 next_permutation
- next_Permutation 全排列
- 全排列(next_permutation)
- 全排列与next_permutation
- 输出全排列 (next_permutation)
- 全排列 next_permutation
- 全排列 next_permutation()函数
- next_permutation进行全排列
- C++全排列 next_permutation
- how to answer Y in gdb script?
- Allocate exception for servlet jsp java.lang.ClassNotFoundException
- Javascript:谈谈JS的全局变量跟局部变量
- 【C语言】哥德巴赫猜想
- ios 拨打电话系统回调函数
- POJ1731Orders next_permutation全排列
- (4.1.23.11)自定义控件三部曲之动画篇(九)——联合动画的代码实现
- servlet3 upload上传文件实践
- Struts2以base64的方式上传图片
- 结构光测量——DLP LightCrafter 4500 EVM
- 利用HttpClient URLConnection两个类 访问服务器
- CRC校验详解及其在网络编程中的应用
- 新手学编程的常见困惑
- Linux 3.2中回写机制的变革