codeforces 58E：Expression

Description

One day Vasya was solving arithmetical problems. He wrote down an expression a + b = c in his notebook. When the teacher checked Vasya's work it turned out that Vasya had solved the problem incorrectly. Now Vasya tries to find excuses. He says that he simply forgot to write down several digits in numbers a, b and c, but he can't remember what numbers they actually were. Help Vasya, find such numbers x, y and z, with which the following conditions are met:

x + y = z,
    from the expression x + y = z several digits can be erased in such a way that the result will be a + b = c,
    the expression x + y = z should have the minimal length.

Input

The first and only input line contains the expression a + b = c (1 ≤ a, b, c ≤ 106, a, b and c don't contain leading zeroes) which is the expression Vasya wrote down.
Output

Print the correct expression x + y = z (x, y and z are non-negative numbers without leading zeroes). The expression a + b = c must be met in x + y = z as a subsequence. The printed solution should have the minimal possible number of characters. If there are several such solutions, you can print any of them.
Examples
Input

2+4=5

Output

21+4=25

Input

1+1=3

Output

1+31=32

Input

1+1=2

Output

1+1=2

正解：搜索

解题报告：

　　今天考试T6，9道题里面唯一一道没动的，开始以为是E题就会很难...

　　简单思路就是搜索，每次看一下当前的个位是否相等，如果相等，那么显然可以约掉这个已经相等的个位并只处理高位，当然记得进位；否则，我们考虑a、b、c三个元素，保持两个不变，我们把第三个增加一位使得末位与另外两位对应，然后其余部分直接往前推一位，也就是×10。直到c=0，那么肯定只需要把c的最高位补一个a+b剩下的数就可以了，算一下位数。当然要加一个最优性剪枝。

 //It is made by jump~
 #include <iostream>
 #include <cstdlib>
 #include <cstring>
 #include <cstdio>
 #include <cmath>
 #include <algorithm>
 #include <ctime>
 #include <vector>
 #include <queue>
 #include <map>
 #include <set>
 using namespace std;
 typedef long long LL;
 int ans,ansa,ansb;
 LL mi[];

 inline int getint()
 {
        int w=,q=; char c=getchar();
        while((c<'' || c>'') && c!='-') c=getchar(); if(c=='-') q=,c=getchar();
        while (c>='' && c<='') w=w*+c-'', c=getchar(); return q ? -w : w;
 }

 inline void dfs(LL a,LL b,LL c,LL nowa,LL nowb,LL jin,int nowl,int wei){
     if(nowl>=ans) return ;
     if(a==&&b==&&c==&&jin==) { ans=nowl; ansa=nowa; ansb=nowb; return ; }
     if(c==) {
     int tot=; LL lin=a+b+jin; while(lin) tot++,lin/=;//全部加给c
     dfs(,,,nowa+a*mi[wei],nowb+b*mi[wei],,nowl+tot,wei);
     return;
     }
     if((a+b+jin)%==c%) dfs(a/,b/,c/,nowa+a%*mi[wei],nowb+b%*mi[wei],(a%+b%+jin)/,nowl,wei+);//去掉已经相等的低位部分，记得给公共的低位部分进位
     else{
     dfs(a*+(c+-b%-jin)%,b,c,nowa,nowb,jin,nowl+,wei);//a后面加一位与前两个数还有进位的和的个位部分
     dfs(a,b*+(c+-a%-jin)%,c,nowa,nowb,jin,nowl+,wei);//b后面加一位与前两个数还有进位的和的个位部分
     dfs(a,b,c*+(a+b+jin)%,nowa,nowb,jin,nowl+,wei);///c后面加一位与前两个数还有进位的和的个位部分
     }
 }

 inline void work(){
     int a,b,c;  scanf("%d+%d=%d",&a,&b,&c);
     ans=; mi[]=; for(int i=;i<=;i++) mi[i]=mi[i-]*;
     dfs(a,b,c,,,,,);
     printf("%d+%d=%d",ansa,ansb,ansa+ansb);
 }

 int main()
 {
   work();
   return ;
 }