#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
auto str = "helloWorld"s;
sort(begin(str), end(str));
for(auto start = adjacent_find(cbegin(str), cend(str)), finish = upper_bound(start, cend(str), *start); start != cend(str); start = adjacent_find(finish, cend(str)), finish = upper_bound(start, cend(str), *start)) {
cout << *start << " = " << distance(start, finish) << endl;
}
}
I2luY2x1ZGUgPGFsZ29yaXRobT4KI2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8c3RyaW5nPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJYXV0byBzdHIgPSAiaGVsbG9Xb3JsZCJzOwoJCglzb3J0KGJlZ2luKHN0ciksIGVuZChzdHIpKTsKCQoJZm9yKGF1dG8gc3RhcnQgPSBhZGphY2VudF9maW5kKGNiZWdpbihzdHIpLCBjZW5kKHN0cikpLCBmaW5pc2ggPSB1cHBlcl9ib3VuZChzdGFydCwgY2VuZChzdHIpLCAqc3RhcnQpOyBzdGFydCAhPSBjZW5kKHN0cik7IHN0YXJ0ID0gYWRqYWNlbnRfZmluZChmaW5pc2gsIGNlbmQoc3RyKSksIGZpbmlzaCA9IHVwcGVyX2JvdW5kKHN0YXJ0LCBjZW5kKHN0ciksICpzdGFydCkpIHsKCSAgIGNvdXQgPDwgKnN0YXJ0IDw8ICIgPSAiIDw8IGRpc3RhbmNlKHN0YXJ0LCBmaW5pc2gpIDw8IGVuZGw7Cgl9Cn0=