ABSYS  AntiBlot System
Jimmy is a hardworking pupil in his second year at primary school. Recently he decided to convert all his notes into an electronic version. Sadly, he found that his math notes were full of ink blots.
He scanned the notes and sent them through his own OCR package
(yes, he coded it all by himself at the age of 8).
The OCR package replaced all ink blots by the string "machula
".
Problem specification
You are given Jimmy's notes, processed by the OCR. They contain simple math exercises, which were used to practice addition on positive integers. Your task is to recover the damaged part of the notes.
Input specification
The first line of the input file contains an integer T specifying the number of test cases. Each test case is preceded by a blank line.
Each test case consists of exactly one line.
The line represents an equation of the form "number + number = number
",
where each number
is a positive integer.
One part of the equation will be replaced by the string "machula
".
The string always covers a contiguous nonempty sequence of digits, possibly even an entire
number. You may assume that for each equation in the input there will be
exactly one way to fill in the missing digits.
Output specification
For each test case, the output shall contain one line of the form
"number + number = number
". The line must represent the equation
from that test case with all missing digits filled in.
Example
Input:3 23 + 47 = machula 3247 + 5machula2 = 3749 machula13 + 75425 = 77038Output:
23 + 47 = 70 3247 + 502 = 3749 1613 + 75425 = 77038
Note: int in C++/C/Java or longint in Pascal is enough.
hide comments
nitisha1:
20170917 13:13:26
AC in one go............ 

nwarrior:
20170824 17:20:54
One of the easiest problem accepted in one go


jamesx_:
20170621 19:08:34
Interesting one. Beware of blank lines in between test cases, it cost me a couple of attempts. 

sandeep_4141:
20170618 12:13:36
python3 input().split()> made it easy 

sanjay5797:
20170611 19:03:10
string manipulation:)....inbuilt library functions!!!!!!....AC in one GO!!!!!


ashwani0605:
20170531 15:59:57
Difficulty depends on language of choice Last edit: 20170531 16:00:11 

ayushgupta1997:
20170520 10:08:41
nice problem ac in one go:


newbie_127:
20170517 16:41:22
Very Good Problem


onenightstand:
20170408 19:24:10
AC in first go...


akhil9093:
20170325 20:47:36
make sure about the blank lines above every test case..!!overall its a easy one 
Added by:  Fudan University Problem Setters 
Date:  20071201 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: C99 ERL JSRHINO 
Resource:  IPSC 2007 