func_code_string: #include <bits/stdc++.h>   using namespace std;   char opt;   long long a, b, c, ansa, ansb, ansc, anslen = 15;   void dfs(long long a, long long b, long long c, long long nowa, long long nowb,            int pre, long long len, long long step) {     if (len >= anslen) return;     if (!a && !b && !c && !pre) {       ansa = nowa, ansb = nowb, anslen = len;       return;     }     if (!c) {       long long tmp = a + b + pre;       int cnt = 0;       while (tmp) cnt++, tmp /= 10;       dfs(0, 0, 0, nowa + step * a, nowb + step * b, 0, len + cnt, step);       return;     }     if ((a + b + pre) % 10 == c % 10) {       dfs(a / 10, b / 10, c / 10, nowa + step * (a % 10), nowb + step * (b % 10),           (a % 10 + b % 10 + pre) / 10, len, step * 10);       return;     }     dfs(a * 10 + (c + 10 - b % 10 - pre) % 10, b, c, nowa, nowb, pre, len + 1,         step);     dfs(a, b * 10 + (c + 10 - a % 10 - pre) % 10, c, nowa, nowb, pre, len + 1,         step);     dfs(a, b, c * 10 + (a + b + pre) % 10, nowa, nowb, pre, len + 1, step);   }   int main() {     cin >> a >> opt >> b >> opt >> c;     dfs(a, b, c, 0, 0, 0, 0, 1);     cout << ansa <<  +  << ansb <<  =  << ansa + ansb << endl;     return 0;   }   