CF373B.Making Sequences is Fun

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

We'll define S(n)S(n) for positive integer nn as follows: the number of the nn 's digits in the decimal base. For example, S(893)=3S(893)=3 , S(114514)=6S(114514)=6 .

You want to make a consecutive integer sequence starting from number mm ( m,m+1,...m,m+1,... ). But you need to pay S(n)kS(n)·k to add the number nn to the sequence.

You can spend a cost up to ww , and you want to make the sequence as long as possible. Write a program that tells sequence's maximum length.

输入格式

The first line contains three integers ww ( 1<=w<=10161<=w<=10^{16} ), mm ( 1<=m<=10161<=m<=10^{16} ), kk ( 1<=k<=1091<=k<=10^{9} ).

Please, do not write the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cin, cout streams or the %I64d specifier.

输出格式

The first line should contain a single integer — the answer to the problem.

输入输出样例

  • 输入#1

    9 1 1
    

    输出#1

    9
    
  • 输入#2

    77 7 7
    

    输出#2

    7
    
  • 输入#3

    114 5 14
    

    输出#3

    6
    
  • 输入#4

    1 1 2
    

    输出#4

    0
    
首页