Maison >base de données >tutoriel mysql >Codeforces Round #219 (Div. 2) B. Making Sequences is Fun

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

WBOY
WBOYoriginal
2016-06-07 15:49:511467parcourir

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.

Déclaration:
Le contenu de cet article est volontairement contribué par les internautes et les droits d'auteur appartiennent à l'auteur original. Ce site n'assume aucune responsabilité légale correspondante. Si vous trouvez un contenu suspecté de plagiat ou de contrefaçon, veuillez contacter admin@php.cn