CodeforcesRound#219(Div.2)B.MakingSequencesisFun

内容导读

互联网集市收集整理的这篇技术教程文章主要介绍了CodeforcesRound#219(Div.2)B.MakingSequencesisFun，小编现在分享给大家，供广大互联网技能从业者学习和参考。文章包含740字，纯文字阅读大概需要2分钟。

内容图文

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 (893)?=?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(893)?=?3, S(114514)?=?6.

You want to make a consecutive integer sequence starting from number m (m,?m?+?1,?...). But you need to payS(n)·k 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.

内容总结

以上是互联网集市为您收集整理的CodeforcesRound#219(Div.2)B.MakingSequencesisFun全部内容，希望文章能够帮你解决CodeforcesRound#219(Div.2)B.MakingSequencesisFun所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错，欢迎将互联网集市网站推荐给程序员好友。

内容备注

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 gblab@vip.qq.com 举报，一经查实，本站将立刻删除。

内容手机端