估计是那些数学函数耗时比较多，以后还是用简单粗暴的方法算了……
#include<iostream.h>
#include<math.h>
int main(){
	long cas,n,num;
	double temp;
	cin>>cas;
	while(cas>0){
		cas--;
		cin>>n;
		n=n%750000;
		temp=((5+sqrt(5))/(15+5*sqrt(5)))*pow((3+sqrt(5))/2,n)+(1+sqrt(5))/(2*sqrt(5))*pow((3-sqrt(5))/2,n);
		if(ceil(temp)-temp<0.4)
			num=ceil(temp);
		else
			num=floor(temp);
		cout<<num<<endl;
	}
	return 0;
}

• 这题用这些东西即使不超时也没用的 (442) frkstyc 2006-01-25 18:43:13
• I think you haven't estimated the complexity of your algorithm... (442) richardhuang 2006-01-26 12:57:22