B. Vanya and Books

B. Vanya and Books

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Vanya got an important task — he should enumerate books in the library and label each book with its number. Each of the n books should be assigned with a number from 1 to n. Naturally, distinct books should be assigned distinct numbers.

Vanya wants to know how many digits he will have to write down as he labels the books.

Input

The first line contains integer n (1 ≤ n ≤ 109) — the number of books in the library.

Output

Print the number of digits needed to number all the books.

Sample test(s)

input

13

output

17

input

4

output

4

Note

Note to the first test. The books get numbers 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, which totals to 17 digits.

Note to the second sample. The books get numbers 1, 2, 3, 4, which totals to 4 digits.

分析：本题就是统计位数，例1中遍历13的得到：

1,2,3,4,5,6,7,8,9这是个位，有9个

10,11,12,13这是两位，有4个，则为4*2=8

统计为9+8=17

具体解法是：输入一个数字，先统计这个数字有x位，然后我们知道count=1*9+2*90+3*900+····+(x-1)*9*(10的(x-1)次方)

然后count+=x*(x-(10的x次方))。在本题中count用int型会导致溢出，要改成long型。

具体java代码：

import java.util.Scanner;

public class VanyaandBooks {
	public static int bitcount(long n) {

		int bitco = 0;
		long num = n;
		while (num >= 1) {
			num = num / 10;
			bitco++;
		}
		return bitco;

	}

	public static long CountDigits(long n) {
		long count = 0l;
		int bitcot = bitcount(n);
		//System.out.println(bitcot);
		if (bitcot == 1) {
			return n;
		} else {
			long num = 1l;
			for (int j = 1; j < bitcot; j++) {
				num *= 10;
			}
			int bitco = bitcot;
			long bits = 9l;
			long i = 1l;
			while (bitco > 1) {
				count += bits * i;
				bits *= 10;
				i++;
				bitco--;
			}
			// System.out.println(count);
			long number = n - num + 1;
			count += number * bitcot;
		}

		return count;
	}

	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		long n = reader.nextLong();
		System.out.println(CountDigits(n));
	}

}