题目来源:http://acm.hdu.edu.cn/showproblem.php?pid=2604
有n个人排队,f表示女,m表示男,形成的2^n个队列中,问不包含子串‘fmf’和‘fff’的队列都少个?
我们令f(n)表示满足条件的队列个数,已知f(0) = 0, f(1) = 2, f(2) = 4, f(3) = 6, f(4) = 9;
如果队列是以'm'结尾,那么前n-1个人可以任意排列,等于f(n-1);如果队列是以'f'结尾,如果是'f',则考虑后两位mf和ff,无法推知是否满足状态,所以继续向前考虑一个人,则有:mmf, fmf, mff, fff四种状态,其中fmf和fff不符合条件,如果是mmf,则前n-3种可以任意排列,有f(n-3)种,如果是mff,则继续往前考虑一位,如果是fmff不符合条件,如果是mmff,前n-4可以任意排列,有f(n-4)种。则推出递推公式:f(n)=f(n-1)+f(n-3)+f(n-4);
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 4;
int iMod;
struct Matrix
{
int iMatrix[4][4];
};
Matrix iPer, iCell;
void Inite_Matrix()
{
memset(iPer.iMatrix, 0, sizeof(iPer.iMatrix));
memset(iCell.iMatrix, 0, sizeof(iCell.iMatrix));
iPer.iMatrix[0][0] = iPer.iMatrix[1][1] = iPer.iMatrix[2][2] = iPer.iMatrix[3][3] = 1;
iCell.iMatrix[0][0] = iCell.iMatrix[0][1] = iCell.iMatrix[1][2] = iCell.iMatrix[2][0] = iCell.iMatrix[2][3] = iCell.iMatrix[3][0] = 1;
}
Matrix Multi_Matrix(Matrix a, Matrix b)
{
Matrix c;
int i, j, k;
for(i = 0; i < 4; ++i)
{
for(j = 0; j < 4; ++j)
{
c.iMatrix[i][j] = 0;
for(k = 0; k < 4; ++k)
{
c.iMatrix[i][j] = ( c.iMatrix[i][j] + a.iMatrix[i][k] * b.iMatrix[k][j])%iMod;
}
}
}
return c;
}
Matrix Quick_Mod_Matrix(int k)
{
if(k == 1)
return iCell;
Matrix c, tmp;
c = iPer, tmp = iCell;
while(k)
{
if(k&1)
{
c = Multi_Matrix(c, tmp);
k--;
}
k >>= 1;
tmp = Multi_Matrix(tmp, tmp);
}
return c;
}
int main()
{
Matrix c;
Inite_Matrix();
int n, sum, i;
int arr[5] = {9, 6, 4, 2, 0};
while(~scanf("%d %d", &n, &iMod))
{
if(n <= 4)
{
printf("%d\n", arr[4-n]%iMod);
continue ;
}
c = Quick_Mod_Matrix(n-4);
sum = 0;
for(i = 0; i < 4; ++i)
sum = (sum + (arr[i] * c.iMatrix[i][0])%iMod)%iMod;
printf("%d\n", sum);
}
return 0;
}