摘要:递推公式以及寻找最高位 #include<stdio.h>#include<math.h>#define q (1+sqrt(5))/2.0int main(){ int f[20]; f[0]=0; f[1]=1; for(int i=2;i<=30;i++) { f[i]=f[i-1]+f[i-
阅读全文
posted @ 2016-04-14 16:49
posted @ 2016-04-14 16:49
posted @ 2016-04-13 12:50
posted @ 2016-04-10 00:09