题目链接:https://ac.nowcoder.com/acm/contest/882/B
题目大意:一个人随机走1~k步,问正好走到n点的概率为多少
题目思路:难点在于n极大,其dp方程非常基础。
意思就是说能由前k步转移过来,转移过来的概率是
然后就可以用神器杜教BM
发现一定要推入2*k项,少一项都不行
对于n取无穷大的情况,由于每一次的期望是
由等差数列公式化简得到
这是整体的期望,然后根据感性理解(博主能力有限无法正确证明,如果有读者知道怎么证明可以跟博主说说谢谢QAQ)
到无穷远处的概率是期望的倒数,也就是
以下是代码:
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <cassert>
#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (ll i=a;i<n;i++)
#define per(i,a,n) for (ll i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef long long ll;
typedef vector<ll> VI;
typedef pair<ll,ll> PII;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
// head
ll _,n;
namespace linear_seq {
const ll N=10010;
ll res[N],base[N],_c[N],_md[N];
vector<ll> Md;
void mul(ll *a,ll *b,ll k) {
rep(i,0,k+k) _c[i]=0;
rep(i,0,k) if (a[i]) rep(j,0,k) _c[i+j]=(_c[i+j]+a[i]*b[j])%mod;
for (ll i=k+k-1;i>=k;i--) if (_c[i])
rep(j,0,SZ(Md)) _c[i-k+Md[j]]=(_c[i-k+Md[j]]-_c[i]*_md[Md[j]])%mod;
rep(i,0,k) a[i]=_c[i];
}
ll solve(ll n,VI a,VI b) { // a 系数 b 初值 b[n+1]=a[0]*b[n]+...
// printf("%lld\n",SZ(b));
ll ans=0,pnt=0;
ll k=SZ(a);
assert(SZ(a)==SZ(b));
rep(i,0,k) _md[k-1-i]=-a[i];_md[k]=1;
Md.clear();
rep(i,0,k) if (_md[i]!=0) Md.push_back(i);
rep(i,0,k) res[i]=base[i]=0;
res[0]=1;
while ((1ll<<pnt)<=n) pnt++;
for (ll p=pnt;p>=0;p--) {
mul(res,res,k);
if ((n>>p)&1) {
for (ll i=k-1;i>=0;i--) res[i+1]=res[i];res[0]=0;
rep(j,0,SZ(Md)) res[Md[j]]=(res[Md[j]]-res[k]*_md[Md[j]])%mod;
}
}
rep(i,0,k) ans=(ans+res[i]*b[i])%mod;
if (ans<0) ans+=mod;
return ans;
}
VI BM(VI s) {
VI C(1,1),B(1,1);
ll L=0,m=1,b=1;
rep(n,0,SZ(s)) {
ll d=0;
rep(i,0,L+1) d=(d+(ll)C[i]*s[n-i])%mod;
if (d==0) ++m;
else if (2*L<=n) {
VI T=C;
ll c=mod-d*powmod(b,mod-2)%mod;
while (SZ(C)<SZ(B)+m) C.pb(0);
rep(i,0,SZ(B)) C[i+m]=(C[i+m]+c*B[i])%mod;
L=n+1-L; B=T; b=d; m=1;
} else {
ll c=mod-d*powmod(b,mod-2)%mod;
while (SZ(C)<SZ(B)+m) C.pb(0);
rep(i,0,SZ(B)) C[i+m]=(C[i+m]+c*B[i])%mod;
++m;
}
}
return C;
}
ll gao(VI a,ll n) {
VI c=BM(a);
c.erase(c.begin());
rep(i,0,SZ(c)) c[i]=(mod-c[i])%mod;
return solve(n,c,VI(a.begin(),a.begin()+SZ(c)));
}
};
ll dp[10005];
int main() {
ll t;
scanf("%lld",&t);
ll k;
ll n;
while (t--) {
scanf("%lld%lld",&k,&n);
ll p=powmod(k,mod-2);
if(n==-1){
printf("%lld\n",2ll*powmod(k+1,mod-2)%mod);
continue;
}
vector<ll>v;
dp[0]=1;
rep(i,1,11){
dp[i]=0;
rep(j,max(0ll,i-k),i){
dp[i]=(dp[i]+dp[j]*p)%mod;
}
v.push_back(dp[i]);
//cout<<i<<"!!"<<dp[i]<<endl;
}
int len=v.size();
//for(int i=0;i<len;i++)cout<<v[i]<<endl;
//VI{1,2,4,7,13,24}
printf("%lld\n",linear_seq::gao(v,n-1));
}
}