The Preliminary Contest for ICPC Asia Shanghai 2019 Digit sum

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

#include<bits/stdc++.h>
#define endl '\n'
#define mem(a) memset(a,0,sizeof(a)
#define debug cout<<1<<endl
const long long inf=1e9;
using namespace std;
typedef long long ll;
const int N=1e6+5;
ll sum[11][N];
int main(){
    ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
    int t;
    for(int i=2;i<=10;i++){
        //cout<<i<<endl;
        for(int j=1;j<=1e6;j++){
            //cout<<j<<endl;
            ll ans=0;
            ll now=j;
            while(now){
                ans+=now%i;
                now/=i;
            }
            sum[i][j]=sum[i][j-1]+ans;
            //cout<<sum[i][j]<<endl;
        }
    }
    cin>>t;
    int cas=0;
    while(t--){
        ll n,b;
        cin>>n>>b;
        cout<<"Case #"<<++cas<<": "<<sum[b][n]-sum[b][0]<<endl;
    }
}