zoukankan      html  css  js  c++  java
  • Anagram

    Description

    You are to write a program that has to generate all possible words from a given set of letters. Example: Given the word "abc", your program should - by exploring all different combination of the three letters - output the words "abc", "acb", "bac", "bca", "cab" and "cba". In the word taken from the input file, some letters may appear more than once. For a given word, your program should not produce the same word more than once, and the words should be output in alphabetically ascending order.

    Input

    The input consists of several words. The first line contains a number giving the number of words to follow. Each following line contains one word. A word consists of uppercase or lowercase letters from A to Z. Uppercase and lowercase letters are to be considered different. The length of each word is less than 13.

    Output

    For each word in the input, the output should contain all different words that can be generated with the letters of the given word. The words generated from the same input word should be output in alphabetically ascending order. An upper case letter goes before the corresponding lower case letter.

    Sample Input

    3
    aAb
    abc
    acba
    

    Sample Output

    Aab
    Aba
    aAb
    abA
    bAa
    baA
    abc
    acb
    bac
    bca
    cab
    cba
    aabc
    aacb
    abac
    abca
    acab
    acba
    baac
    baca
    bcaa
    caab
    caba
    cbaa
    
    **********************************************************************************************************
    STL中next_permutation()的函数的应用
    **********************************************************************************************************
     1 #include<iostream>
     2 #include<string>
     3 #include<cstring>
     4 #include<queue>
     5 #include<cstdio>
     6 #include<algorithm>
     7 #include<cctype>
     8 using namespace std;
     9 char str1[1001];
    10 int num;
    11 int val(char c)
    12  {
    13      if(isupper(c))
    14       return (c-'A')*2;
    15      if(islower(c))
    16       return  (c-'a')*2+1;
    17  }
    18  bool cmp(char a,char b)
    19   {
    20       return  val(a)<val(b);
    21   }
    22   int main()
    23   {
    24       cin>>num;
    25       while(num--)
    26       {
    27           scanf("%s",str1);
    28           int len=strlen(str1);
    29           sort(str1,str1+len,cmp);
    30           do
    31           {
    32            cout<<str1<<endl;
    33           }
    34           while(next_permutation(str1,str1+len, cmp));
    35       }
    36       return 0;
    37 
    38 
    39   }
    View Code

    坚持!!!!!!!!

  • 相关阅读:
    C#设计模式系列 2 ChainOfResponsibility 职责链模式之真假美猴王
    c#查询计算机WMI信息
    C#设计模式系列 6 State 状态模式 之电视36计,我要自己掌握遥控器
    ASP.NET 一般处理文件,复制以前文件,无法调试,无法访问的问题
    DAY 215 Flask中before_request与after_request使用
    DAY 216 python爬虫requests库
    202020212 网络对抗技术 20181321 Exp2 后门原理与实践
    需求分析弯弓与烈马
    缓冲区溢出实验 20181321
    基于gmssl的CA系统构建及应用课程设计报告
  • 原文地址:https://www.cnblogs.com/sdau--codeants/p/3297281.html
Copyright © 2011-2022 走看看