E. Salazar Slytherin‘s Locket

和上一道题目很类似，也是状压 + 数位一下

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int,int>;
#define int long long
const int N = 1e5+10;
const int inf = 0x3f3f3f3f;
const int mod = 1e9+7;
int gcd(int a,int b){return b?gcd(b,a%b):a;}
int lcm(int a,int b){return a*b/gcd(a,b);}
int qmi(int a,int b,int mod){int res=1;while(b){if(b&1)res=res*a%mod;b>>=1;a=a*a%mod;}return res;}


int n,q,m,b;
int a[N];
int dp[145][1<<10][12];
//1024*10*35
//
// int e[N],ne[N],w[N],h[N],idx;
// void add(int a,int b,int c){
	// e[idx] = b,ne[idx] = h[a],w[idx] = c,h[a] = idx++;
// }


int dfs(int len,int st,int limit,int lead){
	if(!len)return (st==0);
	if(!limit&&!lead&&~dp[len][st][b])return dp[len][st][b];
	int up = limit?a[len]:b-1;
	int res = 0;
	for(int i=0;i<=up;++i){
		if(!i&&lead)res+=dfs(len-1,st,limit&&i==up,lead&&i==0);
		else res+=dfs(len-1,st^(1<<i),limit&&i==up,lead&&i==0);
	}
	
	if(!limit&&!lead)return dp[len][st][b] = res;
	return res;
	
}



int cal(int x){
	int len = 0;
	while(x)a[++len] = x%b,x/=b;
	
	return dfs(len,0,1,1);
	
}

void solve()
{
	memset(dp,-1,sizeof dp);
	cin>>q;
	while(q--){
		int l,r;
		cin>>b>>l>>r;
		cout<<cal(r)-cal(l-1)<<"\n";
	}
}

signed main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int _;
	//cin>>_;
	_ = 1;
	while(_--)solve();
	return 0;
}