Preparando MOJI

The number on the board

2000ms 262144K

Description:

Some natural number was written on the board. Its sum of digits was not less than k. But you were distracted a bit, and someone changed this number to n, replacing some digits with others. It's known that the length of the number didn't change.

You have to find the minimum number of digits in which these two numbers can differ.

Input:

The first line contains integer k (1 ≤ k ≤ 109).

The second line contains integer n (1 ≤ n < 10100000).

There are no leading zeros in n. It's guaranteed that this situation is possible.

Output:

Print the minimum number of digits in which the initial number and n can differ.

Sample Input:

3
11

Sample Output:

1

Sample Input:

3
99

Sample Output:

0

Note:

In the first example, the initial number could be 12.

In the second example the sum of the digits of n is not less than k. The initial number could be equal to n.

Informação

Codeforces

Provedor Codeforces

Código CF835B

Tags

greedy

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 09:17:11

Relacionados

Nada ainda