Wannafly挑战赛28 Solution

Solved.

考虑斐波那契数列，即最多加45次即会超过1e9,直接暴力即可

 1 #include <bits/stdc++.h>
 2 using namespace std;
 3  
 4 int a, b, l;
 5  
 6 int solve(int st)
 7 {
 8     int A = a, B = b;
 9     while (1)
10     {
11         if (st == 1)
12         {
13             if (A > l) return printf("Yes");
14             else
15             {
16                 int B0 = B;
17                 while (B < 2 * B0) B += A;
18             }
19         }
20         else
21         {
22             if (B > l) return printf("No");
23             else
24             {
25                 int A0 = A;
26                 while (A < 2 * A0) A += B;
27             }
28         }
29         st ^= 1;
30     }
31 }
32  
33 int main()
34 {
35     while (scanf("%d%d%d", &a, &b, &l) != EOF)
36     {
37         solve(1); putchar(' ');
38         solve(0); putchar('\n');
39     }
40     return 0;
41 }

View Code