http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3962

题解：数位DP

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
ll t,n,m,k,q;
int ans,cnt,flag,temp;
int a[20];
int dig[20];
ll dp[20][100];
ll dfs(int pos,int sum,bool limit){
    if(pos<0)
        return sum;
    if(!limit&&dp[pos][sum]!=-1)
        return dp[pos][sum];
    int res=limit?dig[pos]:15;
    ll ans=0;
    for(int i=0;i<=res;i++){
        ans+=dfs(pos-1,sum+a[i],limit&&i==res);
    }
    if(!limit)
        dp[pos][sum]=ans;
    return ans;
}
ll sloved(ll x){
    for(int i=0;i<8;i++){
        dig[i]=x%16;
        x/=16;
    }
    return dfs(7,0,1);
}
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //
    memset(dp,-1,sizeof(dp));
    a[0]=6, a[1]=2, a[2]=5, a[3]=5;
    a[4]=4, a[5]=5, a[6]=6, a[7]=3;
    a[8]=7, a[9]=6, a[10]=6,a[11]=5;
    a[12]=4,a[13]=5,a[14]=5,a[15]=4;
    scanf("%d",&t);
    while(t--){
        scanf("%lld%llX",&n,&m);
        n--;
        ll l=m;
        ll r=l+n;
        if(r>4294967295ll){
            r%=4294967296ll;
            printf("%lld\n",sloved(4294967295ll)-sloved(l-1)+sloved(r));
        }else{
            printf("%lld\n",sloved(r)-sloved(l-1));
        }

    }


    //cout << "Hello world!" << endl;
    return 0;
}