poj1256 Anagram
2015-05-19 21:19
225 查看
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
Sample Output
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'.
就是求出个全排列,先按要求排序,再进行搜索,这里,用的是交换的方法,就可以得出答案
// ConsoleApplication1.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include "stdio.h"
#include "string.h"
#include "math.h"
#include <algorithm>
#include <vector>
#include <queue>
#include <iostream>
using namespace std;
#define N 1125
#define SCANF scanf_s
char str
;
bool isBig(char a)
{
if (a < 'a')
return true;
return false;
}
bool cmp(char a, char b)
{
if (isBig(a)== isBig(b))
{
return a < b;
}
else
{
int x = isBig(a) ? a - 'A' : a - 'a';
int y = isBig(b) ? b - 'A' : b - 'a';
if (x != y)
return x < y;
else
return isBig(a);
}
}
void swap(int i, int j)
{
char temp = str[i];
str[i] = str[j];
str[j] = temp;
}
void print(int n)
{
for (int i = 0; i < n; i++)
{
printf("%c", str[i]);
}
printf("\n");
}
int dfs(int k,int n)
{
if (k >= n){
print(n);
return 0;
}
for (int i = k; i < n; i++)
{
if (i == k || str[i] != str[k])
{
swap(i, k);
dfs(k + 1, n);
}
}
char temp = str[k];
for (int i = k; i < n - 1; i++)
{
str[i] = str[i + 1];
}
str[n-1] = temp;
return 0;
}
int main()
{
int n;
while (SCANF("%d", &n ) != EOF)
{
SCANF("%s",str,N);
int lenth = strlen(str);
sort(str, str + lenth, cmp);
//printf("%s\n", str);
dfs(0, lenth);
}
return 0;
}
Time Limit: 1000MS | Memory Limit: 10000K | |
Total Submissions: 18307 | Accepted: 7452 |
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'.
就是求出个全排列,先按要求排序,再进行搜索,这里,用的是交换的方法,就可以得出答案
// ConsoleApplication1.cpp : 定义控制台应用程序的入口点。
//
#include "stdafx.h"
#include "stdio.h"
#include "string.h"
#include "math.h"
#include <algorithm>
#include <vector>
#include <queue>
#include <iostream>
using namespace std;
#define N 1125
#define SCANF scanf_s
char str
;
bool isBig(char a)
{
if (a < 'a')
return true;
return false;
}
bool cmp(char a, char b)
{
if (isBig(a)== isBig(b))
{
return a < b;
}
else
{
int x = isBig(a) ? a - 'A' : a - 'a';
int y = isBig(b) ? b - 'A' : b - 'a';
if (x != y)
return x < y;
else
return isBig(a);
}
}
void swap(int i, int j)
{
char temp = str[i];
str[i] = str[j];
str[j] = temp;
}
void print(int n)
{
for (int i = 0; i < n; i++)
{
printf("%c", str[i]);
}
printf("\n");
}
int dfs(int k,int n)
{
if (k >= n){
print(n);
return 0;
}
for (int i = k; i < n; i++)
{
if (i == k || str[i] != str[k])
{
swap(i, k);
dfs(k + 1, n);
}
}
char temp = str[k];
for (int i = k; i < n - 1; i++)
{
str[i] = str[i + 1];
}
str[n-1] = temp;
return 0;
}
int main()
{
int n;
while (SCANF("%d", &n ) != EOF)
{
SCANF("%s",str,N);
int lenth = strlen(str);
sort(str, str + lenth, cmp);
//printf("%s\n", str);
dfs(0, lenth);
}
return 0;
}
相关文章推荐
- POJ 1256 Anagram
- POJ 1256 Anagram
- POJ 1256 Anagram(输入可重集枚举排序)
- poj 1256 Anagram
- POJ1256 Anagram STL中的next_permutation()
- POJ 1256.Anagram(DFS和STL)
- POJ 1256 Anagram
- POJ_1256_Anagram
- POJ - 1256 Anagram
- poj-1256-Anagram
- (Relax ST1.7)POJ 1256 Anagram(求一个字符串在特殊规定下的全排列)
- 7 POJ 1256 Anagram
- POJ 1256 Anagram【生成有重集的全排列2.0】
- poj 1256 Anagram
- poj 1256(Anagram)
- POJ1256 Anagram
- 不重复排列 POJ 1256 Anagram
- poj 1256 Anagram
- POJ 1256 Anagram(next_permutation全排列)
- poj 1256 Anagram