Advertisement
Guest User

Untitled

a guest
Jan 20th, 2020
94
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.01 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3. int s[100],n;
  4. int valid (int k);
  5. void afisare ();
  6. void backt (int k)
  7. {
  8. int val;
  9. for (val=1;val<=n;val=val+2)
  10. {
  11. s[k]=val;
  12. if (valid (k))
  13. if (k>=n-1) afisare ();
  14. else backt (k+2);
  15.  
  16. }
  17. }
  18. int valid (int k)
  19. {
  20. int i;
  21. for (i=1;i<k;i++)
  22. if (s[i]==s[k]) return 0;
  23. return 1;
  24. }
  25. void afisare ()
  26. {
  27. for (int i=1; i<=n;i++)
  28. cout << s[i] << " ";
  29. cout << endl;
  30. }
  31. int main ()
  32. {
  33. cin >> n;
  34. for (int i=1; i<=n;i++)
  35. s[i]=i;
  36. backt (1);
  37. }
  38. #include <bits/stdc++.h>
  39. using namespace std;
  40. ifstream fin("anagrame1.in");
  41. ofstream fout("anagrame1.out");
  42. char a[10];
  43. char b[10];
  44. bool caract[10];
  45.  
  46. void bkt(int k)
  47. {
  48. if(k == strlen(a))
  49. {
  50. fout << b << '\n';
  51. return;
  52. }
  53. for(int i = 0; i < strlen(a); i++)
  54. {
  55. if(!caract[i])
  56. {
  57. caract[i] = 1;
  58. b[k] = a[i];
  59. bkt(k + 1);
  60. caract[i] = 0;
  61. }
  62. }
  63. }
  64.  
  65. int main()
  66. {
  67. fin>>a;
  68. sort(a,a+strlen(a));
  69. strcpy(b,a);
  70. bkt(0);
  71. }
  72. #include <bits/stdc++.h>
  73. using namespace std;
  74. int s[100],n;
  75. char cuv[100];
  76. int valid (int k);
  77. void afisare ();
  78. void backt (int k)
  79. {
  80. int val;
  81. for (val=1;val<=n;val++)
  82. {
  83. s[k]=val;
  84. if (valid (k))
  85. if (k==n) afisare ();
  86. else backt (k+1);
  87.  
  88. }
  89. }
  90. int valid (int k)
  91. {
  92. int i;
  93. if (k==1)
  94. if (strchr("aeiou", cuv[s[1]-1])==0) return 0;
  95. if (k==n)
  96. if (strchr("aeiou", cuv[s[n]-1])==0) return 0;
  97. for (i=1;i<k;i++)
  98. if (s[i]==s[k])
  99. return 0;
  100.  
  101. return 1;
  102. }
  103. void afisare ()
  104. {
  105. for (int i=1; i<=n;i++)
  106. cout << cuv[s[i]-1];
  107. cout << endl;
  108. }
  109. int main ()
  110. {
  111. cin >> cuv;
  112. n=strlen(cuv);
  113. sort (cuv ,cuv+n);
  114. for (int i=1; i<=n;i++)
  115. s[i]=i;
  116. backt (1);
  117. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement