就是求出fibonacci数列的任意项,此数列为f[0]=1 f[1]=1 f[k]=[k-1]+f[k-2]

寻找一串无须数列的众数,输入输出均为文件操作，利用快排。-All looking for a bunch of no series, both input and output file operations, the use of fast row.