Balanced Numbers （数位dp+3进制状压）

https://cn.vjudge.net/contest/312854#problem/H

Balanced numbers have been used by mathematicians for centuries. A positive integer is considered a balanced number if:

1)      Every even digit appears an odd number of times in its decimal representation

2)      Every odd digit appears an even number of times in its decimal representation

For example, 77, 211, 6222 and 112334445555677 are balanced numbers while 351, 21, and 662 are not.

Given an interval [A, B], your task is to find the amount of balanced numbers in [A, B] where both A and B are included.

Input

The first line contains an integer T representing the number of test cases.

A test case consists of two numbers A and B separated by a single space representing the interval. You may assume that 1 <= A <= B <= 1019 

Output

For each test case, you need to write a number in a single line: the amount of balanced numbers in the corresponding interval

Example

Input:
2
1 1000
1 9

Output:
147
4

题意：

给你一个范围[A,B],让你判断范围内所有数是否为平衡数，是平衡数的条件为：

1、对于每一位上的数字，如果是偶数，则必须出现奇数次。

2、对于每一位上的数字，如果是奇数，则必须出现偶数次。

 

sta记录每个数字出现次数的情况，0表示没出现，1表示出现了奇数次，2表示出现了偶数次

3^10

#include<bits/stdc++.h>
#pragma GCC optimize(3)
#define max(a,b) a>b?a:b
using namespace std;
typedef long long ll;
ll dp[21][60000];
int judge(int x){
	int b;
	for(int i=0;i<=9;i++){
		b=x%3;
		x/=3;
		if((i&1)==1&&b==1) return 0;
		else if((i&1)==0&&b==2) return 0;
	}
	return 1;
}
int a[21];
int get_sta(int sta,int x){
	int b[10];
	for(int i=0;i<=9;i++){
		b[i]=sta%3;
		sta/=3;
	}
	if(b[x]&1) b[x]=2;
	else b[x]=1;
	sta=0;
	for(int i=9;i>=0;i--)
		sta=sta*3+b[i];
	return sta;
}
ll dfs(int pos,int sta,bool lead,bool limit){
	if(pos==0) return judge(sta);
	if(!lead&&!limit&&dp[pos][sta]!=-1) return dp[pos][sta];
	int up=limit?a[pos]:9;
	ll ans=0;
	for(int i=0;i<=up;i++){
		if(i==0){
			if(lead) ans+=dfs(pos-1,sta,true,limit&&i==up);
			else ans+=dfs(pos-1,get_sta(sta,i),false,limit&&i==up);
		}
		else ans+=dfs(pos-1,get_sta(sta,i),false,limit&&i==up);
	}
	if(!lead&&!limit) dp[pos][sta]=ans;
	return ans;
}
ll solve(ll x){
	int pos=0;
	while(x){
		a[++pos]=x%10;
		x/=10;
	}
	return dfs(pos,0,true,true);
}
int main(){
	ios::sync_with_stdio(false);
    cout.tie(NULL);
    memset(dp,-1,sizeof(dp));
	int T;
	scanf("%d",&T);
	while(T--){
		ll a,b;
		scanf("%lld%lld",&a,&b);
		printf("%lld\n",solve(b)-solve(a-1));
	} 
	return 0;
}