POJ 1256 Anagram
Time Limit: 1000MS
Memory Limit: 10000K
Total Submissions: 12070
Accepted: 4933
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'.
Source
회소법
#include
#include
#include
using namespace std;
char s[20];
char res[20];
bool b[20];
int N;
int cmp(char a,char b)
{
if(islower(a)&&islower(b)) return a if(isupper(a)&&isupper(b)) return a if(islower(a)&&isupper(b)) return a<(b-'A'+'a');
if(isupper(a)&&islower(b)) return a<=(b-'a'+'A');
}
void backtrace(int n)
{
if(n==N)
{
printf("%s/n",res);
return ;
}
int i;
for(i=0; i
if(b[i]==false)
{
res[n]=s[i];
b[i]=true;
backtrace(n+1);
b[i]=false;
while(i<(N-1) & s[i]=s[i+1])//같은 문자 건너뛰기
i++;
}
}
}
int main()
{
int T;
while(scanf("%d",&T)!=EOF)
{
while(T--)
{
scanf("%s",&s);
N=strlen(s);
res[N]='/0';
sort(s,s+N,cmp);
memset(b,0,sizeof(b));
backtrace(0);
}
}
return 0;
}
STL:
#include
#include
#include
#include
using namespace std;
char str[20];
bool cmp(char a,char b)
{
/*if(islower(a)&&islower(b)) return a if(isupper(a)&&isupper(b)) return a if(islower(a)&&isupper(b)) return a<(b-'A'+'a');
if(isupper(a)&&islower(b)) return a<=(b-'a'+'A');*/
if(tolower(a)==tolower(b)) return a return tolower(a)
int main()
{
int T;
while(scanf("%d",&T)!=EOF)
{
while(T--)
{
scanf("%s",str);
int n=strlen(str);
sort(str,str+n,cmp);
printf("%s/n",str);
while(next_permutation(str,str+n,cmp))//CMP 추가 잊지 마세요
printf("%s/n",str);
}
}
return 0;
}
이 내용에 흥미가 있습니까?
현재 기사가 여러분의 문제를 해결하지 못하는 경우 AI 엔진은 머신러닝 분석(스마트 모델이 방금 만들어져 부정확한 경우가 있을 수 있음)을 통해 가장 유사한 기사를 추천합니다:
java에서 InputStream, String, File 간의 상호 전환 비교InputStream, String, File 상호 전환 1. String --> InputStream 2. InputStream --> String 오늘 인터넷에서 또 다른 방법을 보았는데, 특별히 가지고 와서 공...
텍스트를 자유롭게 공유하거나 복사할 수 있습니다.하지만 이 문서의 URL은 참조 URL로 남겨 두십시오.
CC BY-SA 2.5, CC BY-SA 3.0 및 CC BY-SA 4.0에 따라 라이센스가 부여됩니다.