# 比赛链接

https://codeforces.com/contest/1551

# 2. B2. Wonderful Coloring - 2

## 2.1. 题意

1. each element of the sequence is either painted in one of k colors or isn’t painted;
2. each two elements which are painted in the same color are different (i. e. there’s no two equal values painted in the same color);
3. let’s calculate for each of k colors the number of elements painted in the color — all calculated numbers must be equal;
4. the total number of painted elements of the sequence is the maximum among all colorings of the sequence which meet the first three conditions.

# 3. C. Interesting Story

## 3.1. 题意

A story is called interesting if there exists a letter which occurs among all words of the story more times than all other letters together.

You are given a sequence of n words consisting of letters ‘a’, ‘b’, ‘c’, ‘d’ and ‘e’. Your task is to choose the maximum number of them to make an interesting story. If there’s no way to make a non-empty story, output 0.

sb题目没营养，不展开了