Codeforces Round #307 (Div. 2)

D. GukiZ and Binary Operations
寻找数组长度为n的数组个数，满足(a[1]&a[2])|(a[2]&a[3])|…|(a[n-1]&a[n])=k。且a[i]<$2^l$。答案模m输出
解法：对每一位元素分别考虑。若该位是0，则a数组满足任意两个相邻元素该位不能同时为1；该位是0，则a数组满足相反条件。递推可得如下结论：
对于n个0/1数组成的数组a，满足相邻元素不同时为1的数组个数为f[n]，则f[n]=f[n-1]+f[n-2],f[2]=2,f[3]=3。

#include <string>
#include <iostream>
#include <string>
#include <cstdio>
#include <cstring>
#include<algorithm>
#define ll long long
using namespace std;

ll n,k,l,m;
ll num1,num,tmp0,tmp1,answer;

struct Matrix{
    ll a[5][5];
}m1,xi,ans;

Matrix mul(Matrix x,Matrix y,ll a,ll b,ll c,ll mod){
    Matrix z;
    for(ll i=0;i<a;i++){
        for(ll j=0;j<c;j++){
            z.a[i][j]=0;
            for(ll k=0;k<b;k++){
                z.a[i][j]=(z.a[i][j]+x.a[i][k]*y.a[k][j])%mod;
            }
        }
    }
    return z;
}

ll Power2(ll a,ll b,ll mod){
    ll ans=1;
    while(b){
        if(b&1) { ans=(ans*a)%mod,b--; }
        b>>=1,a=(a*a)%mod;
    }
    return ans;
}

Matrix Power(Matrix a,ll k,ll mod){
    Matrix ans;
    ans.a[0][0]=ans.a[1][1]=1;
    ans.a[0][1]=ans.a[1][0]=0;
    while(k){
        if(k&1) { ans=mul(ans,a,2,2,2,mod),k--; }
        k>>=1,a=mul(a,a,2,2,2,mod);
    }
    return ans;
}

int main(){
    //freopen("a.txt","r",stdin);
    scanf("%I64d%I64d%I64d%I64d",&n,&k,&l,&m);
    num1=num=0;
    while(k){
        ll tmp=k%2;
        if(tmp) num1++;
        k>>=1,num++;
    }
    if(num>l) { printf("0\n"); return 0; }
    m1.a[0][0]=1,m1.a[0][1]=1,m1.a[1][0]=1,m1.a[1][1]=0;
    xi.a[0][0]=3,xi.a[1][0]=2;
    ans=Power(m1,n-2,m);
    ans=mul(ans,xi,2,2,1,m);
    tmp0=ans.a[0][0];
    tmp1=((Power2(2,n,m)-tmp0)%m+m)%m;
    answer=(Power2(tmp0,l-num1,m)*Power2(tmp1,num1,m))%m;
    printf("%I64d\n",answer);
    return 0;
}