codeforces 899D. Shovel Sale

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main()
{
    ll n;scanf("%lld",&n);
    if(n<5)
    {
        printf("%d\n",n*(n-1)/2);
        return 0;
    }
    ll i=5;
    while(i*10<=n)
        i*=10;

    ll ans=0,sub=i;
    while(i<=n)
    {
        ans+=min(n-(i-1),i-1);//n是最大的数,i-1是较小数中的最大数
        i+=sub;
    }
    printf("%lld\n",ans);
    return 0;
}

猜你喜欢

转载自blog.csdn.net/Egqawkq/article/details/78831511