HDU-3117-Fibonacci Numbers
这道题是矩阵快速幂的经典题(入门级)+fib的求前四位数的方法
题目大意:求fib的第n项。如果没有超过8位,那么正常输出,如果超过了8位,就输出前四位数+…+后四位数
然后这个地方可以先枚举打表一下什么时候哪一项超过了8位数。
可以看到第40项以后才会超过8位数,所以前四十项直接预处理就可以啦~
之后的输出前四项的方法请先参考博客方法,博客链接:
https://blog.csdn.net/qq_44624316/article/details/105452975
输出后面四位直接取模就行。用矩阵快速幂处理一下:
用矩阵快速幂的方法处理fib请参考博客,博客链接:
https://blog.csdn.net/qq_44624316/article/details/105432632
这道题就是这两道题的结合~
然后注意一下后面必须是输出四位哈~
不足四位需要补0.(这里我wa了一次)
代码部分:
#include <bits/stdc++.h>
#define mst(a, n) memset(a, n, sizeof(a))
using namespace std;
typedef long long ll;
const int mod = 1e4;
int fib[45];
struct Matrix
{
ll m[2][2];
Matrix()
{
mst(m, 0);
}
};
ll n;
Matrix Multi(Matrix a, Matrix b)
{
Matrix res;
for (int i = 0; i < 2; i++)
{
for (int j = 0; j < 2; j++)
{
for (int k = 0; k < 2; k++)
{
res.m[i][j] = (res.m[i][j] + a.m[i][k] * b.m[k][j]) % mod;
}
}
}
return res;
}
ll npow(Matrix a, ll n)
{
Matrix res;
for (int i = 0; i < 2; i++)
{
res.m[i][i] = 1;
}
while (n)
{
if (n & 1)
{
res = Multi(res, a);
}
a = Multi(a, a);
n >>= 1;
}
return res.m[0][1];
}
int main()
{
fib[0] = 0;
fib[1] = 1;
for (int i = 2; i <= 40; i++)
{
fib[i] = fib[i - 1] + fib[i - 2];
}
while (~scanf ("%I64d", &n))
{
if (n < 40)
{
cout << fib[n] << endl;
continue;
}
Matrix ans;
ans.m[0][0] = ans.m[0][1] = ans.m[1][0] = 1;
ll res1 = npow(ans, n);
double a1 = log10(1.0 / sqrt(5));
double a2 = log10((1 + sqrt(5)) / 2);
double res2 = a1 + n * a2;
res2 -= floor(res2);
res2 = pow(10, res2);
res2 = int(res2 * 1000);
cout << (int)res2 << "..." << setw(4) << setfill('0') << res1 << endl;
}
return 0;
}