fork(1) download
copy 
  1. #include <iostream>
  2. #include <cstring>
  3. using namespace std;
  4.  
  5. void lowerCase(char line[]) {
  6.     for (int i = 0; line[i] != '\0'; ++i) {
  7.         if (line[i] >= 'A' && line[i] <= 'Z') {
  8.             line[i] = line[i] + ('a' - 'A');
  9.         }
  10.     }
  11. }
  12.  
  13. char findMostFrequentLowercase(char text[]) {
  14.     const int ALPHABET_SIZE = 26;
  15.     int letterFrq[ALPHABET_SIZE] = {0};
  16.     for (int i = 0; text[i] != '\0'; ++i) {
  17.         if (text[i] >= 'a' && text[i] <= 'z') {
  18.             letterFrq[text[i] - 'a']++;
  19.         }
  20.     }
  21.     char mostFrequentChar = 0;
  22.     int maxCount = 0;
  23.     for (int i = 0; i < ALPHABET_SIZE; ++i) {
  24.         if (letterFrq[i] > maxCount) {
  25.             maxCount = letterFrq[i];
  26.             mostFrequentChar = 'a' + i;
  27.         }
  28.     }
  29.     return mostFrequentChar;
  30. }
  31.  
  32. const int MAX_SIZE = 256;
  33.  
  34. int main() {
  35.     char line[MAX_SIZE + 1], allText[MAX_SIZE + 1] = "";
  36.     int allTextLength = 0;
  37.     while (cin.getline(line, MAX_SIZE + 1)) {
  38.         if (strlen(line) == 0) {
  39.             break;
  40.         }
  41.         lowerCase(line);
  42.         /*for (int i = 0; line[i] != '\0'; ++i) {
  43.             allText[allTextLength++] = line[i];
  44.         }
  45.     }
  46.     allText[allTextLength] = '\0';*/
  47.         strcat(allText, line);
  48.     }
  49.     char mostFrequent = findMostFrequentLowercase(allText);
  50.     cout << mostFrequent << endl;
  51.     return 0;
  52. }
  53.  
Success #stdin #stdout 0s 5288KB
comments (?)
stdin
copy 
ana are mere
stdout
copy 
a
https://ideone.com/Lq1ePv
language:
C++ (gcc 8.3)
created:
11 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!