HDU6198（矩阵快速幂）

number number number

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

Problem Description

We define a sequence  F :

⋅   F0=0,F1=1 ;
⋅   Fn=Fn−1+Fn−2 (n≥2) .

Give you an integer  k , if a positive number  n  can be expressed by
n=Fa1+Fa2+...+Fak  where  0≤a1≤a2≤⋯≤ak , this positive number is  mjf−good . Otherwise, this positive number is  mjf−bad .
Now, give you an integer  k , you task is to find the minimal positive  mjf−bad  number.
The answer may be too large. Please print the answer modulo 998244353.

 

Input

There are about 500 test cases, end up with EOF.
Each test case includes an integer  k  which is described above. ( 1≤k≤109 )

 

Output

For each case, output the minimal  mjf−bad  number mod 998244353.

 

Sample Input

  
  

   
   1
  
  

 

Sample Output

  
  

   
   4
  
  

 

Source

2017 ACM/ICPC Asia Regional Shenyang Online

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string.h>
using namespace std;
typedef long long ll;
const int MOD=998244353;
struct matrix{
	ll a[2][2];
	matrix(ll num=0)
	{
		for(int i=0;i<2;i++)
			for(int j=0;j<2;j++)
			{
				a[i][j]=i==j?num:0;
			 } 
	} 
	matrix operator *(matrix b){
		matrix c;
		for(int i=0;i<2;i++)
			for(int j=0;j<2;j++)
				for(int k=0;k<2;k++)
				{
					c.a[i][j]=(c.a[i][j]+a[i][k]*b.a[k][j])%MOD;
				}
			return c;
	}
}E;
ll matrixQuickPow(matrix a,int n)
{
	matrix res(1);
	for(;n;n>>=1,a=a*a) if(n&1) res=res*a;
	return res.a[0][0];
}
ll work(ll n)
{
	n=n*2+2;
	E.a[0][0]=1;E.a[0][1]=1;
	E.a[1][0]=1;E.a[1][1]=0;
	return (matrixQuickPow(E,n)+MOD-1)%MOD; 
}
int main()
{
	for(ll n;~scanf("%lld",&n);printf("%lld\n",work(n)));
	return 0;
}