topcoder SRM 622 DIV2 FibonacciDiv2

关于斐波那契数列，由于数据量比较小， 直接打表了，代码写的比较戳

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

class FibonacciDiv2{
public:
    vector<int> table;
    void make_table(){
        table.push_back();
        table.push_back();
        int newData = ;
        do{
             int last = table.size()-;
            newData = table[last]+table[last-];
            table.push_back(newData);
        }while(newData <= );
    }
    int find(int N){
        make_table();
        int len = table.size(), result=;
        if(N <= table[]) result =  table[]-N;
        else if(N >= table[len-]) result= N-table[len-];
        else{
            for(int i =  ; i< len-; ++ i){
                if( table[i+]>=N && table[i]<= N ){ result = min(table[i+]-N,N-table[i]);break;}
            }
        }
        return result;
    }
};