Problem Description

#define xhxj (Xin Hang senior sister(学姐))
If you do
not know xhxj, then carefully reading the entire description is very
important.
As the strongest fighting force in UESTC, xhxj grew up in Jintang,
a border town of Chengdu.
Like many god cattles, xhxj has a legendary life:

2010.04, had not yet begun to learn the algorithm, xhxj won the second prize
in the university contest. And in this fall, xhxj got one gold medal and one
silver medal of regional contest. In the next year's summer, xhxj was invited to
Beijing to attend the astar onsite. A few months later, xhxj got two gold medals
and was also qualified for world's final. However, xhxj was defeated by
zhymaoiing in the competition that determined who would go to the world's
final(there is only one team for every university to send to the world's final)
.Now, xhxj is much more stronger than ever，and she will go to the dreaming
country to compete in TCO final.
As you see, xhxj always keeps a short
hair(reasons unknown), so she looks like a boy( I will not tell you she is
actually a lovely girl), wearing yellow T-shirt. When she is not talking, her
round face feels very lovely, attracting others to touch her face gently。Unlike
God Luo's, another UESTC god cattle who has cool and noble charm, xhxj is quite
approachable, lively, clever. On the other hand,xhxj is very sensitive to the
beautiful properties, "this problem has a very good properties"，she always said
that after ACing a very hard problem. She often helps in finding solutions, even
though she is not good at the problems of that type.
Xhxj loves many games
such as，Dota, ocg, mahjong, Starcraft 2, Diablo 3.etc，if you can beat her in any
game above, you will get her admire and become a god cattle. She is very
concerned with her younger schoolfellows, if she saw someone on a DOTA platform,
she would say: "Why do not you go to improve your programming skill". When she
receives sincere compliments from others, she would say modestly: "Please don’t
flatter at me.(Please don't black)."As she will graduate after no more than one
year, xhxj also wants to fall in love. However, the man in her dreams has not
yet appeared, so she now prefers girls.
Another hobby of xhxj is
yy(speculation) some magical problems to discover the special properties. For
example, when she see a number, she would think whether the digits of a number
are strictly increasing. If you consider the number as a string and can get a
longest strictly increasing subsequence the length of which is equal to k, the
power of this number is k.. It is very simple to determine a single number’s
power, but is it also easy to solve this problem with the numbers within an
interval? xhxj has a little tired，she want a god cattle to help her solve this
problem,the problem is: Determine how many numbers have the power value k in
[L，R] in O(1)time.
For the first one to solve this problem，xhxj will upgrade
20 favorability rate。

 

Input

First a integer T(T<=10000),then T lines follow,
every line has three positive integer
L,R,K.(0<L<=R<2⁶³-1 and 1<=K<=10).

 

Output

For each query, print "Case #t: ans" in a line, in
which t is the number of the test case starting from 1 and ans is the
answer.

 

Sample Input

 

Sample Output

#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

int K;

int dig[];

ll dp[][<<][];

ll getNewSta(ll sta,int num) //运用LIS问题的nlogn思想进行更新状态

{

    for(int i=num;i<=;i++)

        if(sta&(<<i)) return (sta^(<<i))|(<<num);

    return sta|(<<num);

}

int get1cnt(ll sta) //获取状态sta中有多少个“1”

{

    int cnt=;

    while(sta)

    {

        cnt+=sta&;

        sta>>=;

    }

    return cnt;

}

ll dfs(int pos,ll sta,bool lead,bool limit) //lead是前导零标记

{

    if(pos==) return get1cnt(sta)==K; //精确到某一个数，判断其LIS的长度是否等于K

    if(!limit && dp[pos][sta][K]!=-) return dp[pos][sta][K];

    int up=limit?dig[pos]:;

    ll ans=;

    for(int i=;i<=up;i++)

        ans+=dfs(pos-,(lead && i==)?:getNewSta(sta,i),lead && i==,limit && i==up);

    if(!limit) dp[pos][sta][K]=ans;

    return ans;

}

ll solve(ll x)

{

    int len=;

    while(x)

    {

        dig[++len]=x%;

        x/=;

    }

    return dfs(len,,,);

}

int main()

{

    int T;

    scanf("%d",&T);

    memset(dp,-,sizeof(dp));

    for(int kase=;kase<=T;kase++)

    {

        ll L,R;

        scanf("%I64d%I64d%d",&L,&R,&K);

        printf("Case #%d: %I64d\n",kase,solve(R)-solve(L-));

    }

}