POJ 1731:Orders next_permutation
来源:互联网 发布:淘宝类目007是什么牌子 编辑:程序博客网 时间:2024/05/01 14:38
Orders
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9940 Accepted: 6048
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
大水,直接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;}
0 0
- POJ 1731:Orders next_permutation
- POJ-1731 Orders(排序全排列库函数next_permutation())
- POJ 1731 Orders(next_permutation(a,a+n))
- POJ 1270 Following Orders(dfs/next_permutation())
- POJ 1731 Orders 按序输出一个字符串的全排列 next_permutation()
- 1731 Orders POJ
- poj 1731 Orders
- POJ 1731 Orders
- poj 1731 orders
- POJ 1731 Orders
- POJ-1731-Orders
- poj 1731 Orders
- POJ-1731-Orders
- poj 1731 Orders
- POJ - 1731 Orders
- POJ 1731 Orders 【STL】
- POJ 1731 Orders
- POJ 1731 Orders
- 排序算法
- JDK升级导致TLS证书认证失败
- 非阻塞的AlertDialog的代码实现
- Leet Code 6 ZigZag Conversion
- Redis--aof备份恢复
- POJ 1731:Orders next_permutation
- 从零开始编写图片加载库(五)之图片缓存DiskCache
- 图解测试之稳定性-如何开始稳定性测试
- C++枚举类型
- hdu 5122 简单题
- Html学习笔记5
- android笔记
- Oracle学习笔记20150908权限与角色的管理
- Android五大存储---(四大组件之一)ContentProvider(字段)