Orders(C++ stl next_permutation)
来源:互联网 发布:金钱永不眠 软件 编辑:程序博客网 时间:2024/05/17 01:33
Orders
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9928 Accepted: 6040
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<cstdio>#include<iostream>#include<cstring>#include<algorithm>using namespace std;int main(){ char s[205]; while(cin>>s) { sort(s,s+strlen(s)); cout<<s<<endl; while(next_permutation(s,s+strlen(s))) { cout<<s<<endl; } }}
0 0
- Orders(C++ stl next_permutation)
- Orders(STL)
- C++STL的next_permutation
- C++STL的next_permutation
- C++STL的next_permutation
- 复习--C - Orders(字符串全排序,stl函数)
- POJ 1731:Orders next_permutation
- poj 1731 Orders(STL)
- POJ1061(STL next_permutation)
- POJ 1731 Orders(next_permutation(a,a+n))
- HDOJ 1027 STL(next_permutation)
- POJ 1731 Orders(STL运用)
- C++STL的next_permutation 的用法
- STL next_permutation
- 【STL】next_permutation
- [STL]next_permutation
- POJ 1731 Orders 【STL】
- POJ 1270 Following Orders(dfs/next_permutation())
- poj 1698 Alice's Chance 【最大流 判断是否满流】
- Android DynamicLoadApk 开源插件开发项目代码剖析
- linux iostat命令详解
- 自己写了oracle导入txt和csv格式的工具
- pdf2htmlEX 安装以及简介(windows安装和linux安装)
- Orders(C++ stl next_permutation)
- memcached协议
- The function "state.highstate" is running as PID 4417的解决方法
- linux下pipe,poll函数的学习
- 一次Linux系统被攻击的分析过程
- One账户多设备同步的数据库设计
- www-authenticate与BASE-64认证技术
- iOS学习之CoreData的增删改查
- linux 同步IO: sync、fsync与fdatasync