ACM/ICPC算法训练 之 数学很重要—斐波拉契●卢卡斯数列(HNNUOJ 11589)

 1 //斐波拉契-卢卡斯数列
 2 //Memory 1100 K,Time: 234 Ms
 3 #include<iostream>
 4 #include<cstring>
 5 #include<cstdio>
 6 #include<cmath>
 7 using namespace std;
 8 
 9 #define INF 0x3f3f3f3f
10 
11 int m1,m2;    //让第二项最小的初始两项
12 
13 //计算初始两项并刷新最适合的m1，m2
14 void compute(int a,int b,int t)
15 {
16     while(t <= a && t >= 1)
17     {
18         b = a;    
19         a = t;
20         t = b - a;
21     }
22     if(m2 > b)
23     {
24         m1 = a;
25         m2 = b;
26     }
27 }
28 
29 int main()
30 {
31     int T,n;
32     scanf("%d",&T);
33 
34     while(T--)
35     {
36         int a,t;
37         scanf("%d",&n);
38         a = (int)(0.618*n)-1;    //倒数第二项模糊值
39 
40         m1 = m2 = INF;
41         int i = -1;
42         while(a+(++i) <= n && i <= (int)2*sqrt(n))    //倒数第二项小于最后一项，且次数小于2*sqrt(n)
43         {
44             compute(a+i,n,n-a-i);
45         }
46 
47         printf("%d %d\n",m1,m2);
48     }
49 
50     return 0;
51 }