uva 10098 Generating Fast

原题：
Generating permutation has always been an important problem in computer science. In this problem
you will have to generate the permutation of a given string in ascending order. Remember that your
algorithm must be efficient.
Input
The first line of the input contains an integer n, which indicates how many strings to follow. The next
n lines contain n strings. Strings will only contain alpha numerals and never contain any space. The
maximum length of the string is 10.
Output
For each input string print all the permutations possible in ascending order. Not that the strings should
be treated, as case sensitive strings and no permutation should be repeated. A blank line should follow
each output set.
Sample Input
3
ab
abc
bca
Sample Output
ab
ba
abc
acb
bac
bca
cab
cba
abc
acb
bac
bca
cab
cba

中文：
给你一个字符串，让你输出这个字符串按字典序的所有排列。

代码：

#include<bits/stdc++.h>
using namespace std;typedef long long ll;
const int maxn=11;char s[maxn],ans[maxn];void permutation(int n,int cur,char *p,char *a)
{if(cur==n){for(int i=0;i<n;i++)cout<<a[i];cout<<endl;}else{for(int i=0;i<n;i++){if(!i||p[i]!=p[i-1]){int c1=0,c2=0;for(int j=0;j<cur;j++)if(a[j]==p[i])c1++;for(int j=0;j<n;j++)if(p[j]==p[i])c2++;if(c1<c2){a[cur]=p[i];permutation(n,cur+1,p,a);}}}}
}int main()
{ios::sync_with_stdio(false);int t;cin>>t;while(t--){cin>>s;int len=strlen(s);sort(s,s+len);permutation(len,0,s,ans);//if(t)cout<<endl;}return 0;
}

解答：

裸题，套小白书里的模板即可

uva 10098 Generating Fast相关推荐

uva 10098 Generating Fast(全排列)
还是用的两种方法,递归和STL,递归那个是含有反复元素的全排列,这道题我没有尝试没有反复元素的排列,由于从题目上并没有发现一定是有反复元素的() 贴代码: <span style=" ...
【UVA】11992 - Fast Matrix Operations（段树模板）
主体段树,要注意,因为有set和add操作,当慵懒的标志下推.递归优先set,后复发add,每次运行set行动add马克清0 WA了好几次是由于计算那一段的时候出问题了,可笑的是我对着模板找了一个多小 ...
uva 11925——Generating Permutations
题意:给定一个1-n的排列,用不超过2*n2的操作把他变成升序.每次操作只有两种,一种是交换前两个元素,另外一种是把最后一个元素放到最后一位. 思路:贪心.用双端队列来保存数据,每次当v[0]> ...
π-Algorithmist分类题目（1）
原题网站:Algorithmist,http://www.algorithmist.com/index.php/Main_Page π-Algorithmist分类题目(1) Sorting UVAL ...
提取了下刘汝佳推荐的题号...
今天闲来没事上uva oj提取了下刘汝佳推荐的acm题号,原始数据如下: Volume 0. Getting Started 10055 - Hashmat the Brave Warrior ...
ICPC训练联盟2021寒假冬令营(9)_2021.01.29_笔记
试题链接点我进入代码提交OJ 学习笔记 - 数论与组合分析入门数论的编程实验 • 3.1素数运算的实验范例 • 3.2求解不定方程和同余方程的实验范例 • 3.3 特殊的同余式 • 3.4 积性函 ...
Competitive Programming 3题解
题目一览: Competitive Programming 3: The New Lower Bound of Programming Contests(1) Competitive Programm ...
AOAPC I: Beginning Algorithm Contests 题解
AOAPC I: Beginning Algorithm Contests 题解 AOAPC I: Beginning Algorithm Contests (Rujia Liu) - Virtual ...
ICPC程序设计题解书籍系列之六：吴永辉：《算法设计编程实验》
第1章 Ad Hoc问题 POJ2661 HDU1141 ZOJ2545 UVA10916 Factstone Benchmark[Ad Hoc] UVA10037 Bridge[贪心] POJ257 ...
紫书《算法竞赛入门经典》
紫书<算法竞赛入门经典>题目一览第3章数组和字符串(例题) UVA 272 TEX Quotes UVA 10082 WERTYU UVA 401 Palindromes UVA 34 ...

uva 10098 Generating Fast

uva 10098 Generating Fast相关推荐

最新文章

热门文章