#P16297. [蓝桥杯 2026 省 Python C 组] 调皮的橘猫

[蓝桥杯 2026 省 Python C 组] 调皮的橘猫

Background

{{background}}

Problem Description

Cat owner Xiao Lan prepared 20260412210462022026041221046202 reward blind boxes for the cats at home, lined up in a long row, and numbered them in order as 1,2,3,…1, 2, 3, \dots.

For better looks, Xiao Lan uses single-digit number stickers (that is, small stickers printed with digits 00 to 99) to form these numbers. For example:

  • To label blind box No. 88, it takes 11 sticker (one 88).
  • To label blind box No. 1212, it takes 22 stickers (one 11 and one 22).
  • To label blind box No. 104104, it takes 33 stickers (11, 00, and 44).

Just while the owner turned around to pour cat food, the naughty orange cat bit and ruined the first 2026 blind boxes in the line (that is, the blind boxes numbered from 11 to 20262026), and the stickers on those blind boxes were destroyed as well.

Looking at the remaining blind boxes, the owner sighed.

Now, please help the owner calculate: on the remaining intact blind boxes (that is, the blind boxes numbered from 20272027 to 20260412210462022026041221046202), how many single-digit number stickers are still kept in total?

Input Format

{{formatI}}

Output Format

This is an output-only fill-in-the-blank problem. You only need to compute the result and submit it. The result is an integer. When submitting the answer, only fill in this integer. Any extra content will make you get no points.



Hint

{{hint}}

Translated by ChatGPT 5