Manthan, Codefest 17 E. Salazar Slytherin's Locket 数位DP+状态压缩

E. Salazar Slytherin's Locket

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 base b, 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

Note

In sample test case 1, for first query, when we convert numbers 4 to 9 into base 2, we get:

• 4 = 1002,
• 5 = 1012,
• 6 = 1102,
• 7 = 1112,
• 8 = 10002,
• 9 = 10012.

Out of these, only base 2 representation of 9 has even number of 1 and 0. Thus, the answer is 1.

求[l,r]之间，满足b进制下每个数字都出现偶数次的数有多少个。

把每位数字出现的次数的奇偶性用0,1表示，则数位DP当中，可以把状态这样设定：

dp[len][b][con]表示长度还剩下len,进制为b,数字出现奇偶性为con的情况下，满足题目要求的数字的个数。

接着就套套数位DP的模板，逐位DP即可。

因为进制不超过10，所有的con不超过10^2=1024.

#include <cstdio>
#include <iostream>
#include <string.h>
#include <string> 
#include <map>
#include <queue>
#include <vector>
#include <set>
#include <algorithm>
#include <math.h>
#include <cmath>
#include <stack>
#include <iomanip>
#define mem0(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,0x3f,sizeof(a))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
const int inf = 0x3f3f3f3f;
const ll llinf = 0x3f3f3f3f3f3f3f3f;
const ld pi = acos(-1.0L);
ll dp[64][11][2048];
ll num[100];

ll dfs(int len, int b, int con, bool zero, bool HaveLimit) {
	if (len == 0)
		return con == 0 && !zero;
	if (dp[len][b][con] != -1 && !HaveLimit&&!zero)
		return dp[len][b][con];

	int p = HaveLimit ? num[len] : b - 1;
	ll ans = 0;
	for (int i = 0; i <= p; i++) {
		if (zero&&i == 0)
			ans += dfs(len - 1, b, con, 1, HaveLimit&&i == num[len]);
		else
			ans += dfs(len - 1, b, con ^ (1 << i), 0, HaveLimit&&i == num[len]);
	}
	if (!HaveLimit&&!zero)
		dp[len][b][con] = ans;
	return ans;
}

ll solve(ll n, ll b) {
	if (n == 0) return 0;
	int len = 0, i;
	ll k = n;
	while (k) {
		num[++len] = k % b;
		k /= b;
	}
	ll ans = 0;
	ans = dfs(len, (int)b, 0, 1, 1);
	return ans;
}

int main() {
	int cas;
	scanf("%d", &cas);
	ll l, r, ans, b;
	memset(dp, -1, sizeof(dp));
	while (cas--) {
		scanf("%I64d%I64d%I64d", &b, &l, &r);
		ans = solve(r, b) - solve(l - 1, b);
		printf("%I64d\n", ans);
	}
//	system("pause");
	return 0;
}