HDOJ 4565 So Easy!

最新推荐文章于 2020-04-04 17:49:12 发布

boomxia'ka'la'ka

最新推荐文章于 2020-04-04 17:49:12 发布

阅读量356

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM算法文章标签：矩阵快速幂

本文链接：https://blog.csdn.net/qq_34542903/article/details/53012020

ACM算法专栏收录该内容

83 篇文章

订阅专栏

So Easy!

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 3896 Accepted Submission(s): 1284

Problem Description

　　A sequence S_n is defined as:

Where a, b, n, m are positive integers.┌x┐is the ceil of x. For example, ┌3.14┐=4. You are to calculate S_n.
　　You, a top coder, say: So easy!

Input

　　There are several test cases, each test case in one line contains four positive integers: a, b, n, m. Where 0< a, m < 2¹⁵, (a-1)²< b < a², 0 < b, n < 2³¹.The input will finish with the end of file.

Output

　　For each the case, output an integer S_n.

Sample Input

2 3 1 2013
2 3 2 2013
2 2 1 2013

Sample Output

4
14
4

前几天还看过这个题，没有想出来，这两天看了矩阵，现在来看就是矩阵的题，推一下转移矩阵就行，算是矩阵的水题吧；

#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
int n=2;
long long mod;
struct Matrix
{
    long long m[2][2];
}M;
Matrix Mult(Matrix a,Matrix b)
{
    Matrix ans;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            ans.m[i][j]=0;
            for(int k=0;k<n;k++)
            {
                ans.m[i][j]+=a.m[i][k]*b.m[k][j]%mod;
                ans.m[i][j]%=mod;
            }
        }
    }

    return ans;
}
Matrix quickpow(Matrix a,long long b)
{
    Matrix ans;
    for(int i=0;i<n;i++)
    {
        for(int j=0;j<n;j++)
        {
            if(i==j)
                ans.m[i][j]=1;
            else
                ans.m[i][j]=0;
        }
    }
    while(b)
    {
        if(b&1)
            ans=Mult(ans,a);
        a=Mult(a,a);
        b/=2;
    }
    return ans;
}
int main()
{
    long long x,y,m;
    Matrix N,M;
    while(scanf("%lld%lld%lld%lld",&x,&y,&m,&mod)!=EOF)
    {
        memset(N.m,0,sizeof(N.m));
        memset(M.m,0,sizeof(M.m));
        M.m[0][0]=x,M.m[0][1]=y;
        M.m[1][0]=1,M.m[1][1]=x;
        N.m[0][0]=x,N.m[1][0]=1;
        M=quickpow(M,m-1);
        N=Mult(M,N);
        printf("%lld\n",2*N.m[0][0]%mod);
    }

return 0;
}