Advertisement
Guest User

Untitled

a guest
Apr 19th, 2019
99
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.97 KB | None | 0 0
  1. #include <iostream>
  2. using namespace std;
  3. #define UNDEFINED 32432523
  4. int apar[50], k, v;
  5. string s;
  6. char rez[10000];
  7. int find_abundent() {
  8. int maxim = 0, value;
  9. for(int i = 0; i < 27; i++) {
  10. if(maxim <= apar[i]) {
  11. maxim = apar[i];
  12. value = i;
  13. }
  14. }
  15. return value;
  16. }
  17. int main()
  18. {
  19. cin >> s;
  20. for(int i = 0; i < s.size(); i++)
  21. apar[s[i] - 'a']++;
  22. for(int i = 0; i < s.size(); i++) {
  23. if(rez[i] == 0) {
  24. char current_char = find_abundent();
  25. int ind = i;
  26. while(apar[current_char] != 0) {
  27. if(ind >= s.size())
  28. {
  29. cout << char(current_char + 97);
  30. return 0;
  31. }
  32. rez[ind] = current_char + 97;
  33. ind += 2;
  34. apar[current_char]--;
  35. }
  36. }
  37. }
  38. for(int i = 0; i < s.size(); i++)
  39. cout << rez[i];
  40. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement