6119: Counting Ones (30)

[提交][状态][讨论版][命题人:]

题目描述

The task is simple: given any positive integer N, you are supposed to count the total number of 1's in the decimal form of the integers from 1 to N. For example, given N being 12, there are five 1's in 1, 10, 11, and 12.

输入

Each input file contains one test case which gives the positive N (<=230).

输出

For each test case, print the number of 1's in one line.

样例输入

12

样例输出

5

[提交][状态]