zoukankan      html  css  js  c++  java
  • Orders

    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.
    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
    bbdj
    bbjd
    bdbj
    bdjb
    bjbd
    bjdb
    dbbj
    dbjb
    djbb
    jbbd
    jbdb
    jdbb
    

    输出有重复字符的全排列,dfs。

    代码:

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <cstdlib>
    #include <cmath>
    #include <algorithm>
    #include <stack>
    #include <map>
    
    using namespace std;
    int vis[26],n;
    char b[201];
    void dfs(int k)
    {
        if(k == n)
        {
            cout<<b<<endl;
            return;
        }
        for(int i = 0;i < 26;i ++)
        {
            if(!vis[i])continue;
            vis[i] --;
            b[k] = 'a' + i;
            dfs(k + 1);
            vis[i] ++;
        }
    }
    int main()
    {
        char ch;
        while((ch = cin.get())!='
    ')
        {
            n ++;//记录字符个数
            vis[ch - 'a']++;//记录每个字母的个数
        }
        b[n] = '';
        dfs(0);
    }
  • 相关阅读:
    jsonp 监控简陋代码
    Oracle多线程并行使用、关联与指定索引执行
    Oracle计算时间差表达式
    行查列显
    JS时间
    通过string型类名实例化一个类
    sotower1.5-LS_工作流容易出错的地方
    oracle11g ORA-12505
    华项笔记本显示颜色变黄,调整好了重启还是偏黄
    ORA-00031: session marked for kill 处理Oracle中杀不掉的锁
  • 原文地址:https://www.cnblogs.com/8023spz/p/7789052.html
Copyright © 2011-2022 走看看