hdu-6198number number number
来源:互联网 发布:苏州买茶叶知乎 编辑:程序博客网 时间:2024/06/11 23:29
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
先写出几项找到规律是求第i个mjf−bad number就是第2*i+3项斐波那契数列的值。
矩阵快速幂模版题。之前一直没做矩阵快速幂的题,还好队友写出来了。
#include <iostream>#include <cstdio>#include <cstring>#define LL long long#define MOD 998244353using namespace std;struct matrix{ LL x[3][3];};struct matrix mutimatrix(struct matrix a,struct matrix b){ struct matrix temp; memset(temp.x,0,sizeof(temp.x)); for(int i=0;i<2;i++) { for(int j=0;j<2;j++) { for(int k=0;k<2;k++) { temp.x[i][j]=temp.x[i][j]+a.x[i][k]*b.x[k][j]; temp.x[i][j]=temp.x[i][j]%MOD; } } } return temp;}struct matrix pow_matrix(struct matrix a,LL b){ struct matrix temp; memset(temp.x,0,sizeof(temp.x)); for(int i=0;i<2;i++) { temp.x[i][i]=1; } while(b) { if(b&1) { temp=mutimatrix(temp,a); } a=mutimatrix(a,a); b>>=1; } return temp;}int main(){ LL n; while(scanf("%lld",&n)!=EOF) { struct matrix temp,ans; temp.x[0][0]=1; temp.x[0][1]=1; temp.x[1][0]=1; temp.x[1][1]=0; ans=pow_matrix(temp,2*n+3); printf("%lld\n",ans.x[0][1]-1); } return 0;}
- hdu 6198 number number number
- hdu 6198 number number number
- hdu-6198number number number
- hdu 6198 number number number
- number number number HDU
- HDU 6198 number number number 题解
- 6198 number number number
- HDU 6189 number number number
- HDU-6198 number number number(打表找规律、矩阵快速幂)
- HDU 6198 number number number【找规律+矩阵快速幂】
- HDU 6198 number number number(斐波那契)
- Hdu 6198 number number number【矩阵快速幂】
- HDU 6198 number number number(规律+矩阵快速幂)
- HDU 6198number number number(矩阵快速幂)
- 【HDU 6198】number number number 【规律+矩阵快速幂】
- Number
- number
- number
- 学习笔记 变长栈帧
- 1107 并查集
- 位运算 反转卡片问题
- Android系统的开机画面显示过程分析
- 韦东山第12.6节-字符驱动之异步通知
- hdu-6198number number number
- 处理Python2.7读写文件中的中文乱码问题
- MyCat做MySQL读写分离
- String的一些理解
- java多线程基础知识
- 详解:: static_cast与dynamic_cast
- 往有序单循环链表的插入元素使原链表依旧有序
- ASIS CTF 2017 Mary Morton
- iOS原生与H5双向交互总结