1049 Counting Ones

Statement

Metadata

作者: CHEN, Yue
单位: 浙江大学
代码长度限制: 16 KB
时间限制: 400 ms
内存限制: 64 MB

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.

Input Specification

Each input file contains one test case which gives the positive $N$ ( $\le 2^{30}$ ).

Output Specification

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

Sample Input

Sample Output

Last update: May 4, 2022