Preparing NOJ

Phone Numbers

2000ms 524288K

Description:

Let's call a string a phone number if it has length 11 and fits the pattern "8xxxxxxxxxx", where each "x" is replaced by a digit.

For example, "80123456789" and "80000000000" are phone numbers, while "8012345678" and "79000000000" are not.

You have $$$n$$$ cards with digits, and you want to use them to make as many phone numbers as possible. Each card must be used in at most one phone number, and you don't have to use all cards. The phone numbers do not necessarily have to be distinct.

Input:

The first line contains an integer $$$n$$$ — the number of cards with digits that you have ($$$1 \leq n \leq 100$$$).

The second line contains a string of $$$n$$$ digits (characters "0", "1", ..., "9") $$$s_1, s_2, \ldots, s_n$$$. The string will not contain any other characters, such as leading or trailing spaces.

Output:

If at least one phone number can be made from these cards, output the maximum number of phone numbers that can be made. Otherwise, output 0.

Sample Input:

11
00000000008

Sample Output:

1

Sample Input:

22
0011223344556677889988

Sample Output:

2

Sample Input:

11
31415926535

Sample Output:

0

Note:

In the first example, one phone number, "8000000000", can be made from these cards.

In the second example, you can make two phone numbers from the cards, for example, "80123456789" and "80123456789".

In the third example you can't make any phone number from the given cards.

Info

CodeForces

Provider CodeForces

Origin Codeforces Round #513 by Barcelona Bootcamp (rated, Div. 1 + Div. 2)

Code CF1060A

Tags

brute force

Submitted 152

Passed 74

AC Rate 48.68%

Date 03/04/2019 16:39:31

Related

Nothing Yet