Codeforces373B_Making Sequences is Fun_枚举长度。。。

B. Making Sequences is Fun
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

We'll define S(n) for positive integer n as follows: the number of the n's digits in the decimal base. For example, S(893) = 3,S(114514) = 6.

You want to make a consecutive integer sequence starting from number m (m, m + 1, ...). But you need to pay S(nk to add the number n to the sequence.

You can spend a cost up to w, and you want to make the sequence as long as possible. Write a program that tells sequence's maximum length.

Input

The first line contains three integers w (1 ≤ w ≤ 1016), m (1 ≤ m ≤ 1016), k (1 ≤ k ≤ 109).

Please, do not write the %lld specifier to read or write 64-bit integers in C++. It is preferred to use the cincout streams or the %I64dspecifier.

Output

The first line should contain a single integer — the answer to the problem.

Sample test(s)
input
9 1 1
output
9
input
77 7 7
output
7
input
114 5 14
output
6
input
1 1 2
output
0

第一次做到爆LONG LONG的题目。。。

可能是因为偷懒了一学期敲题少的缘故吧。。。WA了6炮才过= =

基础还是太弱啊!

简单的枚举位数,然后做除法即可。

问题的核心点在于是否抓住了:位数一样,每增加一位的花费也是一样的。

源代码如下:

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
using namespace std;
typedef long long ll;

int main()
{
    ll w,m,ans=0,k;
    cin>>w>>m>>k;
    ll temp=m;
    ll length=0;
    while(temp!=0)
    {
        ++length;
        temp/=10;
    }
    ll num=0;
    for(int i=1;i<=length;++i)
    {
        num*=10;
        num+=9;
    }
    ll remain=num-m+1;
    if(remain*k*length<0)
    {
        ans+=w/(k*length);
    }
    else if(w>=remain*k*length)
    {
        w-=remain*k*length;
        ans+=remain;
        for(int i=length+1;;++i)
        {
            num=9*(ll)pow(10.0,(i-1)*1.0);
            if(w>=num*k*i&&(num*k*i>0))
            {
                w-=num*k*i;
                ans+=num;
            }
            else
            {
                ans+=w/(k*i);
                break;
            }
        }
    }
    else
    {
        ans+=w/(k*length);
    }
    cout<<ans<<endl;
    return 0;
}

还有,你!!!!!!!!!!!!!!!!!!!!!

期末之前绝对不玩dota2了!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!

在此发下誓言,CSDN见证!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!



评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值