2019上海icpc网络赛签到L

L  Digit sum

队友的ACcode:

#include<iostream>
#include<cstring>
#define maxn 1000010
using namespace std;
int a2[maxn],a3[maxn],a4[maxn],a5[maxn],a6[maxn],a7[maxn],a8[maxn],a9[maxn],a10[maxn];
int init() {
	memset(a2,0,sizeof(a2));
	memset(a3,0,sizeof(a3));
	memset(a4,0,sizeof(a4));
	memset(a5,0,sizeof(a5));
	memset(a6,0,sizeof(a6));
	memset(a7,0,sizeof(a7));
	memset(a8,0,sizeof(a8));
	memset(a9,0,sizeof(a9));
	memset(a10,0,sizeof(a10));
    for(int i=1; i<=maxn; i++) {
        a2[i]=a2[i>>1]+i%2;
        a3[i]=a3[i/3]+i%3;
        a4[i]=a4[i/4]+i%4;
        a5[i]=a5[i/5]+i%5;
        a6[i]=a6[i/6]+i%6;
        a7[i]=a7[i/7]+i%7;
        a8[i]=a8[i/8]+i%8;
        a9[i]=a9[i/9]+i%9;
        a10[i]=a10[i/10]+i%10;
    }
    for(int i=1; i<=maxn; i++) {
        a2[i]+=a2[i-1];
        a3[i]+=a3[i-1];
        a4[i]+=a4[i-1];
        a5[i]+=a5[i-1];
        a6[i]+=a6[i-1];
        a7[i]+=a7[i-1];
        a8[i]+=a8[i-1];
        a9[i]+=a9[i-1];
        a10[i]+=a10[i-1];
    }
	
}

int main() {
	init();
	int T;
	cin>>T;
	for(int i=1;i<=T;i++) {
		int n,b;
		cin>>n>>b;
		if(b==2) {
			cout<<"Case #"<<i<<": "<< a2[n] <<endl;
		}
		if(b==3) {
			cout<<"Case #"<<i<<": "<< a3[n] <<endl;
		}
		if(b==4) {
			cout<<"Case #"<<i<<": "<< a4[n] <<endl;
		}
		if(b==5) {
			cout<<"Case #"<<i<<": "<< a5[n] <<endl;
		}
		if(b==6) {
			cout<<"Case #"<<i<<": "<< a6[n] <<endl;
		}
		if(b==7) {
			cout<<"Case #"<<i<<": "<< a7[n] <<endl;
		}
		if(b==8) {
			cout<<"Case #"<<i<<": "<< a8[n] <<endl;
		}
		if(b==9) {
			cout<<"Case #"<<i<<": "<< a9[n] <<endl;
		}
		if(b==10) {
			cout<<"Case #"<<i<<": "<< a10[n] <<endl;
		}
	}
	
	return 0;
}

就是一个打表，之前好像不知道 计算每一位相加可以用数组这样写，听队友一讲，真妙呀！完美利用下标！