zoukankan      html  css  js  c++  java
  • UVA10098 Generating Fast【全排列】

    Generating permutation has always been an important problem in computer science. In this problemyou will have to generate the permutation of a given string in ascending order. Remember that youralgorithm must be efficient.

    Input

    The first line of the input contains an integer n, which indicates how many strings to follow. The nextn lines contain n strings. Strings will only contain alpha numerals and never contain any space. Themaximum length of the string is 10.

    Output

    For each input string print all the permutations possible in ascending order. Not that the strings shouldbe treated, as case sensitive strings and no permutation should be repeated. A blank line should followeach output set.

    Sample Input

    3

    ab

    abc

    bca

    Sample Output

    ab

    ba


    abc

    acb

    bac

    bca

    cab

    cba


    abc

    acb

    bac

    bca

    cab

    cba


    问题链接UVA10098 Generating Fast

    题意简述:参见上文。

    问题分析这个问题是按字典序从小到大输出字符串的全排列。

    程序说明:(略)

    题记(略)


    AC的C++语言程序如下:

    /* UVA10098 Generating Fast */
    
    #include <iostream>
    #include <algorithm>
    #include <stdio.h>
    #include <string.h>
    
    using namespace std;
    
    const int N = 10;
    char s[N+1];
    
    int main()
    {
        int t, len;
    
        scanf("%d", &t);
        while(t--) {
            scanf("%s", s);
    
            len = strlen(s);
            sort(s, s + len);
    
            do {
                printf( "%s
    ", s);
            } while(next_permutation(s, s + len));
            printf( "
    ");
        }
    
        return 0;
    }



  • 相关阅读:
    mobx的一个记录
    前端模块规范AMD/UMD/CommonJs
    CSS3字体大小单位的认识px/em/rem
    各浏览器之间的字号检测
    react整理一二(初入React世界)
    Node.js中实现套接字服务
    闲来无事,把node又拾起来看看
    判断类型
    html5 搜索框
    CSS 设置placeholder属性
  • 原文地址:https://www.cnblogs.com/tigerisland/p/7563624.html
Copyright © 2011-2022 走看看