Manthan, Codefest 17 E. Salazar Slytherin's Locket（数位DP）

最新推荐文章于 2018-05-13 15:21:14 发布

原创最新推荐文章于 2018-05-13 15:21:14 发布 · 944 阅读

1 ·

本内容遵循CC 4.0 BY-SA版权协议

弱鸡的DP之路专栏收录该内容

46 篇文章

订阅专栏

本文介绍了一个基于数位动态规划（DP）的方法来解决一个特定的问题：在给定的范围内找出符合特定条件（每个数字出现次数为偶数次）的数字数量。通过详细解释算法的设计思路和实现细节，包括状态定义、转移方程等，帮助读者理解如何高效地求解此类问题。

Harry came to know from Dumbledore that Salazar Slytherin's locket is a horcrux. This locket was present earlier at 12 Grimmauld Place, the home of Sirius Black's mother. It was stolen from there and is now present in the Ministry of Magic in the office of Dolorous Umbridge, Harry's former Defense Against the Dark Arts teacher.

Harry, Ron and Hermione are infiltrating the Ministry. Upon reaching Umbridge's office, they observed a code lock with a puzzle asking them to calculate count of magic numbers between two integers l and r (both inclusive).

Harry remembered from his detention time with Umbridge that she defined a magic number as a number which when converted to a given baseb, all the digits from 0 to b - 1 appear even number of times in its representation without any leading zeros.

You have to answer q queries to unlock the office. Each query has three integers bi, li and ri, the base and the range for which you have to find the count of magic numbers.

Input

First line of input contains q (1 ≤ q ≤ 105) — number of queries.

Each of the next q lines contain three space separated integers bi, li, ri (2 ≤ bi ≤ 10, 1 ≤ li ≤ ri ≤ 1018).

Output

You have to output q lines, each containing a single integer, the answer to the corresponding query.

Examples

input
2
2 4 9
3 1 10

output
1
2

input
2
2 1 100
5 1 100

output
21
4

题意：给你b,l,r，问你l到r在b进制中有多少个数是每一个数字都是偶数个。

看题意和数字范围很明显可以看出是数位dp：

dp[b][len][c0][c1]....[s] 表示b进制下选到第len位每一位数字是奇数还是偶数个（我是保存了从0到9这10个数字），s表示当前是不是所有位都是偶数。

转移也相当简单当前位选哪一个数，c[i]就异或一个1，dfs回来的时候记得再把1再异或一次，每次判断s是1还是0

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#define inf 1e9
#define endl '\n'
#define LL long long

using namespace std;

LL dp[12][70][2][2][2][2][2][2][2][2][2][2][2];
int a[70];

bool judge(int *t)
{
    for(int i=0;i<10;i++)
    {
        if(t[i] == 1)
            return false;
    }

    return true;
}

LL dfs(int b,int len,int qd,int s,int fp,int *c)
{
    if(!len)
        return s == 1;
    if(!fp && qd == 0 && dp[b][len][c[0]][c[1]][c[2]][c[3]][c[4]][c[5]][c[6]][c[7]][c[8]][c[9]][s] != -1)
        return dp[b][len][c[0]][c[1]][c[2]][c[3]][c[4]][c[5]][c[6]][c[7]][c[8]][c[9]][s];
    int n = fp ? a[len]:(b-1);
    LL res = 0;
    for(int i=0;i<=n;i++)
    {
        if(i == 0 && qd == 1)
        {
            res += dfs(b,len-1,1,s,fp&&i==n,c);
        }
        else
        {
            c[i] ^= 1;
            int ts;
            if(judge(c))
                ts = 1;
            else
                ts = 0;
            res += dfs(b,len-1,0,ts,fp&&i==n,c);
            c[i] ^= 1;
        }
    }
    if(!fp && qd == 0)
        dp[b][len][c[0]][c[1]][c[2]][c[3]][c[4]][c[5]][c[6]][c[7]][c[8]][c[9]][s] = res;
    return res;
}
LL sum(LL x,int b)
{
    int len = 0;
    int t[12];
    memset(t,0,sizeof(t));
    while(x)
    {
        a[++len] = x % b;
        x /= b;
    }

    return dfs(b,len,1,0,1,t);
}

int main(void)
{
    int T;
    scanf("%d",&T);
    memset(dp,-1,sizeof(dp));
    while(T--)
    {
        int b;
        LL l,r;
        scanf("%d%I64d%I64d",&b,&l,&r);
        LL ans = sum(r,b) - sum(l-1,b);
        printf("%I64d\n",ans);
    }

    return 0;
}