Codeforces Round #219 (Div. 2) B. Making Sequences is Fun
- WBOYオリジナル
- 2016-06-07 15:49:511418ブラウズ
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.
声明：
この記事の内容はネチズンが自主的に寄稿したものであり、著作権は原著者に帰属します。このサイトは、それに相当する法的責任を負いません。盗作または侵害の疑いのあるコンテンツを見つけた場合は、admin@php.cn までご連絡ください。