codeforces 914c Travelling Salesman and Special Numbers

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

Copy

110
2

output

3

input

Copy

111111011
2

output

169

Note

In the first sample, the three special numbers are 3, 5 and 6. They get reduced to 2 in one operation (since there are two set bits in each of 3, 5 and 6) and then to 1 in one more operation (since there is only one set bit in 2).

题意：问1-n以内所有进行k次操作后变成1的数字有多少个

操作：while(1)if(i==1) return;else i=__builtin_popcount(i),cnt++;

解法：暴力算出1-1000以内所有数字的操作次数，然后数位dp，我们枚举n的每一位，之后再枚举前面1的个数，乘上组合数转移即可

ans+=∑ni=mCi−mn−pos⋅[dp[i]==k−1]

还有一个问题，就是为什么我们只考虑某一位变成0后面的随意改变的情况。这是因为，这一位是1的情况我们在对这位之前的东西进行求解的时候已经处理过了。

还有三个特例需要注意： 
如果1的位数的dp值恰是k−1，那么结果还要加1。这是因为我们在枚举的时候已经忽略的第一位的情况，所以现在要再考虑进来。 
如果k=0，那么结果是0，因为1不在答案里。 
如果k=1，那么结果要-1，也是因为1不在答案里。

代码：

#include <stdio.h>
#include <string.h>
#define ll long long
ll n,k,c[1005][1005],dp[1005],cnt,ans;
char s[1005];
int main()
{
	scanf("%s%I64d",s,&k);
	if(!k) return puts("1"),0;
	for(int i=1;i<=1000;i++)
	c[i][i]=c[i][0]=1;
	for(int i=1;i<=1000;i++)
	for(int j=1;j<i;j++)
	c[i][j]=(c[i-1][j]+c[i-1][j-1])%1000000007;
	for(int i=2;i<=1000;i++) dp[i]=dp[__builtin_popcount(i)]+1;
	n=strlen(s);
	for(int i=0;i<n;i++)
	{
		if(s[i]=='0') continue;
		for(int j=(cnt?cnt:1);j<n;j++) 
		if(dp[j]==k-1)
		ans=(ans+c[n-1-i][j-cnt])%1000000007;
		cnt++;
	}
	if(k==1) ans--;
	if(dp[cnt]==k-1) ans=(ans+1)%1000000007;
	printf("%I64d\n",ans);
}