Orders——字符串
来源:互联网 发布:php 图片字节流 编辑:程序博客网 时间:2024/05/17 12:22
Orders
Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uDescription
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
这道题目的意思就是给出一个字符串,输出该字符串的所有组成方式,字符串长度最大为200
数据太大了,就用了函数调用,首先对字符串按字典数排序,排好之后调用函数,输出结果。
#include <stdio.h>#include <string.h>#include <stdlib.h>#include <algorithm>#include <iostream>using namespace std;int main(){ char a[202]; int l; while(gets(a)!=NULL) { l = strlen(a); sort(a,a+l); puts(a); while(next_permutation(a,a+l)) { puts(a); } } return 0;}
0 0
- Orders——字符串
- Orders
- Orders
- Orders
- Orders
- POJ1731 Orders【全排列+字符串排序】
- 复习--C - Orders(字符串全排序,stl函数)
- poj 1731 Orders 字符串全排列及去重方法
- poj1731 - Orders
- to_date orders
- POJ1731 Orders
- poj1270Following Orders
- Orders Poj
- Orders - 1731
- Storage orders
- poj1731 Orders
- Orders POJ
- POJ 1731 Orders 按序输出一个字符串的全排列 next_permutation()
- 社会心理学(一)
- 详细解析C语言中的sizeof
- HDU2159:FATE(二维完全背包)
- rild
- Eclipse搭建android环境
- Orders——字符串
- oracle11g导出空表
- Latex 模板
- php创建Cookie
- Ubuntu下默认使用dash而非bash
- CSDN Android客户端开发(二):详解如何基于Java用Jsoup爬虫HTML数据
- ext3.2.1使用入门: ext对象不存在问题
- SlidingPaneLayout的基本使用
- Java多线程系列03----synchronized