【算法学习】Berlekamp-Massey算法 求解最短线性递推式

学习了cz_xuyixuan的博客

参考大佬的代码写了一份模板：

#include <bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define per(i,a,b) for(int i=a;i>=b;--i)
#define repd(i,a,b) for(int i=a;i>=b;--i)
#define rvc(i,S) for(int i=0;i<(int)S.size();++i)
#define fore(i,x) for(int i = head[x] ; i ; i = e[i].next)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define debug(...) fprintf(stderr, __VA_ARGS__)
using namespace std;

typedef long long ll;
typedef long double ld;
const long long inf = 2e9;
const int maxn = 2020;
const ll mod = 1e9 + 7;

int cnt, fail[maxn];
ll val[maxn], delta[maxn],a[maxn];
vector <ll> ans[maxn];

inline ll power