Fill in the order form to get the price

Subject

Category

Deadline

Timezone:

Title *

Task *

{"ops":[{"insert":"Please write in C++ a solution to the following problem. Having a list of words (which are sequences of small letters), one word per one line, sort them according to the following order: word_1 is smaller that word_2 if word_1 contains more letters \u2018a\u2019, and in the case of the equal number of \u2018a\u2019 letters in both words, consider the number of letter \u2018b\u2019, and as a smaller word take word with bigger number of letter \u2018b\u2019, and so on. In the case of two words have the same number of equivalent letters, take into account lexicographic order between them. For example: baabca is bigger that ccaaaa (3 x \u2018a\u2019 vs 4 x \u2018a\u2019), and xababx is smaller than abacd (2 x \u2018a\u2019 in both words, but 2 x \u2018b\u2019 in the first one vs 1 x \u2018b\u2019 in the second one word). Word bbaaxx is smaller than xxaabb. An example input and output. Input: ale james john ela alexander kamil Output: alexander james ale ela kamil john\n"}]}

I need basic explanations

Special Requirements

Upload files (if required)

Drop files here to upload

Add files...

Account info

Already have an account?

Name *

E-mail *

Password *

The password must be at least 6 characters.

I agree with terms & conditions