2019ICPC 上海网络赛 L题：Digit sum

补题

上海区域赛L题（签到题)

    https://nanti.jisuanke.com/t/41422

题目意义

给出n和b，求1到n，各数在b进制下各位数之和的总和。

思路

1,打表
2，数位DP

AC代码

//打表
#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

const int M = 1e6 + 5;

typedef long long ll;

ll res[11][M];

ll f(int n, int b)
{
    ll ans = 0;
    while (n)
    {
        ans += n % b;
        n /= b;
    }
    return ans;
}

int main()
{
    int t;
    scanf("%d", &t);
    for (int i = 2; i <= 10; ++i)
        res[i][1] = 1;
    for (int i = 2; i <= 10; ++i)
        for (int j = 2; j <= 1000000; ++j)
            res[i][j] = res[i][j - 1] + f(j, i);
    for (int k = 1; k <= t; ++k)
    {
        int x, y;
        scanf("%d %d", &x, &y);
        printf("Case #%d: %lld\n", k, res[y][x]);
    }
    return 0;
}

//数位DP
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<math.h>

using namespace std;

typedef long long ll;

int i,j,k;

int n,t,m,b;

int x,y;

int res,cnt,temp,sum;

int cas=0;

int slove1(int temp, int n, int k)
{
    int res=0,cnt=1;
    for (int i=0; i<n; i++)
        cnt*=k;
    res=temp*cnt+cnt*n*(k-1)/2;
    return res;
}

int slove2(int temp, int n, int k)
{
    if(n<k)
    {
        int res=0;
        for(int i=0; i<=n; i++)
            res+=temp+i;
        return res;
    }
    int nn=n,cnt=1,res=0;
    int mm=0;
    while(nn>=k)
    {
        cnt*=k;
        mm++;
        nn/=k;
    }
    for(int i=0; i<nn; i++)
        res += slove1(temp+i,mm,k);
    res += slove2(temp+nn,n-nn*cnt,k);
    return res;
}

int main()
{
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d %d",&n,&b);
        printf("Case #%d: %d\n",++cas,slove2(0,n,b));
    }
    return 0;
}