2017 ACM/ICPC Asia Regional Shenyang Online E题【number number number】--矩阵快速幂与斐波那契数列
来源:互联网 发布:oppo手机解压软件 编辑:程序博客网 时间:2024/06/05 17:06
number number number
Problem Description
We define a sequence F :
⋅ F0=0,F1=1 ;
⋅ Fn=Fn−1+Fn−2 (n≥2) .
Give you an integerk , 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 integerk , you task is to find the minimal positive mjf−bad number.
The answer may be too large. Please print the answer modulo 998244353.
Give you an integer
Now, give you an integer
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 integerk which is described above. (1≤k≤109 )
Each test case includes an integer
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
解题新知:这道题题意弄明白,规律找出来后,即F[k] = f[2*k+3] -1,普通递推开那么大的数组会ME或TLE,和队友一直想怎么优化……没想到,居然有矩阵快速幂求斐波那契这种神奇的东西!数学之美啊
一篇比较好的讲解矩阵快速幂:矩阵快速幂求斐波那契数列(初学整理)
学过线性代数,原理很容易明白。就直接写代码了,未来还得好好加油。
AC代码:
#include<iostream>#include<cstring>#include<cstdio>const int MOD = 998244353;using namespace std;typedef struct node{ long long a[2][2];}matrix;matrix matMul(matrix x,matrix y) //矩阵乘法{ matrix res; memset(res.a,0,sizeof(res.a)); for(int i=0;i<2;i++) { for(int j=0;j<2;j++) { for(int k=0;k<2;k++) { res.a[i][j]+=x.a[i][k]*y.a[k][j]; res.a[i][j]%=MOD; } } } return res;}long long pow(int p) //矩阵快速幂{ matrix res; matrix c; memset(c.a,0,sizeof(c.a)); memset(res.a,0,sizeof(res.a)); for(int i=0;i<2;i++) res.a[i][i] = 1; c.a[0][0]=1,c.a[0][1]=1; c.a[1][0]=1,c.a[1][1]=0; while(p) { if(1&p) res = matMul(res,c); c = matMul(c,c); p>>=1; } return res.a[0][1];}int main(){ int n; while(scanf("%d",&n)!=EOF) { printf("%lld\n",(pow(2*n+3)-1)%MOD); } return 0;}
阅读全文
0 0
- 2017 ACM/ICPC Asia Regional Shenyang Online E题【number number number】--矩阵快速幂与斐波那契数列
- 2017 ACM/ICPC Asia Regional Shenyang Online 1005 number number number(矩阵快速幂)
- 2017 ACM/ICPC Asia Regional Shenyang Online:number number number
- 2017 ACM/ICPC Asia Regional Shenyang Online//number number number
- 【HDU6198 2017 ACM ICPC Asia Regional Shenyang Online E】【找规律 + 矩阵快速幂 + 粗略证明】number number number 无法用K
- 2017 ACM/ICPC Asia Regional Shenyang Online 1005 & hdu6198:number number number
- 【2017 ACM/ICPC Asia Regional Shenyang Online 1005】hdu 6198 number number number
- HDU-2017 ACM/ICPC Asia Regional Shenyang Online-1005-number number number
- 2017 ACM/ICPC Asia Regional Shenyang Online 1005 number number number (HDU6198)
- 2017 ACM/ICPC Asia Regional Shenyang Online 1005 number number number
- 2017 ACM/ICPC Asia Regional Shenyang Online E题
- HDU 5898 odd-even number (数位DP) 2016 ACM/ICPC Asia Regional Shenyang Online
- HDU 5898&&2016 ACM/ICPC Asia Regional Shenyang Online/ odd-even number [数位DP]【动态规划】
- HDU 5898 odd-even number (数位DP) 2016 ACM/ICPC Asia Regional Shenyang Online
- 2016 ACM/ICPC Asia Regional Shenyang Online HDU 5898 odd-even number
- HDU 5898 odd-even number(2016 ACM/ICPC Asia Regional Shenyang Online)
- 2017 ACM/ICPC Asia Regional Shenyang Online
- 2017 ACM/ICPC Asia Regional Shenyang Online
- chapter18形态学(开,闭运算)
- popstata或onpageshow解决微信浏览器点击返回按钮时读取缓存问题
- MVC框架显示层——Velocity技术
- Android 运行时权限
- 解决VMWare“Could not get vmci driver version:句柄无效”的错误
- 2017 ACM/ICPC Asia Regional Shenyang Online E题【number number number】--矩阵快速幂与斐波那契数列
- react-native之ART绘图详解
- java作业
- 防止iframe内框架调用
- 回车换行的起源 \d\a
- 【theano-windows】学习笔记九——softmax手写数字分类
- Bash脚本
- Android 的 那些 秘密代码
- mysql数据库执行mysqladmin flush-hosts方法