Advertisement
Guest User

Untitled

a guest
Mar 20th, 2019
67
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.62 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <string.h>
  3.  
  4.  
  5.  
  6. int najdlhsie_opakovanie(char x[], int pocet) {
  7. int counter = 1;
  8. char tmp = x[0];
  9.  
  10. for (int i = 0; i <= strlen(x); i++) {
  11. if (x[i] == x[i + 1]) {
  12. counter++;
  13. if (counter > pocet) {
  14. pocet = counter;
  15. tmp = x[i];
  16. }
  17. }
  18. else { counter = 1;
  19.  
  20.  
  21. }
  22.  
  23. }
  24.  
  25. printf("Najviac opakujuce sa pismeno je: \"%c\" %i krat", tmp, pocet);
  26. return pocet;
  27.  
  28. }
  29.  
  30.  
  31. int main() {
  32.  
  33.  
  34. char s[120];
  35. char vyskyt[10];
  36. int counter=0;
  37.  
  38. printf("Zadaj retazec (max 20 znakov) : ");
  39. gets_s(s);
  40.  
  41. najdlhsie_opakovanie(s, counter);
  42.  
  43.  
  44.  
  45. return 0;
  46. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement