fork download
  1.  
  2. #include<bits/stdc++.h>
  3. #define mod 1000000007
  4. #define ll long long
  5. #define p(x) pair<x,x>
  6. #define v(x) vector<x>
  7. #define tree node*
  8. #define sz(a) a.size()
  9. #define f first
  10. #define s second
  11. #define pb(a) push_back(a)
  12. #define pf(a) push_front(a)
  13. #define FOR(i,l,r) for(int i=l;i<r;i++)
  14. #define FORX(i,l,r,x) for(int i=l;i<r;i+=x)
  15. #define FORD(i,l,r) for(int i=l;i>=r;i--)
  16. #define correct(x,y,n,m) 0<=(x)&&(x)<(n)&&0<=(y)&&(y)<(m)
  17. #define cin(M,n) FOR(i,0,n)cin>>M[i]
  18. #define cout(M,n) FOR(i,0,n)cout<<M[i]
  19. #define rs(M,x) memset(M,x,sizeof(M))
  20. #define reset() FOR(i, 0, 1001)A[i].clear(),check[i]=false
  21. #define faster() cin.tie(0); ios_base::sync_with_stdio(false); cout.tie(0);
  22. #define run() int t; cin >> t; while (t--)
  23. #define pq(x) priority_queue<x>
  24. #define neg_pq(x) priority_queue<x, vector<x>, greater<x>>
  25. #define all(M) M.begin(),M.end()
  26. using namespace std;
  27.  
  28. //_______________________NGUYỄN_NGỌC_TOÀN_______________________//
  29.  
  30. bool check(v(char) M, int n) {
  31. FOR(i, 1, n - 1) {
  32. if (M[i] == 'A' || M[i] == 'E') {
  33. if (M[i - 1] != 'A' && M[i - 1] != 'E' && M[i + 1] != 'A' && M[i + 1] != 'E')return false;
  34. }
  35. }
  36. return true;
  37. }
  38. int main() {
  39. char c; cin >> c;
  40. v(char) M(c - 'A' + 1);
  41. iota(all(M), 'A');
  42. do {
  43. if (check(M, sz(M))) {
  44. cout(M, sz(M));
  45. cout << endl;
  46. }
  47. } while (next_permutation(all(M)));
  48. }
  49.  
  50. //__________________________B20DCPT173__________________________//
  51.  
Success #stdin #stdout 0.01s 5288KB
stdin
D
stdout
ABCD
ABDC
ACBD
ACDB
ADBC
ADCB
BCDA
BDCA
CBDA
CDBA
DBCA
DCBA