Codeforces Round #247 (Div. 2) D Random Task

。。二分加数位dp、、没有想到二分。看了题解做出来的

dp[i][j]   //前i位1的个数为j的个数

#include<iostream>
#include<sstream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<stack>
#include<math.h>
#include<map>
#include<time.h>
#include<set>
#include<string>
#include<vector>
#include<algorithm>
using namespace std;
#define inf 0x7fffffff
#define lc l,m,index<<1
#define rc m+1,r,index<<1|1
#define max_n 200005
#define mod 1000000007
#define LL  __int64
LL m;
int k;
int bit[100];
LL dp[100][150];
LL dfs(int len,int sum,bool limit)
{
    if(len==0) return sum==k;
    if(!limit && dp[len][sum]!=-1) return dp[len][sum];
    int end=limit?bit[len]:1;
    LL res=0;
    for(int i=0;i<=end;i++)
    {
        res+=dfs(len-1,sum+i,limit && i==end);
    }
    return limit?res:dp[len][sum]=res;
}
LL cal(LL x)
{
    int len=0;
    memset(dp,-1,sizeof(dp));
    while(x)
    {
        bit[++len]=x%2;
        x/=2;
    }
    return dfs(len,0,1);
}
int main()
{
    while(~scanf("%I64d%d",&m,&k))
    {
        LL l=1,r=1e18;
        LL mid;
        while(1)
        {
            mid=(l+r)>>1;
            LL dis=cal(mid*2)-cal(mid);
           // printf("%I64d\n",dis);
            if(dis==m)
            break;
            if(dis>m)r=mid;
            else l=mid+1;
        }
        printf("%I64d\n",mid);
    }
    return 0;
}