BALNUM - Balanced Numbers

Time limit：123 ms

Memory limit：1572864 kB

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 <= 10¹⁹

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
分析：如何统计0~9是否出现过且是否出现奇偶次是难点；
　　　正解是三进制压缩，该位置为0代表没出现，1代表出现奇数次，2代表出现偶数次；
　　　不过一看内存这么大，可以随便做了，dp[i][j][k]分别代表位置，二进制判是否出现，二进制判每个数出现次数奇偶性；
　　　注意前导0不算；
代码：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <bitset>
#include <map>
#include <queue>
#include <stack>
#include <vector>
#define rep(i,m,n) for(i=m;i<=n;i++)
#define mod 1000000007
#define inf 0x3f3f3f3f
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define ll long long
#define pi acos(-1.0)
#define pii pair<int,int>
#define sys system("pause")
const int maxn=1e5+;
const int N=5e4+;
const int M=N**;
using namespace std;
inline ll gcd(ll p,ll q){return q==?p:gcd(q,p%q);}
inline ll qpow(ll p,ll q){ll f=;while(q){if(q&)f=f*p;p=p*p;q>>=;}return f;}
inline void umax(ll &p,ll q){if(p<q)p=q;}
inline void umin(ll &p,ll q){if(p>q)p=q;}
inline ll read()
{
    ll x=;int f=;char ch=getchar();
    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
    return x*f;
}
int n,m,k,t,num[],pos;
ll dp[][<<][<<],p,q;
ll dfs(int pos,int x,int y,int z,int k)
{
    if(pos<)
    {
        int i;
        rep(i,,)if(x>>i&&&(y>>i&)^(i&)!=)return ;
        return ;
    }
    if(z&&k&&dp[pos][x][y]!=-)return dp[pos][x][y];
    int now=z?:num[pos],i;
    ll ret=;
    rep(i,,now)
    {
        ret+=dfs(pos-,!i&&!k?x:x|(<<i),!i&&!k?y:y^(<<i),z||i<num[pos],k||i);
    }
    return z&&k?dp[pos][x][y]=ret:ret;
}
ll gao(ll x)
{
    pos=;
    while(x)num[pos++]=x%,x/=;
    return dfs(pos-,,,,);
}
int main()
{
    int i,j;
    memset(dp,-,sizeof(dp));
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lld%lld",&p,&q);
        printf("%lld\n",gao(q)-gao(p-));
    }
    return ;
}