第六届acm河南省赛——Adjacent Bit Counts

题目链接：Adjacent Bit Counts

Adjacent Bit Counts

Time Limit: 1 Sec   Memory Limit: 128 MB
Submit: 53   Solved: 23

Submit Status Web Board

Description

For a string of n bits x1, x2, x3, …, xn,  the adjacent bit count of the string  is given by     fun(x) = x1*x2 + x2*x3 + x3*x 4 + … + xn-1*x n
which counts the number of times a 1 bit is adjacent to another 1 bit. For example:  
     Fun(011101101) = 3 
     Fun(111101101) = 4 
     Fun (010101010) = 0 
Write a program which takes as input integers n and p and returns the number of bit strings x of n bits (out of 2ⁿ) that satisfy  Fun(x) = p. 

For example, for 5 bit strings, there are 6 ways of getting fun(x) = 2: 
11100, 01110, 00111, 10111, 11101, 11011

Input

On the first line of the input is a single positive integer k, telling the number of test cases to follow. 1 ≤ k ≤ 10  Each case is a single line that contains  a decimal integer giving the number (n) of bits in the bit strings, followed by a single space, followed by a decimal integer (p) giving the desired adjacent bit count. 1 ≤ n , p ≤ 100

Output

For each test case, output a line with the number of n-bit strings with adjacent bit count equal to p.

Sample Input

2

5 2

20 8

Sample Output

6

63426

HINT

题意：一个01的串的值为相邻项两两乘积。问给定串的长度和值，有多少个符合条件的串。

题目分析：这个串的值只跟有多少个1挨着有关，因此可以设一个数组dp[2][n][p]分别代表末位为0和1的长度为n的01串中值为p的个数，因此最后输出的结果就是这两个值相加。基本到这后面就都差不多了。 ;

递推公式 dp[1][i][j]=dp[0][i-1][j]+dp[i-1][j-1]；分别代表原来长度i－1末位为0的串后面加个0与长度i－1值j－1且末位为1的串后面再加个1。

dp[0][i][j]=dp[0][i-1][j]+dp[1][i-1][j];这里只要前面i－1个数值为j，后面加0都不会影响其值的。

其他唯一需要注意的就是初始化了，要事先将dp[i][i－1]赋值为1，dp[0][1][0]为1，这两个都要加上。

#include <iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[2][111][111];

void init()
{
    dp[0][1][0]=1;
    for(int i=1;i<=100;i++)
    {
        dp[1][i][i-1]=1;
    }
    for(int i=2;i<=100;i++)
    {
        for(int j=0;j<i;j++)
        {
            dp[1][i][j]=dp[0][i-1][j]+dp[1][i-1][j-1];
            dp[0][i][j]=dp[0][i-1][j]+dp[1][i-1][j];
        }
    }
}

int main()
{
    memset(dp,0,sizeof(dp));
    init();
    int k,n,p;
    cin>>k;
    while(k--)
    {
        cin>>n>>p;
        long long int ans=dp[0][n][p]+dp[1][n][p];
        cout<<ans<<endl;
    }
}