POJ 1256 DFS

1530人阅读 评论(6)

这道题的排序需要好好想一下，之后的由于序列是无重复的，所以在dfs的时候需要特殊处理一下即可。题目：

Anagram
 Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 14869 Accepted: 6085

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


Hint

An upper case letter goes before the corresponding lower case letter.
So the right order of letters is 'A'<'a'<'B'<'b'<...<'Z'<'z'.
ac代码：

#include <iostream>
#include <cstdio>
#include <string.h>
#include <algorithm>
using namespace std;
int len;
char ch[15],ss[15];
int visted[15];
bool cmp(char a,char b){
double t1=a,t2=b;
if(a>='A'&&a<='Z') t1+=31.5;
if(t2>='A'&&t2<='Z') t2+=31.5;
return t1<t2;
}
void dfs(int x){
if(x==len){
char str[15];
for(int i=0;i<len;++i)
//str[i]=ch[i];
//str[len]='\0';
printf("%c",ch[i]);
printf("\n");
}
else{
for(int i=0;i<len;++i){
if(!visted[i]){
ch[x]=ss[i];
visted[i]=1;
dfs(x+1);
visted[i]=0;
while(i+1<len&&ss[i+1]==ss[i])i++;
}
}
}
}
int main(){
int numcase;
scanf("%d",&numcase);
while(numcase--){
memset(visted,0,sizeof(visted));
ss[15];
scanf("%s",ss);
len=strlen(ss);
sort(ss,ss+len,cmp);
dfs(0);
}
return 0;
}

1
2

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：611656次
• 积分：10786
• 等级：
• 排名：第1488名
• 原创：414篇
• 转载：2篇
• 译文：0篇
• 评论：119条
评论排行
最新评论