南阳oj715_Adjacent Bit Counts

Adjacent Bit Counts

时间限制： 1000 ms  |  内存限制： 65535 KB

难度： 4

描述

For a string of n bits x1, x2, x3, …, xn,  the adjacent bit count of the string  is given by     fun(x) = x₁*x₂ + x₂*x₃ + x₃*x ₄ + … + x_n-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

输入

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

输出

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

思路：动态规划类问题，dp[i][j][1]表示有i位数时fun（i）=j,并且最后一位为1，dp[i][j][0]表示有i位数时fun（i）=j,并且最后一位为0。

状态转移方程：dp[i][j][1]=dp[i-1][j-1][1]+dp[i-1][j][0],   dp[i][j][0]=dp[i-1][j][1]+dp[i-1][j][0];

当j为0时  dp[i][0][1]=dp[i-1][0][0]; dp[i][0][0]=dp[i-1][0][1]+dp[i-1][0][0];

答案 dp[n][p][1]+dp[n][p][0];

#include<stdio.h>
int dp[110][110][2];
int main()
{
	int t,n,res,p,i,j;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%d%d",&n,&p);
		dp[2][1][1]=1;
		dp[2][0][1]=1;
		dp[2][0][0]=2;
		for(i=3;i<=n;i++)
			for(j=0;j<=i;j++)
			{
				if(j==0)
				{
					dp[i][0][1]=dp[i-1][0][0];
					dp[i][0][0]=dp[i-1][0][1]+dp[i-1][0][0];
				}
				dp[i][j][1]=dp[i-1][j-1][1]+dp[i-1][j][0];
				dp[i][j][0]=dp[i-1][j][1]+dp[i-1][j][0];
			}
		res=dp[n][p][1]+dp[n][p][0];
		printf("%d\n",res);
	}
	return 0;
}