We define a sequence FF:
⋅⋅ F0=0,F1=1F0=0,F1=1;
⋅⋅ Fn=Fn−1+Fn−2 (n≥2)Fn=Fn−1+Fn−2 (n≥2).
Give you an integer kk, if a positive number nn can be expressed by
n=Fa1+Fa2+...+Fakn=Fa1+Fa2+...+Fak where 0≤a1≤a2≤⋯≤ak0≤a1≤a2≤⋯≤ak, this positive number is mjf−goodmjf−good. Otherwise, this positive number is mjf−badmjf−bad.
Now, give you an integer kk, you task is to find the minimal positive mjf−badmjf−badnumber.
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 kk which is described above. (1≤k≤1091≤k≤109)Output
For each case, output the minimal mjf−badmjf−bad number mod 998244353.
Sample Input
1Sample Output
4
题目大意:
先给出了斐波那契数列的定义
F0 = 0, F1 = 1;
Fn = F n - 1 + F n - 2.
再给出坏数的定义,给一个整数k,如果一个整数n不能有k个任意的(可重复)的斐波那契数组成,就成为是一个坏数。现给出k,问最小的坏数是多少,答案对998244353取模。
解题思路:
先观察前几项可得:
当k = 1时,4 = 5 - 1 = F(2 * 1 + 3) - 1;
当k = 2时,12 = 13 - 1 = F(2 * 2 + 3) - 1;
问题变成了求解第2 * k + 3项斐波那契数,又因为k很大,就需要使用矩阵快速幂解决了。
根据定义我们定义前两项是1和1,系数矩阵是1,1,1,0,求第n项需要计算系数矩阵的n-2次幂,然后乘上前两项,得到F(n)和F(n - 1)。
两种写法:
/* @Author: Top_Spirit @Language: C++ */ #include <bits/stdc++.h> using namespace std ; typedef long long ll ; const int Maxn = 2 ; const int MOD = 998244353 ; #define mod(x) ((x) % MOD) struct mat{ ll m[Maxn][Maxn] ; }unit; mat operator * (mat a, mat b){ mat ret ; ll x ; for (ll i = 0;i < 2; i++){ for (ll j = 0; j < 2; j++){ x = 0 ; for (ll k = 0; k < 2; k++){ x += mod(ll (a.m[i][k] * b.m[k][j])) ; } ret.m[i][j] = mod(x) ; } } return ret ; } void init_unit(){ for (ll i = 0; i < Maxn; i++){ unit.m[i][i] = 1 ; } return ; } mat pow_mat(mat a, ll n){ mat ret = unit ; while (n){ if (n & 1) ret = ret * a ; a = a * a ; n >>= 1 ; } return ret ; } int main (){ ll x ; init_unit() ; while (cin >> x){ x = 2 * x + 3 ; mat a ; a.m[0][0] = 1, a.m[0][1] = 1, a.m[1][0] = 1, a.m[1][1] = 0; mat ans = pow_mat(a, x) ; cout << ans.m[1][0] - 1 << endl ; } return 0 ; }
/* @Author: Top_Spirit @Language: C++ */ #include <bits/stdc++.h> using namespace std ; typedef long long ll ; const int Maxn = 2 ; const int MOD = 998244353 ; #define mod(x) ((x) % MOD) struct mat{ ll m[Maxn][Maxn] ; }unit; mat operator * (mat a, mat b){ mat ret ; ll x ; for (ll i = 0;i < 2; i++){ for (ll j = 0; j < 2; j++){ x = 0 ; for (ll k = 0; k < 2; k++){ x += mod(ll (a.m[i][k] * b.m[k][j])) ; } ret.m[i][j] = mod(x) ; } } return ret ; } void init_unit(){ for (ll i = 0; i < Maxn; i++){ unit.m[i][i] = 1 ; } return ; } mat pow_mat(mat a, ll n){ mat ret = unit ; while (n){ if (n & 1) ret = ret * a ; a = a * a ; n >>= 1 ; } return ret ; } int main (){ ll x ; init_unit() ; while (cin >> x){ x = 2 * x + 1 ; mat a ; a.m[0][0] = 1, a.m[0][1] = 1, a.m[1][0] = 1, a.m[1][1] = 0; mat ans = pow_mat(a, x) ; mat tmp ; tmp.m[0][0] = 1, tmp.m[1][0] = 1 ; ans = ans * tmp ; cout << ans.m[0][0] - 1 << endl ; } return 0 ; }
为什么会有两种写法呢?推荐看一下https://blog.csdn.net/weixin_41190227/article/details/89363980