题目连接:http://acm.hdu.edu.cn/showproblem.php?pid=5620
题意:给你一个n长的钢管,要分的尽可能多,且任意三条不能构成三角形
题解:看hint就知道用递推来解
#include<cstdio>
#define F(i,a,b) for(int i=a;i<=b;++i)
long long a[100],b[100],n;int t,l,r,mid;
int main(){
b[1]=1,b[2]=2,a[1]=b[1];
F(i,3,90)b[i]=b[i-1]+b[i-2];
F(i,2,90)a[i]+=a[i-1]+b[i];
scanf("%d",&t);
while(t--){
scanf("%lld",&n);
for(l=1,r=87;l<=r;)if(a[mid=l+((r-l)>>1)]>n)r=mid-1;else l=mid+1;
printf("%d\n",l-1);
}
return 0;
}