zoukankan      html  css  js  c++  java
  • Codeforces Round #308 (Div. 2)B. Vanya and Books 数学

    B. Vanya and Books

    Time Limit: 20 Sec

    Memory Limit: 256 MB

    题目连接

    http://codeforces.com/contest/552/problem/B

    Description

    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 Input

    13

    Sample Output

    17

    HINT

    题意

    要写n个数,然后问你一个写了多少个数字

    比如17这个数,就写了2个数字

    题解:

    数学题,每一位都是9*10^n个

    代码:

    #include <cstdio>
    #include <cmath>
    #include <cstring>
    #include <ctime>
    #include <iostream>
    #include <algorithm>
    #include <set>
    #include <vector>
    #include <sstream>
    #include <queue>
    #include <typeinfo>
    #include <fstream>
    #include <map>
    #include <stack>
    typedef long long ll;
    using namespace std;
    //freopen("D.in","r",stdin);
    //freopen("D.out","w",stdout);
    #define sspeed ios_base::sync_with_stdio(0);cin.tie(0)
    #define test freopen("test.txt","r",stdin)  
    #define maxn 1000010
    #define mod 1000000007
    #define eps 1e-6
    const int inf=0x3f3f3f3f;
    const ll infll = 0x3f3f3f3f3f3f3f3fLL;
    inline ll read()
    {
        ll x=0,f=1;char ch=getchar();
        while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
        while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
        return x*f;
    }
    //**************************************************************************************
    
    int main()
    {  
        ll n=read();
        ll i=9;
        ll k=1;
        ll ans=0;
        while(n>=i)
        {
            n-=i;
            ans+=i*k;
            k++;
            i=i*10;
        }
        ans+=n*k;
        cout<<ans<<endl;
    }
  • 相关阅读:
    Android:Butter Knife 8.0.1配置
    webAPI获得链接客户端IP地址
    解决WebClient或HttpWebRequest首次连接缓慢问题
    Android Studio中有用的快捷键栏
    SQL十进制和十六进制相互转换
    SQL分组查询每组前几条数据
    POJ 1011 Sticks
    POJ 1144 Network(割点)
    求无向图中的割边(桥)
    POJ 2553 The Bottom of a Graph
  • 原文地址:https://www.cnblogs.com/qscqesze/p/4588083.html
Copyright © 2011-2022 走看看