之前做的题,拿出来记录一下。
题目:
链接:https://vjudge.net/problem/HDU-3117
思路分析
因为这道题要求大于8位数的时候用省略号,因此,我们需要知道什么时候会超过8位数。自己写个程序试下,应该是到第39项(<=39)为止不需要省略号。因为,n<=39时,直接矩阵快速幂。
大于39的时候,我们需要分两部分:
对于后四位,我们矩阵快速幂+取余解决。
对于前四位,我们需要用到斐波那契数列的通项:
然后还需要对这个式子取log处理,,贴个大佬的博客吧:https://www.cnblogs.com/Blogggggg/p/7356668.html
ac代码
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
const int mod = 10000;
typedef unsigned long long ull;
int fi[21] = { 0,1 };
int flag = 0;
struct mat {
int num[2][2];
mat() {
num[0][0] = num[0][1] = num[1][0] = 1;
}
friend mat operator*(const mat& a, const mat& b)
{
mat result;
result.num[0][0] = result.num[0][1] = result.num[1][0] = result.num[1][1] = 0;
for (int i = 0; i < 2; i++)
{
for (int j = 0; j < 2; j++)
{
for (int k = 0; k < 2; k++)
{
if (flag == 0)result.num[i][j] += a.num[i][k] * b.num[k][j];
else
result.num[i][j]= (result.num[i][j] % mod + (a.num[i][k] % mod * b.num[k][j] % mod) % mod) % mod;
}
}
}
return result;
}
};
int f(int n)
{
mat result;
for (int i = 0; i < 2; i++) result.num[i][i] = 1;
result.num[1][0] = result.num[0][1] = 0;
mat base;
base.num[0][0] = base.num[0][1] = base.num[1][0] = 1;
base.num[1][1] = 0;
while (n)
{
if (n & 1) result = result * base;
base = base * base;
n >>= 1;
}
return result.num[1][0];
}
int fs(int n)
{
double p, f;
f = (1.0 + sqrt(5.0)) / 2.0;
p = -0.5 * log10(5.0) + n * 1.0 * log(f) / log(10.0);
p = p - floor(p);
p = pow(10.0, p);
while (p < 1000)p *= 10;
return (int)p;
}
int fl(int n)
{
flag = 1;
mat result;
for (int i = 0; i < 2; i++) result.num[i][i] = 1;
result.num[0][1] = result.num[1][0] = 0;
mat base;
base.num[0][0] = base.num[0][1] = base.num[1][0] = 1;
base.num[1][1] = 0;
while (n)
{
if (n & 1) result = result * base;
base = base * base;
n >>= 1;
}
return result.num[1][0];
flag = 0;
}
int main()
{
ull n;
while (cin >> n)
{
if (n == 0)
{
cout << 0 << endl;
continue;
}
if (n <=39) printf("%d\n", f(n));
else
{
printf("%d...%04d\n", fs(n), fl(n));
}
}
return 0;
}