A Boring Question
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 197 Accepted Submission(s): 101
Problem Description
There are an equation.
∑0≤k1,k2,⋯km≤n∏1⩽j<m(kj+1kj)%1000000007=?
We define that (kj+1kj)=kj+1!kj!(kj+1−kj)! . And (kj+1kj)=0 while kj+1<kj.
You have to get the answer for each n and m that given to you.
For example,if n=1,m=3,
When k1=0,k2=0,k3=0,(k2k1)(k3k2)=1;
Whenk1=0,k2=1,k3=0,(k2k1)(k3k2)=0;
Whenk1=1,k2=0,k3=0,(k2k1)(k3k2)=0;
Whenk1=1,k2=1,k3=0,(k2k1)(k3k2)=0;
Whenk1=0,k2=0,k3=1,(k2k1)(k3k2)=1;
Whenk1=0,k2=1,k3=1,(k2k1)(k3k2)=1;
Whenk1=1,k2=0,k3=1,(k2k1)(k3k2)=0;
Whenk1=1,k2=1,k3=1,(k2k1)(k3k2)=1.
So the answer is 4.
Input
The first line of the input contains the only integer T,(1≤T≤10000)
Then T lines follow,the i-th line contains two integers n,m,(0≤n≤109,2≤m≤109)
Output
For each n and m,output the answer in a single line.
Sample Input
2
1 2
2 3
Sample Output
3
13
Author
UESTC
Source
2016 Multi-University Training Contest 6
题目大意:
求一下题干中给出的那个式子的值、
思路:
1、看这个题的第一感觉就是推公式,然而官方题解也是推公式,然而数学菜鸡推公式容易把自己推进火坑,所以一脸懵逼的开始敲暴力。
2、敲了发暴力,暴力跑了三十几组数据(之后数据就跑不出了啊!)然后得到了这样一些个数据:
1 1 1 1 1 1 1 1 1(n==0)(2<=m<=10)
3 4 5 6 7 8 9 10 11(n==1)(2<=m<=10)
7 13 21 31 43 57 73 91 111 (n==2)(2<=m<=10)
15 40 85 156 259 400 585 820 1111 (n==3)(2<=m<=10)
31 121 341 781 1555 2801 4681 7381 11111 (n==4)(2<=m<=10)
63 364 1365 3906 9331 19608 37449 66430(n==5)(2<=m<=10)
然后的任务就是观察.不难发现对应求ans(n,m)就是在求m^0+m^1+m^2+m^3+m^4+m^5+...........+m^6
暴力代码:
#include<stdio.h>
#include<string.h>
using namespace std;
#define ll __int64
int n,m;
ll output;
ll C(ll kj,ll kj1)
{
if(kj>kj1)return 0;
ll fenzi=1;
for(int i=1;i<=kj1;i++)
{
fenzi*=i;
}
ll fenmu=1;
for(int i=1;i<=kj;i++)
{
fenmu*=i;
}
ll fenmu2=1;
for(int i=1;i<=kj1-kj;i++)
{
fenmu2*=i;
}
//printf("%I64d %I64d\n",kj,kj1);1000000007
//printf("%I64d %I64d %I64d\n",fenzi,fenmu,fenmu2);
fenmu=fenmu*fenmu2;
return fenzi/fenmu;
}
int Dfs(int cur,int a[])
{
if(cur==m+1)
{
ll ans=-1;
for(int i=1;i<m;i++)
{
if(ans==-1)ans=C(a[i],a[i+1]);
else
ans*=C(a[i],a[i+1]);
}
//printf("%I64d\n",ans);
//if(ans==-1)ans=0;
output+=ans;
return 0;
}
for(int i=0;i<=n;i++)
{
a[cur]=i;
Dfs(cur+1,a);
}
}
int main()
{
for(int i=0;i<=10;i++)
{
for(int j=2;j<=10;j++)
{
n=i;m=j;
output=0;
int a[1551];
Dfs(1,a);
printf("%I64d ",output);
}
printf("\n");
}
}
3、这个式子不就是求等比数列前n项和吗......................那么ans=(M*(M^n-1)-1)/(m-1)+1';(当然需要取摸)剩下的就是实现代码的过程了。
4、然后对M^N快速幂+快速积稳稳处理一下,然后将这个值和M相乘之后-1再对mod求余,别忘了,这个时候你分子是求余之后的值,可能是相对而言比(m-1)小很多的,所以直接除(m-1)是会出问题的,所以这里需要拓展欧几里得求逆元。
Ac代码:
#include<stdio.h>
#include<string.h>
using namespace std;
#define mod 1000000007
#define ll __int64
ll kuaisucheng(ll a,ll b)
{
ll ans=0;
while(b)
{
if(b&1)
{
ans=(ans+a);
if(ans>=mod)ans-=mod;
}
a=(a+a);
if(a>=mod)a-=mod;
b/=2;
}
return ans;
}
ll extend_euclid(ll a,ll b,ll &x,ll &y)
{
if(b==0)
{
x=1,y=0;
return a;
}
else
{
ll r = extend_euclid(b,a%b,x,y);
ll t = x;
x = y;
y = t - (a/b)*y;
return r;
}
}
ll chufaqumo(int fenzi ,int fenmu)
{
ll x,y;
extend_euclid(fenmu,mod,x,y);
x=(x%mod+mod)%mod;
x=(x*fenzi+mod)%mod;
return x;
}
ll kuaisumi(ll a,ll b)
{
a%=mod;
ll ans=1;
while(b)
{
if(b&1)
{
ans=kuaisucheng(ans,a);
}
a=kuaisucheng(a,a);
b/=2;
}
return ans;
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
ll n;ll m;
scanf("%I64d%I64d",&n,&m);
ll ans=kuaisucheng(m,kuaisumi(m,n)-1);
printf("%I64d\n",(chufaqumo(ans,(m-1))+1)%mod);
}
}