CodeForces - 914C（DP+组合数）

链接：CodeForces - 914C

题目：

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 13₁₀ = 1101₂, 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 10⁹ + 7.

Input

The first line contains integer n (1 ≤ n < 2¹⁰⁰⁰).

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 10⁹ + 7.

Examples

input

110
2

output

3

input

111111011
2

output

169

题意：给出一个数n（二进制）和一个k，不大于n的数中，有几个数进行k次操作后变成1，操作：将其变成其二进制中1的个数。

题解：C(n, m) + C(n, m - 1) = C(n + 1, m)

#include<bits/stdc++.h>
using namespace std;

const int mod = 1e9 + 7;
const int maxn = 1e3 + 10;
char s[maxn];
int k, n;
int dp[maxn], f[maxn];

int main()
{
    scanf("%s", s + 1);
    scanf("%d", &k);

    if(k == 0) return puts("1") & 0;

    n = strlen(s + 1);
    for(int i = 2; i <= n; i++) f[i] = f[__builtin_popcount(i)] + 1;
    int pre = 0;
    for(int i = 1; i <= n; i++){
        for(int j = n; j >= 1; j--) dp[j] = (dp[j] + dp[j-1]) % mod;
        if(s[i] == '1') dp[pre]++;
        pre += s[i] - '0';
    }
    dp[pre]++;

    int ans = 0;
    for(int i = 1; i <= n; i++){
        if(f[i] == k - 1) ans = (ans + dp[i]) % mod;
    }
    if(k == 1) ans = (ans - 1 + mod) % mod;
    printf("%d\n", ans);

    return 0;
}