HDU5490 Simple Matrix

最新推荐文章于 2023-06-30 19:13:24 发布

oorzhang

最新推荐文章于 2023-06-30 19:13:24 发布

阅读量909

点赞数

分类专栏：数学数论

本文链接：https://blog.csdn.net/ocgcn2010/article/details/48791673

版权

数学数论专栏收录该内容

31 篇文章 0 订阅

订阅专栏

Simple Matrix

Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 128 Accepted Submission(s): 35

Problem Description

As we know, sequence in the form of

an=a1+(n−1)d is called arithmetic progression and sequence in the form of

bn=b1qn−1(q>1,b1≠0) is called geometric progression. Huazheng wants to use these two simple sequences to generate a simple matrix. Here is what he decides to do:
Use the geometric progression as the first row of the simple matrix:

c0,n=bn
Use the arithmetic progression as the first column of the simple matrix:

cn,0=an
Calculate the item at

n -th row,

m -th column of the simple matrix as

cn,m=cn−1,m+cn,m−1 , where

n≥1 and

m≥1 .
Given the two sequences, Huazheng wants to know the value of

cn,m , but he is too busy with his research to figure it out. Please help him to work it out. By the way, you can assume that

c0,0=0 .

Input

The first line of input contains a number

T indicating the number of test cases (

T≤200 ).
For each test case, there is only one line containing six non-negative integers

b1,q,a1,d,n,m . (

0≤n≤10000 ). All integers are less than

231 .

Output

For each test case, output a single line consisting of “Case #X: Y”.

X is the test case number starting from 1.

Y is

cn,m module 1000000007.

Sample Input

  
  
   
   2
3 10 1 1 3 3
5 2 1 10 4 2

Sample Output

  
  
   
   Case #1: 423
Case #2: 140

Source

2015 ACM/ICPC Asia Regional Hefei Online

题意略。

思路：边界行的是等比数列，列的是等差数列，不难发现边界对总和的贡献为：行C（n+i,n），列C（m+i,m）(这里m，n做了处理m=m-1,n=n-1，0<=i<=m)；

利用递推式：C(n,k)=C(n-1,k-1)+C(n-1,k);

可以把总和化简；

最后等差部分的可以算出来是a*(C(m+n+1,n))+d*(C(m+n+1,n+2));

等比部分可以用递推：

S1=q(q^(m+1)-1)/(q-1)^2-(m+1）/(q-1);

s(n)=q*s(n-1)/(q-1)-C(m+n,n)/(q-1);

这里的C(m+n,n)可以先预处理出来

逆元可以用递推优化。

/*************************************************************************
    > File Name: hefei/1007.cpp
    > Author: kelvin
    > Mail: 444051232@qq.com
    > Created Time: 2015年09月27日 星期日 16时11分15秒
 ************************************************************************/

#include<iostream>
#include<cmath>
#include<string.h>
#include<vector>
#include<queue>
#include<map>
#include<algorithm>
#include<utility>
#include<stdio.h>
using namespace std;
#define REP(i,a,b)	for(int i=a;i<b;++i)
#define LL		long long
#define mset(a,b)	memset(a,b,sizeof a)

const LL p=1000000007;
const int maxn=10011;
LL b,q,a,d,m,n;
LL invq;
LL expp2;
LL C[maxn];
LL invv[maxn];

LL gcd(LL a,LL b,LL &d,LL &x,LL &y)
{
    if(!b)  {d=a;x=1;y=0;}
    else {gcd(b,a%b,d,y,x);y-=x*(a/b);}
}

LL inv(LL a)
{
    LL d,x,y;
    gcd(a,p,d,x,y);
    return d==1?(x+p)%p:-1;
}

LL getinv()
{
    invv[1]=1;
    REP(i,2,maxn)
    {
        invv[i]=(p-p/i)*invv[p%i]%p;
    }
}

LL exp_mod(LL a, LL b) {
    LL res = 1;
    while(b != 0) {
        if(b&1) res = (res * a) % p;
        a = (a*a) % p;
        b >>= 1;
    }
    return res;
}


LL Comb(LL a, LL b) {
    if(a < b)   return 0;
    if(a == b)  return 1;
    if(b > a - b)   b = a - b;

    LL ans = 1, ca = 1, cb = 1;
    for(LL i = 0; i < b; ++i) {
        ca = (ca * (a - i))%p;
        cb = (cb * (b - i))%p;
    }
    ans = (ca*exp_mod(cb, p - 2)) % p;
    return ans;
}

LL Lucas(int n, int m) {
     LL ans = 1;

     while(n&&m&&ans) {
        ans = (ans*Comb(n%p, m%p)) % p;
        n /= p;
        m /= p;
     }
     return ans;
}

void getC()
{
    C[0]=1;
    C[1]=(m+1)%p;
    REP(i,2,n+3)
    {
        C[i]=(((m+i)*C[i-1])%p)*invv[i];
        C[i]%=p;
        if(C[i]<0)  C[i]+=p;
    }
}

LL solve()
{
    invq=inv(q-1);
    LL ans;
    LL sm;
    if(q==1)
        sm=(b*Lucas(m+n+1,n+1))%p;
    else{
        getC();
        LL sp=(q*((exp_mod(q,m+1)-1+p)%p)%p*invq%p*invq)%p-(m+1)*invq%p;
        sp%=p;
        if(sp<0)    sp+=p;
        sm=sp;
        REP(i,2,n+1)
        {
            sm=(((q*sm)%p*invq)%p-(C[i]*invq)%p+p)%p;
        }
        sm=(sm*b)%p;
        if(sm<0)    sm+=p;
    }
    ans=sm;
    LL tmp=(a*Lucas(m+n+1,m+1))%p;
    ans+=tmp;
    tmp=(d*Lucas(m+n+1,m+2))%p;
    ans+=tmp;
    ans%=p;
    if(ans<0)   ans+=p;
    return ans;
}

int main()
{
    int t,cas=1;
    getinv();
    scanf("%d",&t);
    while(t--)
    {
        LL ans;
        scanf("%I64d%I64d%I64d%I64d%I64d%I64d",&b,&q,&a,&d,&n,&m);
        //cin>>b>>q>>a>>d>>n>>m;
        b%=p;q%=p;a%=p;d%=p;
        if(m==0 && n==0)
        {
            ans=0;
        }
        else if(n==0)
        {
            ans=b*exp_mod(q,m-1);
            ans%=p;
        }
        else if(m==0)
        {
            ans=a+(n-1)*d;
            ans%=p;
        }
        else{
            m--;n--;
            ans=solve();
        }
        printf("Case #%d: %I64d\n",cas++,ans);
    }
}