2017 ACM/ICPC Asia Regional Shenyang Online(1005)
来源:互联网 发布:mac适合java开发吗 编辑:程序博客网 时间:2024/06/05 05:20
问题描述:
We define a sequence F
Give you an integer
this positive number is
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 integer
Output
For each case, output the minimal
Sample Input
1
Sample Output
4
问题描述:题目给我们一个数k,让我们求出k个斐波拉契数不能组成的最小的数.
题目分析:通过自己手动模拟,我们求出当
k=1 4 F(5)-1
k=2 12 F(7)-1
k=3 33 F(9)-1
不难发现,答案就是F(5+(k-1)*2)-1 % mod,然后矩阵快速幂
代码如下:
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#define ll long longusing namespace std;const ll mod=998244353;struct matrix{ ll f[3][3]; matrix operator*(const matrix &a) const { matrix res; for (int i=1;i<=2;i++) { for (int j=1;j<=2;j++) { res.f[i][j]=0; for (int k=1;k<=2;k++) res.f[i][j]=(res.f[i][j]+f[i][k]*a.f[k][j]); res.f[i][j]=(res.f[i][j]%mod+mod)%mod; } } return res; }}a,b;matrix fast_pow(matrix base,ll k){ matrix ans=base; while (k) { if (k&1) ans=ans*base; base=base*base; k>>=1; } return ans;}void init(){ b.f[1][1]=b.f[1][2]=1; b.f[2][1]=1,b.f[2][2]=0; a.f[1][1]=1; a.f[2][1]=0;}int main(){ ll k; while (scanf("%lld",&k)!=EOF) { k=5+(k-1)*2; init(); struct matrix cur,ans; cur=b; cur=fast_pow(b,k-2);//我的矩阵写法不一样,所以减了2 ans=cur*a; printf("%lld\n",(ans.f[1][1]-1)%mod); } return 0;}
- 2017 ACM/ICPC Asia Regional Shenyang Online
- 2017 ACM/ICPC Asia Regional Shenyang Online
- 2017 ACM/ICPC Asia Regional Shenyang Online
- 2017 ACM/ICPC Asia Regional Shenyang Online
- 2017 ACM/ICPC Asia Regional Shenyang Online
- 2017 ACM/ICPC Asia Regional Shenyang Online
- 2017 ACM/ICPC Asia Regional Shenyang Online
- 2017 ACM/ICPC Asia Regional shenyang Online
- 2017 ACM/ICPC Asia Regional Shenyang Online(1005)
- 2015 ACM/ICPC Asia Regional Shenyang Online
- 2015 ACM/ICPC Asia Regional Shenyang Online
- 2015 ACM/ICPC Asia Regional Shenyang Online
- 2015 ACM/ICPC Asia Regional Shenyang Online
- 2015 ACM/ICPC Asia Regional Shenyang Online
- 2016 ACM/ICPC Asia Regional Shenyang Online
- Problem 1002-2017 ACM/ICPC Asia Regional Shenyang Online
- Problem 1004-2017 ACM/ICPC Asia Regional Shenyang Online
- [尺取法]2017 ACM/ICPC Asia Regional Shenyang Online 1012
- 多读书
- 区块链开发(零)如何开始学习以太坊及区块链
- Python多线程(Thread)
- c++学习之运算重载
- 【Tomcat学习笔记系列】使用域名访问Tomcat部署下的项目
- 2017 ACM/ICPC Asia Regional Shenyang Online(1005)
- 描述文件位置
- 区块链开发(一)搭建基于以太坊的私有链环境
- 千里追踪博客之殇
- Java 抽象类和接口的区别
- 1008. 数组元素循环右移问题 (20)
- 文件系统
- 机器学习笔记-Decision Tree
- 遗传算法