Orders Poj
来源:互联网 发布:天下网商招聘php 编辑:程序博客网 时间:2024/06/06 01:37
Orders
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9911 Accepted: 6028
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#include<iostream>#include<algorithm>#include<cstring>using namespace std;int main(){ int l;char s[1000]; cin>>s; l=strlen(s); sort(s,s+l); cout<<s<<endl; while(next_permutation(s,s+l))//考察的STL中用next_permutation(s,s+l)对字符串排序的功能;注意不仅仅如此还有sort的使用 cout<<s<<endl; return 0;}
0 0
- Orders Poj
- Orders POJ
- POJ 1270 Following Orders
- 1731 Orders POJ
- poj 1270 Following 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
- POJ 1731 Orders 【STL】
- POJ 1731 Orders
- POJ 1270 Following Orders
- POJ 1731 Orders
- select、epoll简介
- Java finalize方法使用
- 企鹅通讯 1.0 官方版
- C# CSC 命令编译cs文件 .
- 杭电1287(接异或篇)
- Orders Poj
- 1019
- 让你的 EditText 全部清除
- JavaScript的类型转换(字符转数字,数字转字符)
- Java 8之Lambda
- 利用递归法和pygame实现迷宫寻路的动态展示_Prj002
- c++引入额外开销的情况
- 第九章:环境光照
- poj 3258 二分最小值最大