首页 > 数据库 > mysql教程 > Codeforces Round #219 (Div. 2) B. Making Sequences is Fun

Codeforces Round #219 (Div. 2) B. Making Sequences is Fun

WBOY
发布: 2016-06-07 15:49:51
原创
1462 人浏览过

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)?=?3S(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.

相关标签:
来源:php.cn
本站声明
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系admin@php.cn
热门教程
更多>
最新下载
更多>
网站特效
网站源码
网站素材
前端模板