<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 {
    vector<int> ans;
public:
    bool isvalid(string s){
        if(s[0]=='0'){
            if(s.size()==1) return true;
            return false;
        }
        return true;
    }
    bool fun(string s,long long int a,long long int b,vector<int> te){
        if(s.size()==0){
            if(te.size()<3){
                return false;
            }
            else{
                ans=te;
                return true;
            }
        }
        long long int val=0;
        for(int i=0;i<s.size();i++){
            val=val*10+(s[i]-'0');
            if(val>INT_MAX){
                break;
            }
            if(val<=INT_MAX && isvalid(s.substr(0,i+1)) && (val==(a+b) || (a==-1 || b==-1))){
                
                te.push_back(val);
                if(fun(s.substr(i+1),b,val,te)){
                    return true;
                }
                te.pop_back();
            }
        }
        return false;
    }
    vector<int> splitIntoFibonacci(string S) {
        vector<int> temp;
        long long a1=-1,a2=-1;
        fun(S,a1,a2,temp);
        for(auto a:ans){
            cout<<a<<" ";
        }
        return ans;
    }
};
11400