B. Vanya and Books( Codeforces Round #308 (Div. 2) 简单题)
来源:互联网 发布:淘宝减肥产品哪个好 编辑:程序博客网 时间:2024/05/17 08:22
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.
The first line contains integer n (1 ≤ n ≤ 109) — the number of books in the library.
Print the number of digits needed to number all the books.
13
17
4
4
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-n之中有多少个数字,例如10有两个数字,100有三个数字。
点击打开链接
#include<iostream>#include<algorithm>#include<stdio.h>#include<string.h>#include<stdlib.h>using namespace std;__int64 sum;__int64 a[] = {0,9,90,900,9000,90000,900000,9000000,90000000,900000000};__int64 b[] = {0,10,100,1000,10000,100000,1000000,10000000,100000000,1000000000,10000000000};__int64 n;int main(){ while(scanf("%I64d",&n)!=EOF){ sum = 0; for(int i=1;i<=10;i++){ if(n>=b[i]){ sum += a[i]*i; }else{ sum += (n - b[i-1] + 1)*i; break; } } if(n<10) { sum--; } printf("%I64d\n",sum); }}
- B. Vanya and Books( Codeforces Round #308 (Div. 2) 简单题)
- B. Vanya and Books(Codeforces Round #308 (Div. 2))
- Codeforces Round #308 (Div. 2) B. Vanya and Books
- Codeforces Round #308 (Div. 2) Vanya and Books
- #308 (div.2) B. Vanya and Books
- (Vanya and Lanterns)Codeforces Round #280 (Div. 2)B
- Vanya and Lanterns( Codeforces Round #280 (Div. 2)B)
- Codeforces Round #355 (Div. 2) B. Vanya and Food Processor
- A. Vanya and Table(Codeforces Round #308 (Div. 2))
- C. Vanya and Scales(Codeforces Round #308 (Div. 2))
- D. Vanya and Triangles(Codeforces Round #308 (Div. 2))
- E. Vanya and Brackets(Codeforces Round #308 (Div. 2))
- Codeforces Round #308 (Div. 2) A. Vanya and Table
- Codeforces Round #308 (Div. 2) C. Vanya and Scales
- Codeforces Round #308 (Div. 2) D. Vanya and Triangles
- Codeforces Round #308 (Div. 2) E. Vanya and Brackets
- Codeforces Round #308 (Div. 2) C.Vanya and Scales
- Codeforces Round #308 (Div. 2) D Vanya and Triangles
- HDOJ-2112-HDU Today(最短路)
- poj-2442-Sequence-优先队列||堆
- 20150817
- gson
- hdu2647
- B. Vanya and Books( Codeforces Round #308 (Div. 2) 简单题)
- C#实现阿拉伯数字到大写中文的转换
- windows,打印机无打印任务,仍不断打印
- Java读取文件常用工具类
- HDOJ 2647 Reward (反向拓扑排序)
- php使用curl访问https示例分享
- Android笔记
- 归并排序
- java.lang.Thread.State类详解