Preparando MOJI

Maximize Sum of Digits

1000ms 262144K

Description:

Anton has the integer x. He is interested what positive integer, which doesn't exceed x, has the maximum sum of digits.

Your task is to help Anton and to find the integer that interests him. If there are several such integers, determine the biggest of them.

Input:

The first line contains the positive integer x (1 ≤ x ≤ 1018) — the integer which Anton has.

Output:

Print the positive integer which doesn't exceed x and has the maximum sum of digits. If there are several such integers, print the biggest of them. Printed integer must not contain leading zeros.

Sample Input:

100

Sample Output:

99

Sample Input:

48

Sample Output:

48

Sample Input:

521

Sample Output:

499

Informação

Codeforces

Provedor Codeforces

Código CF770B

Tags

*specialimplementationmath

Submetido 0

BOUA! 0

Taxa de BOUA's 0%

Datas 09/05/2023 09:12:52

Relacionados

Nada ainda