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.


Added by:[Trichromatic] XilinX
Date:2007-12-01
Time limit:0.133s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel Pentium G860 3GHz)
Languages:All except: C99 strict ERL JS SCM chicken
Resource:IPSC 2007

hide comments
Prasanna Patil: 2015-04-16 13:43:43

Python Simply ROCKSSS

Shashank kumar: 2015-04-03 14:15:33

INPUT INPUT INPUT and you are done (y) :D

****: 2015-03-29 19:46:31

trivial one, accepted in one go

partybuoy: 2015-03-28 08:55:06

Got right answer on ideone but getting WA everytime on spoj
Pls help me out
http://ideone.com/*******

Last edit: 2015-03-29 18:31:11
arjun: 2015-03-25 17:18:19

Though ur IO Format is correct, it mat still show you error.
If it is, then change the input string in to size of 1000;
i.e.: char a[1000],...;

Costed me 3 WA s. Finally AC... (after 3 hours...)

Last edit: 2015-03-25 17:19:35
gulbarga master: 2015-02-18 11:52:58

getting NZEC with python... works fine locally. Any clues ?

Ekta: 2015-02-14 06:49:17

What's the use of blank line before input, such things usually go unnoticed and a cause of lot of time and WAs!! :\

sharif ullah: 2015-02-08 15:42:55

why spoj show WA for space ??.what is the use of such space in programming

Andrey Kaygorodov: 2015-01-31 12:57:26

It was hard to meet the time limit by using java. You have to use all possible optimizations. Precompile your regexs, use BufferedReader instead of Scanner. Use PrintWriter.

Rahul Jain: 2015-01-25 00:54:52

I forgot removing freopen() functions and it gave me TLE, when I submitted the same code after removing freopen(), it was accepted. Can anybody tell me why it happened?