您好,欢迎来到倪彼情感。
搜索
您的当前位置:首页CodeforcesRound#219(Div.2)B.MakingSequencesisFun

CodeforcesRound#219(Div.2)B.MakingSequencesisFun

来源:倪彼情感


We'll define S ( n ) for positive integer n as follows: the number of the n 's digits in the decimal base. For example, S (3)?=?3 , S (114514)?=?6 . You want to make a consecutive integer sequence starting from number m ( m ,? m ??1,?...

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

You want to make a consecutive integer sequence starting from number m (m,?m?+?1,?...). But you need to payS(nk to add the number n to the sequence.

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

Copyright © 2019- nbmht.com 版权所有

违法及侵权请联系:TEL:199 18 7713 E-MAIL:2724546146@qq.com

本站由北京市万商天勤律师事务所王兴未律师提供法律服务