题目描述
时间限制:1秒
如果一个数中只有少于三个数字是非零的,那么我们称这个数为优美数,我们定义这个优美数的优美程度为这个数所有数字相加的和。 例如优美数有4,200000,10203,其中4的优美度是4,200000的优美度是2,10203的优美度是6. 数字4231,102306,7277420000,就不是啰。
现在问在【L,R】中,有多少个优美度为x的优美数。
输入输出格式
输入格式:
T组数据,T<=5e4. 第一行为组数T。 接下来T行,每组输入L,R,x。1<=L <= R <= 3e18;
输出格式:
每行输出一个对应的答案
输入输出样例
输入样例#1:
4
1 1000 1
1024 1024 7
65536 65536 15
1 1000000000 20
输出样例#1:
4
1
0
3024
题解一 (dfs预处理)
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
vector<LL> vc[30]; //最多为27
//set<int> st;
int calc(LL x)
{
int res = 0;
while (x > 0){
res += x % 10;
x /= 10;
}
return res;
}
void DFS(LL x,int cur,int num)
{
if (cur > 19 || num > 3)
return ;
if (num <= 3){
int tmp = calc(x);
vc[tmp].push_back(x);
// st.insert(tmp);
}
for (int i = 0; i <= 9; i++){
if (i == 0)
DFS(x * 10,cur + 1,num);
else
DFS(x * 10 + i,cur + 1,num + 1);
}
return ;
}
int find1(LL x,int num) //找到下界
{
int left = 0,right = vc[num].size() - 1;
int res = right + 1;
while (left <= right){
int mid = (left + right) >> 1;
if (vc[num][mid] < x)
left = mid + 1;
else{
res = mid;
right = mid - 1;
}
}
return res;
}
int find2(LL x, int num) //找到上界
{
int left = 0,right = vc[num].size() - 1;
int res = 0;
while (left <= right){
int mid = (left + right) >> 1;
if (vc[num][mid] > x)
right = mid - 1;
else{
left = mid + 1;
res = mid;
}
}
return res;
}
int main()
{
// freopen("data.in","r", stdin);
// freopen("output.out","w",stdout);
for (int i = 1; i <= 9; i++)
DFS(i,1,1);
for (int k = 0; k < 28; k++)
sort(vc[k].begin(),vc[k].end());
LL L,R;
int t,X;
scanf("%d",&t);
while (t--){
scanf("%I64d %I64d %d",&L,&R,&X);
if (X > 27)
printf("0\n");
else if (L < R){
int t1 = find1(L,X);
int t2 = find2(R,X);
printf("%d\n",t2 - t1 + 1);
}
else if (calc(L) == X)
printf("1\n");
else
printf("0\n");
}
return 0;
}
题解二(数位DP)
#include <bits/stdc++.h>
using namespace std;
#define se second
#define fi first
#define ll long long
#define Pii pair<int,int>
#define Pli pair<ll,int>
#define ull unsigned long long
#define pb push_back
const int N=1e4+10;
const int INF=0x3f3f3f3f;
const int mod=1e9+7;
using namespace std;
int a[30];
ll dp[20][30][4][30];
int k;
ll dfs(int pos,int now,int num,bool limit){
if(num > 3) return 0;
if(pos==-1) return now == k;
if(!limit && dp[pos][now][num][k]!=-1) return dp[pos][now][num][k];
int up=limit?a[pos]:9;
ll ans=0;
for(int i=0;i<=up&&now+i<=k;++i){
ans+=dfs(pos-1,now+i,num+(i!=0),limit&&i==a[pos]);
}
if(!limit) dp[pos][now][num][k]=ans;
return ans;
}
ll solve(ll x){
int pos=0;
if(x==0)return 0;
while(x){
a[pos++]=x%10;
x/=10;
}
return dfs(pos-1,0,0,1);
}
int main(){
// freopen("data1.in", "r", stdin);
// freopen("ac.out", "w", stdout);
memset(dp,-1,sizeof(dp));
int T;scanf("%d",&T);
while(T--){
ll l,r;
scanf("%I64d%I64d%d",&l,&r,&k);
if(k>27)printf("0\n");
else printf("%I64d\n",solve(r)-solve(l-1));
}
return 0;
}