Ural 1057. Amount of Degrees

最新推荐文章于 2018-09-07 19:37:51 发布

XTU_wcb

最新推荐文章于 2018-09-07 19:37:51 发布

阅读量385

点赞数

分类专栏：数位dp

本文链接：https://blog.csdn.net/u013023344/article/details/38559101

版权

数位dp 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

Create a code to determine the amount of integers, lying in the set [ X; Y] and being a sum of exactly K different integer degrees of B.

Example. Let X=15, Y=20, K=2, B=2. By this example 3 numbers are the sum of exactly two integer degrees of number 2:

17 = 2 ⁴+2 ⁰,
18 = 2 ⁴+2 ¹,
20 = 2 ⁴+2 ².

Input

The first line of input contains integers X and Y, separated with a space (1 ≤ X ≤ Y ≤ 2 ³¹−1). The next two lines contain integers K and B (1 ≤ K ≤ 20;2 ≤ B ≤ 10).

Output

Output should contain a single integer — the amount of integers, lying between X and Y, being a sum of exactly K different integer degrees of B.

Sample

input	output
15 20 2 2	3

题目大意：在X~Y区间找出由K个B的幂组成的数的个数，幂的系数为1。
分析：X~Y区间B进制数仅含K个1，且其他位为0的数的个数。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<queue>
using namespace std;
typedef long long LL;
int sum[34];
int dp[34][34];
int x,y,k,b;
int dfs(int pos, int num, bool limit)
{
    if(pos<=0) return num==k;
    if(num>k) return 0;
    if(!limit && dp[pos][num]!=-1) return dp[pos][num];
    int end=limit?(sum[pos]?1:0):1;
    int ans=0;
    for(int i=0;i<=end;i++)
        ans+=dfs(pos-1,num+i,limit&&i==sum[pos]);
    if(!limit) dp[pos][num]=ans;
    return ans;
}
int wcb(int n)
{
    int p=0;
    while(n)
    {
        sum[++p]=n%b;
        n/=b;
    }
    return dfs(p,0,true);
}
int main()
{
    int i,j;
    while(scanf("%d%d%d%d",&x,&y,&k,&b)==4)
    {
        memset(dp,-1,sizeof(dp));
        printf("%d\n",wcb(y)-wcb(x-1));
    }
}