return 100 first fibonacci numbers

vector<int> fibonacci(int n)
{
    vector<int> res;
    res.push_back(1);
    res.push_back(1);
    for (int i=2; i<n; i++)
        res.push_back(res[i-1] + res[i-2]);
    return res;
}