<p>You are given a string of digits <code>num</code>, such as <code>&quot;123456579&quot;</code>. We can split it into a Fibonacci-like sequence <code>[123, 456, 579]</code>.</p>

<p>Formally, a <strong>Fibonacci-like</strong> sequence is a list <code>f</code> of non-negative integers such that:</p>

<ul>
	<li><code>0 &lt;= f[i] &lt; 2<sup>31</sup></code>, (that is, each integer fits in a <strong>32-bit</strong> signed integer type),</li>
	<li><code>f.length &gt;= 3</code>, and</li>
	<li><code>f[i] + f[i + 1] == f[i + 2]</code> for all <code>0 &lt;= i &lt; f.length - 2</code>.</li>
</ul>

<p>Note that when splitting the string into pieces, each piece must not have extra leading zeroes, except if the piece is the number <code>0</code> itself.</p>

<p>Return any Fibonacci-like sequence split from <code>num</code>, or return <code>[]</code> if it cannot be done.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> num = &quot;1101111&quot;
<strong>Output:</strong> [11,0,11,11]
<strong>Explanation:</strong> The output [110, 1, 111] would also be accepted.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> num = &quot;112358130&quot;
<strong>Output:</strong> []
<strong>Explanation:</strong> The task is impossible.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> num = &quot;0123&quot;
<strong>Output:</strong> []
<strong>Explanation:</strong> Leading zeroes are not allowed, so &quot;01&quot;, &quot;2&quot;, &quot;3&quot; is not valid.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= num.length &lt;= 200</code></li>
	<li><code>num</code> contains only digits.</li>
</ul>

class Solution {
public:
    typedef long long int ll;
    vector<string> ans;
    bool check(string &s){
        if(s.size()==1&&s[0]=='0') return false;
        else if(s.size()>1&&s[0]=='0') return true;
        else return false;
    }
    bool find(string &s,ll index,vector<string> &vs,ll n,ll it){
        if(vs.size()>2){
            if(stol(vs[it-1])!=stol(vs[it-2])+stol(vs[it-3])){
                return 0;
            }
            else if(check(vs[it-1])||check(vs[it-2])||check(vs[it-3])){
                return 0;
            }
        }
        if(index==n) {
            if(vs.size()<3) return 0;
            ans=vs;
            return 1;
        }
        bool ans=0;
        for(ll i=index;i<min(index+12,n);i++){
            if(stol(s.substr(index,i-index+1))>pow(2,31)) continue;
            vs.push_back(s.substr(index,i-index+1));
            ans=ans|(find(s,i+1,vs,n,it+1));
            vs.pop_back();
        }
        return ans;
    }
    vector<int> splitIntoFibonacci(string num) {
        vector<string> vs;
        if(find(num,0,vs,num.length(),0)!=0){
            vector<int> f;
            for(int i=0;i<ans.size();i++){
                f.push_back(stol(ans[i]));
            }
            return f;
        }
        return {};
    }
};
11700