ABSYS - Anti-Blot System

no tags 

Jimmy is a hard-working 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 non-empty 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 = 77038
Output:
23 + 47 = 70
3247 + 502 = 3749
1613 + 75425 = 77038

Note: int in C++/C/Java or longint in Pascal is enough.


hide comments
tor_el: 2017-03-18 15:35:34

Last edit: 2017-03-18 16:02:41
shauryauppal: 2017-03-07 14:23:49

use stringstream to convert string to int

also study about cin.ignore() to solve the problem

Last edit: 2017-03-07 14:29:17
imshubhamk: 2017-02-25 09:53:05

just keep in mind the spaces between numbers and blank lines between test cases. caused me errors..

vladimira: 2017-02-21 10:47:14

The problem can be extended to new SPOJ problems, more difficult. Its the hint for enthusiasts

Last edit: 2017-02-21 10:48:13
nilabja16180: 2017-02-09 19:44:42

Easy!!

dgfreak: 2017-02-09 00:04:55

Beware the empty lines between each formula. Cost me the first AC...

ayushagg31: 2017-01-26 05:54:38

AC in one go!!!!!! just take input of all strings in different variable and use atoi function......

rahulsahuhr: 2016-12-21 07:20:57

@narutohokage_1
None of the test cases include the type of input you commented.

soodan: 2016-12-10 18:29:47

AC in one go

mohitgupta07: 2016-11-16 22:44:01

Easy one for Java coders :) :) .


Added by:Fudan University Problem Setters
Date:2007-12-01
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: C99 ERL JS-RHINO
Resource:IPSC 2007