fork download
copy 
  1.     #include <iostream>
  2.     #include <algorithm>
  3.     #include <string>
  4.  
  5.     static const int max_strings = 6;
  6.  
  7.     int main()
  8.     {
  9.         //6 entries
  10.         std::string strings[max_strings] = { "apple", "apple", "strawberries", "bananas", "dairy", "main" };
  11.  
  12.         // sort the strings in ascending order
  13.         std::sort(strings, &strings[max_strings]);
  14.  
  15.         // display the strings and their repeat counts
  16.         int i = 0;
  17.         while (i < max_strings)
  18.         {
  19.             std::string str = strings[i];
  20.             int count = 1;
  21.  
  22.             while (++i < max_strings)
  23.             {
  24.                 if (strings[i] != str)
  25.                     break;
  26.                 ++count;
  27.             }
  28.  
  29.             std::cout << "'" << str << "' appears " << count << " time";
  30.             if (count != 1)
  31.                 std::cout << "s";
  32.             std::cout << std::endl;
  33.         }
  34.  
  35.         return 0;
  36.     }
Success #stdin #stdout 0s 15248KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
'apple' appears 2 times
'bananas' appears 1 time
'dairy' appears 1 time
'main' appears 1 time
'strawberries' appears 1 time
https://ideone.com/Buigjs
language:
C++ (gcc 8.3)
created:
7 years 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!