codeforces914c

C. Travelling Salesman and Special Numbers

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

The Travelling Salesman spends a lot of time travelling so he tends to get bored. To pass time, he likes to perform operations on numbers. One such operation is to take a positive integer x and reduce it to the number of bits set to 1 in the binary representation of x. For example for number 13 it's true that 1310 = 11012, so it has 3 bits set and 13 will be reduced to 3 in one operation.

He calls a number special if the minimum number of operations to reduce it to 1 is k.

He wants to find out how many special numbers exist which are not greater than n. Please help the Travelling Salesman, as he is about to reach his destination!

Since the answer can be large, output it modulo 109 + 7.

Input

The first line contains integer n (1 ≤ n < 21000).

The second line contains integer k (0 ≤ k ≤ 1000).

Note that n is given in its binary representation without any leading zeros.

Output

Output a single integer — the number of special numbers not greater than n, modulo 109 + 7.

Examples

input

110
2

output

3

input

111111011
2

output

169

思路：先预处理暴力求出1~1000的所有数几步操作可以转换为1，之后通过把原来为1 的位置0，后面位就可以随便取，找到opt[i]等于k-1的1的个数i，再利用组合数就可以了。

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
typedef long long ll;
#define MOD 1000000007
#define maxn 1010
int opt[maxn];
ll C[maxn][maxn];
void get_C(ll x)     //组合数初始化 
{
        C[0][0] = 1;
        for(int i=1;i<=x;i++)
        {
                C[i][0] = 1;
                for(int j=1;j<=i;j++)
                C[i][j] = (C[i-1][j]+C[i-1][j-1])%MOD;
        }
}
void init()
{
	memset(opt,-1,sizeof(opt));
	opt[1]=0;
	int tmp;
	for(int i=2;i<maxn;i++)
	{
		int cnt,op=0;
		tmp=i;
		while(opt[tmp]==-1)
		{
			op++;
			cnt=0;
			while(tmp)
			{
				if(tmp&1)cnt++;
				tmp>>=1;
			}
			tmp=cnt;
		}
		opt[i]=opt[tmp]+op;
	}
}
int main()
{
	init();
	get_C(maxn-1);
	char num[maxn];
	int len;
	int k;
	while(~scanf("%s%d",num,&k))
	{
		len=strlen(num);
		if(k==1)  //k=1时，1不能算 
		{
			printf("%d\n",len-1);
			continue;
		}
		ll ans=0;
		int cnt=0;
		for(int i=0;i<len;i++)
		{
			if(num[i]=='1')
			{
				for(int j=0;j<=len-1-i;j++)
				{
					if(opt[j+cnt]==k-1)
					{
						ans=(ans+C[len-1-i][j])%MOD;
					}
				}
				cnt++;
			}
		}
		if(opt[cnt]==k-1)
		{
			ans=(ans+1)%MOD;
		}
		printf("%I64d\n",ans);
	}
}