등식

프로그램 명: coci_jednakost(special judge)

제한시간: 1 초

//sj 가 아직... A = S 인 등식이 주어진다. 이 때 좌변에 있는 A 숫자 중간에 + 를 넣어 등식을 성립하게 하는 것이다. 단 숫자의 개수는 최소가 되도록 해야 하고 우변에서 만들어지는 수는 무효의 0 이 들어갈 수 있다.

While browsing a math book, Mirko found a strange equation of the form A=S. What makes the equation strange is that A and S are not the same. Mirko realized that the left side of the equation should have addition operations between some pairs of digits in A.

Write a program that inserts the smallest number of addition operations on the left side to make the equation correct. The numbers in the corrected equation may contain arbitrary amounts of leading zeros.

입력

The first line contains the equation in the form A=S.

A and S will both be positive integers without leading zeros. They will be different.
A will contain at most 1000 digits.
S will be less than or equal to 5000.

Note: The input data will guarantee that a solution, although not necessarily unique, will always exist.

출력

Output the corrected equation. If there are multiple solutions, output any of them.

입출력 예

input 

143175=120 

output 

14+31+75=120 

input 

5025=30 

output 

5+025=30 

input 

999899=125 

output 

9+9+9+89+9=125

출처:2007-2008/regional

[질/답] [제출 현황] [푼 후(0)]

[ 채 점 ] [홈으로] [뒤 로]