#P14854. [ICPC 2021 Yokohama R] Lottery Fun Time
[ICPC 2021 Yokohama R] Lottery Fun Time
题目描述
:::align{right}
:::
The biggest fun of lottery is not in receiving the (usually a tiny amount of) prize money, but in dreaming of the big fortune you may possibly (that is, virtually never) receive.
You have a number of lottery tickets at hand, each with a six-digit number. All the numbers are different, of course. Tomorrow is the drawing day and the prizes are the following.
- The first prize of yen is won by the ticket with exact match of all the six digits with the six-digit first prize winning number.
- The second prizes of yen are won by all of the tickets with their last four digits matching the four-digit second prize winning number.
- The third prizes of yen are won by all of the tickets with their last two digits matching any of the three two-digit third prize winning numbers.
The six digits on the lottery tickets and all of the winning numbers may start with zeros.
The last two digits of all the prize winning numbers are made different so that tickets winning the third prize cannot also win the first nor the second prizes. Note that this rule also made the last two digits of the first and the second prize winning numbers different.
To enjoy the climax of the lottery fun time, you decided to calculate the possible maximum amount you may win with your tickets. You have too many tickets to hand-calculate it, but it should also be your joy to write a program for making the calculation.
输入格式
The first line of the input has a positive integer (), which is the number of tickets you have at hand. Each of the following lines has the six-digit number on one of your tickets. All the numbers are different from one another.
输出格式
Output in a line a single integer, which is the maximum possible total of winning prizes with the tickets you have.
7
034207
924837
372745
382947
274637
083907
294837
309500
10
012389
456789
234589
678989
890189
567889
123489
263784
901289
345689
304500
提示
For the first sample, the following combination of prize winners allows the maximum total amount of yen.
- The first prize winner of makes one ticket with that number win yen.
- The second prize winner of makes two tickets, and , win yen each.
- The third prize winners and make three tickets, , , and , win yen each. cannot be a third prize winner, as the second prize winner, , has the final two digits of . The ticket , thus, wins nothing. You have no more tickets to win whatever the remaining third prize winner may be.
For the second sample, nine out of the ten tickets have the same last two digits, , and thus the third prize winner of allows nine third prizes, totaling yen. This is more than the second prize of yen possibly won by one of these nine tickets. The only remaining ticket should, of course, win the first prize.