ProjectEuler654

我，ycl:BM是什么早就忘了！

毕老爷:那你们可以做一做这道题练练BM板子啊。

传送门

 //Achen
 #include<bits/stdc++.h>
 #define For(i,a,b) for(int i=(a);i<=(b);i++)
 #define Rep(i,a,b) for(int i=(a);i>=(b);i--)
 #define Formylove return 0
 const int N=1e5+,p=1e9+;
 typedef long long LL;
 typedef double db;
 using namespace std;
 int n,m;
 LL f[][];

 template<typename T> void read(T &x) {
     char ch=getchar(); T f=; x=;
     while(ch!='-'&&(ch<''||ch>'')) ch=getchar();
     if(ch=='-') f=-,ch=getchar();
     for(;ch>=''&&ch<='';ch=getchar()) x=x*+ch-''; x*=f;
 }

 int main() {
     freopen("1.in","r",stdin);
     //freopen("biao.in","w",stdout);
     read(m); read(n);
     For(i,,m) f[][i]=;
     For(i,,n) {
         if(i>) For(j,,m) f[i][j]=f[i-][m-j];
         For(j,,m) f[i][j]=(f[i][j]+f[i][j-])%p;
     }
     printf("%lld\n",f[][m]);
     //printf("%d\n",n);
     //For(i,1,n) printf("%lld ",f[i][m]);
     //printf("%lld\n",f[n][m]);
     Formylove;
 }

n^2暴力

//Achen
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<vector>
#include<cstdio>
#include<queue>
#include<cmath>
#include<set>
#include<map>
#define Formylove return 0
#define For(i,a,b) for(int i=(a);i<=(b);i++)
#define Rep(i,a,b) for(int i=(a);i>=(b);i--)
const int N=,p=1e9+;
typedef long long LL;
typedef double db;
using namespace std;
int n,cnt,fail[N];
vector<LL>f[N];
LL a[N],delta[N];

template<typename T>void read(T &x)  {
    char ch=getchar(); x=; T f=;
    while(ch!='-'&&(ch<''||ch>'')) ch=getchar();
    if(ch=='-') f=-,ch=getchar();
    for(;ch>=''&&ch<='';ch=getchar()) x=x*+ch-''; x*=f;
}

LL ksm(LL a,LL b) {
    LL rs=,bs=a%p;
    while(b) {
        if(b&) rs=rs*bs%p;
        bs=bs*bs%p;
        b>>=;
    }
    return rs;
}

#define ANS
int main() {
#ifdef ANS
    freopen("biao.in","r",stdin);
    freopen("shizi.out","w",stdout);
#endif
    read(n);
    For(i,,n) read(a[i]);
    For(i,,n) {
        LL tp=; int up=f[cnt].size();
        For(j,,up-) tp=(tp+f[cnt][j]*a[i-j-]%p)%p;
        if(tp==a[i]) continue;
        delta[i]=(a[i]-tp+p)%p;
        fail[cnt]=i;
        ++cnt;
        if(cnt==) {
            f[cnt].resize(i);
            continue;
        }
        LL mul=delta[i]*ksm(delta[fail[cnt-]],p-)%p,fmul=(p-mul)%p;
        f[cnt].resize(i-fail[cnt-]-);
        f[cnt].push_back(mul);
        up=f[cnt-].size();
        For(j,,up-) f[cnt].push_back(fmul*f[cnt-][j]%p);
        up=f[cnt-].size();
        if(f[cnt].size()<f[cnt-].size()) f[cnt].resize(up);
        For(j,,up-) f[cnt][j]=(f[cnt][j]+f[cnt-][j])%p;
    }
    int up=f[cnt].size();
    printf("%d\n",up);
    For(i,,up-) printf("%lld ",f[cnt][i]);
    Formylove;
}

BM出递推

 //Achen
 #include<bits/stdc++.h>
 #define For(i,a,b) for(int i=(a);i<=(b);i++)
 #define Rep(i,a,b) for(int i=(a);i>=(b);i--)
 #define Formylove return 0
 const int N=1e5+,p=1e9+;
 typedef long long LL;
 typedef double db;
 using namespace std;
 int cnt;
 LL A[N],f[N],n;

 template<typename T> void read(T &x) {
     char ch=getchar(); T f=; x=;
     while(ch!='-'&&(ch<''||ch>'')) ch=getchar();
     if(ch=='-') f=-,ch=getchar();
     for(;ch>=''&&ch<='';ch=getchar()) x=x*+ch-''; x*=f;
 }

 LL rs[N],bs[N],tp[N];
 void cheng(LL a[],LL b[]) {
     For(i,,cnt*) tp[i]=;
     For(i,,cnt-) For(j,,cnt-)
         (tp[i+j]+=a[i]*b[j])%=p;
     Rep(i,cnt*-,cnt) if(tp[i])
         For(j,,cnt-)
             (tp[i-j-]+=A[j]*tp[i]%p)%=p;
     For(i,,cnt-) a[i]=tp[i];
 }

 void ksm(LL b) {
     while(b) {
         if(b&) cheng(rs,bs);
         cheng(bs,bs);
         b>>=;
     }
 }

 int main() {
     freopen("shizi.out","r",stdin);
     //freopen("shizi.out","w",stdout);
     read(cnt);
     For(i,,cnt-) read(A[i]);
     read(n);
     rs[]=; bs[]=; ksm(n-);
     For(i,,cnt) read(f[i]);
     LL ans=;
     For(i,,cnt-) ans=(ans+f[i+]*rs[i]%p)%p;
     printf("%lld\n",ans);
     Formylove;
 }

多项式取模