String Task

SUBMITTED BY: Guest

DATE: March 12, 2014, 1:53 p.m.

FORMAT: Text only

SIZE: 2.6 kB

Raw Download

HITS: 771

Report
  1. //Haha TTPro
  2. //http://codeforces.com/problemset/problem/118/A
  3. //String Task
  5. #include <iostream>
  6. #include <string.h>
  8. using namespace std;
  9. struct NODE
  10. {
  11. char cha;
  12. NODE * pNext;
  13. };
  14. void input(NODE*&head, char X[]);
  15. void output(NODE*&head);
  16. void Clean(NODE*&head);
  17. void DeVowels(NODE*&head);
  18. bool CheckVowels(char x);
  19. void DeDummyNodehead(NODE*&head);
  20. void DummyNodehead(NODE*&head);
  21. void Replace(NODE*& head);
  22. void Up(char &x);
  23. int main()
  24. {
  26. char X[120];
  27. cin.getline(X, 120);
  28. NODE*head = NULL;
  29. DummyNodehead(head);
  30. input(head,X);
  31. DeVowels(head);
  32. DeDummyNodehead(head);
  34. Replace(head);
  35. output(head);
  36. Clean(head);
  37. }
  39. void DummyNodehead(NODE*&head)
  40. {
  41. head = new NODE;
  42. head->pNext = NULL;
  43. }
  45. void DeDummyNodehead(NODE*&head)
  46. {
  47. NODE*K;
  49. K = head;
  50. head = head->pNext;
  51. delete K;
  52. }
  53. void CreateNode(NODE*&K, char a)
  54. {
  55. K = new NODE;
  56. K->cha = a;
  57. K->pNext = NULL;
  58. }
  60. void input(NODE*&head, char X[])
  61. {
  62. char a;
  63. NODE *K,*cur;
  67. cur = head;
  68. for (int i =0; i < strlen(X);i++)
  69. {
  70. a=X[i];
  71. if (a == '\0') break;
  72. CreateNode(K,a);
  73. cur->pNext = K;
  74. cur = cur->pNext;
  75. }
  76. }
  78. void output(NODE*&head)
  79. {
  80. NODE*cur;
  81. cur = head;
  82. while (cur != NULL)
  83. {
  84. cout << ".";
  85. cout << cur->cha;
  86. cur = cur->pNext;
  87. }
  89. }
  91. void Clean(NODE*&head)
  92. {
  93. NODE*cur;
  94. cur = head;
  95. while (cur!=NULL)
  96. {
  97. head = head->pNext;
  98. delete cur;
  99. cur = head;
  100. }
  101. }
  104. void DeVowels(NODE*&head)
  105. {
  106. NODE*cur;
  107. NODE*del;
  108. cur = head;
  109. while (cur->pNext != NULL)
  110. {
  111. while (CheckVowels(cur->pNext->cha))
  112. {
  114. del = cur->pNext;
  115. cur->pNext = del->pNext;
  116. delete del;
  117. if (cur->pNext == NULL) break;
  118. }
  120. cur = cur->pNext;
  121. if (cur == NULL) break;
  122. }
  125. }
  127. bool CheckVowels(char x)
  128. {
  129. if ((x == 'A') || (x == 'a') || (x == 'O') || (x == 'o') || (x == 'E') || (x == 'e') || (x == 'Y') || (x == 'y') || (x == 'U') || (x == 'u') || (x == 'i') || (x == 'I'))
  130. {
  131. return true;
  132. }
  133. return false;
  134. }
  136. void Up(char &x)
  137. {
  138. if ((x >= 65) && (x <= 90))
  139. {
  140. x = x + 32;
  141. }
  142. }
  144. void Replace(NODE*& head)
  145. {
  146. if (head == NULL) return;
  147. NODE* cur = head;
  148. while (cur != NULL)
  149. {
  150. Up(cur->cha);
  151. cur = cur->pNext;
  152. }
  153. }
comments powered by Disqus