CodeForces 199A Hexadecimal's theorem

题意：给出一个数字，判断是否能通过三个Fibonacci Number(可重复)求和得到，若可以，输出这三个数，若不可以，按要求输出字符串

链接：http://codeforces.com/problemset/problem/199/A

思路：前两个数a,b通过枚举，算出第三个数的值n-a-b，利用二分查找这个数是否是Fib数

注意点：无

以下为AC代码：

#	Author	Problem	Lang	Verdict	Time	Memory	Sent	Judged
10047474	Practice: luminous11	199A - 15	GNU C++11	Accepted	30 ms	392 KB	2015-02-27 15:16:54	2015-02-27 15:16:54

#include <iostream>
#include <cstdio>
#include <string>
#include <cstring>
#include <vector>
#include <deque>
#include <list>
#include <cctype>
#include <algorithm>
#include <climits>
#include <queue>
#include <stack>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <cstdlib>
#include <ctime>
#define ll long long
#define ull unsigned long long
#define all(x) (x).begin(), (x).end()
#define clr(a, v) memset( a , v , sizeof(a) )
#define pb push_back
#define mp make_pair
#define read(f) freopen(f, "r", stdin)
#define write(f) freopen(f, "w", stdout)
using namespace std;
const double pi = acos(-1);

int main()
{
    ios::sync_with_stdio( false );
    int a[100005] = { 0 };
    a[0] = 0;a[1] = 1;
    int cnt = 0;
    for ( int i = 2; ; i ++ ){
        a[i] = a[i-1] + a[i-2];
        cnt ++;
        if ( a[i] > 1000000007 ){
            break;
        }
    }
    vector<int> num ( a, a + cnt );
    int n;
    while ( cin >> n ){
        bool flag = 0;
        if ( n == 0 ){
            cout << "0 0 0" << endl;
            continue;
        }
        for ( int i = 0; a[i] < n; i ++ ){
            for ( int j = i; a[j] < n; j ++ ){
                int tmp = n - num[i] - num[j];
                if ( tmp < 0 )continue;
                vector<int>::iterator k = upper_bound( all(num), tmp );
                k --;
                int ans[3];
                if ( *k == tmp ){
                    ans[0] = num[i];
                    ans[1] = num[j];
                    ans[2] = *k;
                    sort( ans, ans + 3 );
                    cout << ans[0] << ' ' << ans[1] << ' ' << ans[2] << endl;
                    flag = 1;
                    break;
                }
            }
            if ( flag )break;
        }
        if ( ! flag ){
            cout << "I'm too stupid to solve this problem" << endl;
        }
    }
    return 0;
}