神奇递归Gym - 100883F
2017-03-15 00:18
344 查看
While I was working in the company, the internet broke. I didn't have anything to do without internet, so I decided to write this ACM problem.
We need to mix between two strings and also we should keep the same order for both strings.
Example: if we have s1 = "ab" and s2 = "cd", we can generate six strings:
abcd acbd
acdb cdab
cadb cabd
thank you for your help in ”Count Mix Strings” problem. now I can calculate the complexity and make input and output files. You will be given the two strings and you should print all the distinct strings that could be generated in the alphabetical order.
Input
Your program will be tested on one or more test cases. The first line of the input will be a single integer T, the number of test cases (1 ≤ T ≤ 100).
Followed by the test cases, each test case is on one line. it contains two strings s1 and s2, both strings consist of at least 1 and at most 8 lower case English letters (from ‘a’ to ‘z’).
Output
For each test case, print all the distinct strings that could be generated in the alphabetical order.
print a blank line after each test case.
Example
Input
2
a aa
ab cd
Output
aaa
abcd
acbd
acdb
cabd
cadb
cdab
给你两个字符串,混合在一起,按字典序输出。
We need to mix between two strings and also we should keep the same order for both strings.
Example: if we have s1 = "ab" and s2 = "cd", we can generate six strings:
abcd acbd
acdb cdab
cadb cabd
thank you for your help in ”Count Mix Strings” problem. now I can calculate the complexity and make input and output files. You will be given the two strings and you should print all the distinct strings that could be generated in the alphabetical order.
Input
Your program will be tested on one or more test cases. The first line of the input will be a single integer T, the number of test cases (1 ≤ T ≤ 100).
Followed by the test cases, each test case is on one line. it contains two strings s1 and s2, both strings consist of at least 1 and at most 8 lower case English letters (from ‘a’ to ‘z’).
Output
For each test case, print all the distinct strings that could be generated in the alphabetical order.
print a blank line after each test case.
Example
Input
2
a aa
ab cd
Output
aaa
abcd
acbd
acdb
cabd
cadb
cdab
给你两个字符串,混合在一起,按字典序输出。
#include <bits/stdc++.h> //#include <ext/pb_ds/tree_policy.hpp> //#include <ext/pb_ds/assoc_container.hpp> //using namespace __gnu_pbds; using namespace std; #define pi acos(-1) #define endl '\n' #define me(x) memset(x,0,sizeof(x)); #define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++) typedef long long LL; const int INF=0x3f3f3f3f; const LL LINF=0x3f3f3f3f3f3f3f3fLL; const int dx[]={-1,0,1,0,-1,-1,1,1}; const int dy[]={0,1,0,-1,1,-1,1,-1}; const int maxn=1e3+5; const int maxx=2e6+100; const double EPS=1e-7; const int mod=1000000007; template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);} template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);} template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));} template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));} //typedef tree<pt,null_type,less< pt >,rb_tree_tag,tree_order_statistics_node_update> rbtree; /*lch[root] = build(L1,p-1,L2+1,L2+cnt); rch[root] = build(p+1,R1,L2+cnt+1,R2);中前*/ /*lch[root] = build(L1,p-1,L2,L2+cnt-1); rch[root] = build(p+1,R1,L2+cnt,R2-1);中后*/ long long gcd(long long a , long long b){if(b==0) return a;a%=b;return gcd(b,a);} string s1,s2; set<string >s; int len1,len2; void dfs(int i,int j,string ans) { if(i>=len1&&j>=len2) { s.insert(ans); return ; } if(i<len1) dfs(i+1,j,ans+s1[i]); if(j<len2) dfs(i,j+1,ans+s2[j]); } int main() { int n; cin>>n; while(n--) { s1.clear();s2.clear(); s.clear(); cin>>s1>>s2; len1=s1.size(); len2=s2.size(); dfs(0,0,""); foreach(it,s) cout<<*it<<endl; cout<<endl; } }
相关文章推荐
- 神奇递归Gym - 100883F
- 神奇递归Gym - 100883F
- 神奇递归Gym - 100883F
- 神奇递归Gym - 100883F
- 神奇递归Gym - 100883F
- 神奇递归Gym - 100883F
- 神奇递归Gym - 100883F
- 神奇递归Gym - 100883F
- 神奇递归Gym - 100883F
- 神奇递归Gym - 100883F
- 神奇递归Gym - 100883F
- 神奇递归Gym - 100883F
- 算法—递归案例—一段神奇的代码
- 分形 递归打印之神奇三角形
- codeforces gym-101755 D-Transfer Window 二分图匹配、递归
- Codeforces Gym 101190 NEERC 16 .L List of Primes(递归)
- [OpenJ_Bailian](2755)神奇的口袋 ---- 递归/动态规划
- 百练2755 神奇的口袋 【深搜】or【动规】or【普通递归】or【递推】
- Gym-100883F、Gym-101095B状态压缩小结
- Tower of Hanoi (递归的神奇之力--化繁为简)