达芬奇密码

题解

达芬奇原文说的是将一列数组重新排序后发现是斐波那契数列，然后将单词重新排列得到新的单词。本题思想类似
得到密码：37995588256861228614165223347687

代码

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<map>
using namespace std;
#define N 1000000
int A[N] = {0, 1,233,3,2584,1346269,144,5,196418,21,1597,610,377,10946,89,514229,987,8,55,6765,2178309,121393,317811,46368,4181,1,832040,2,28657,75025,34,13 ,17711};
int n = 32;
int B[N];
int cmp(int a,int b){
    return A[a] <A[b];
}
void init(){
    for (int i = 1; i <= n;i++){
        B[i] = i;
    }
}
char C[N] = {" 36968853882116725547342176952286"};
int main(){
    init();
    sort(B + 1, B + n + 1,cmp);
    for (int i = 1; i <= n;i++){
        int t=B[i];
        cout << C[t];
    }
}