POJ 1731 Orders(全排列)
来源:互联网 发布:esp8266 51单片机例程 编辑:程序博客网 时间:2024/04/28 20:59
Orders
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9494 Accepted: 5796
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 <iostream>#include <string>#include <algorithm>using namespace std;int main(){string a;cin>>a;sort(a.begin(),a.end());cout<<a<<endl;while(next_permutation(a.begin(),a.end()))cout<<a<<endl;return 0;}
0 0
- POJ 1731 Orders(全排列)
- POJ 1731 Orders(全排列)
- POJ 1731 Orders(不重复全排列)
- poj 1731 Orders 字符串全排列及去重方法
- POJ 1731 Orders【生成有重集的全排列1.0】
- POJ-1731 Orders(排序全排列库函数next_permutation())
- POJ 1731 Orders(带重复字母的全排列 + 暴力)
- poj1731 Orders (全排列)
- Poj-1731 Orders(生成可重集的排列)
- POJ 1731 Orders 按序输出一个字符串的全排列 next_permutation()
- (POJ 1270)Following Orders 求序列在限制条件下的 [全排列]
- Orders c++生成全排列
- POJ1731 Orders 全排列(两种方法)
- 1731 Orders 排列
- poj 1731 Orders(STL)
- C - Orders 字典序全排列
- POJ1731 Orders【全排列+字符串排序】
- POJ:1270 Following Orders (全拓扑排序)
- Bootstrap 模态窗口实现居中
- OpenCV中IplImage图像格式与BYTE图像数据的转换
- 慕课网高仿微信学习笔记
- 二叉树一些基本算法
- 第八周项目6
- POJ 1731 Orders(全排列)
- 基于分析的amb求值器,及其分析
- java中的数组(六)
- 第3章栈和队列
- COGNOS10的Eclipse远程调试
- c time.h
- HDU ACM 1052
- UVA11419 我是SAM
- [LeetCode OJ]Climbing Stairs