题意:
给出一个数字n,在斐波那契数列中找到一个最小下标,满足这个斐波那契数是以n为前缀,输出这个下标。
思路:
高精度+字典树+1000000000000000进制。后来知道在斐波那契数很大的时候,只取前60位相加得到的前40位就是原斐波那契数的前40位。
代码:
#include <iostream>
#include <cstdio>
#include <map>
#include <cstring>
using namespace std;
typedef long long LL;
const LL mod = 1000000000000000;
const int m = 2000;
LL b[10][m + 10];
const int maxn = 10000005;
int tire[maxn][11];
int flag[maxn];
int tot;
void init2() {
memset(tire, 0, sizeof(tire));
memset(flag, -1, sizeof(flag));
tot = 1;
}
void add(string s, int rt, int nn) {
for(int i = 0; s[i]; i++) {
int x = s[i] - '0';
if(tire[rt][x] == 0) {
tire[rt][x] = tot++;
flag[tire[rt][x]] = nn;
}
rt = tire[rt][x];
}
}
int cal(string s, int rt) {
for(int i = 0; s[i]; i++) {
int x = s[i] - '0';
if(tire[rt][x] == 0) {
return -1;
}
rt = tire[rt][x];
}
return flag[rt];
}
void print(int n, int nn) {
bool flag = false;
string s = "";
bool f1 = false;
int k = 0;
for(int i = 0; i <= m; i++) {
char str[20] = "";
if(flag) {
sprintf(str,"%015lld", b[n][i]);
} else {
if(b[n][i] != 0) {
sprintf(str,"%lld", b[n][i]);
flag = true;
}
}
for(int j = 0; str[j]; j++) {
s += str[j]; k++;
if(k >= 40) {
f1 = true;
break;
}
}
if(f1) break;
}
add(s, 0, nn);
//cout << s << " " << nn << endl;
}
int A(int x) {
if(x % 3 == 0) return 3;
return x % 3;
}
void init() {
int nn = 0;
b[1][m] = 1;
print(1, nn++);
b[2][m] = 1;
print(2, nn++);
for(int i = 3; i <= 100000; i++) {
int now = A(i); int a1 = A(i - 1 + 3); int a2 = A(i - 2 + 3);
for(int j = m; j >= 0; j--) {
b[now][j] = b[a1][j] + b[a2][j];
}
for(int j = m; j >= 0; j--) {
b[now][j - 1] += b[now][j] / mod;
b[now][j] %= mod;
}
print(now,nn++);
}
}
int main() {
init2();
init();
int t;
scanf("%d",&t);
for(int k = 1; k <= t; k++) {
string s;
cin >> s;
printf("Case #%d: %d\n", k,cal(s,0));
}
}