Merging (part 1)

Statement

Goal

You have 2 square NxN tables, contains only # and & symbols. You need to merge them to one so that all # are replaced all matching &.

Input

On the first line you have number N, size of tables.
On next 2*N+1 lines you have table sets, separated with empty line.

Output

N lines, set of new table.

Constraints

Example

Input

2
&#
#&

&&
&&

Output

&#
#&

Game modes

Fastest, Shortest

Test cases

Only one Test

Input

2 &# #& && &&

Output

&# #&

Key in Lock Validator

Input

3 ### &&& ### &&& ### &&&

Output

### ### ###

Overlay Test

Input

5 ##### &#&#& #&#&# &&&&& ##### ##### #&#&# #&#&# ##&## &&&&&

Output

##### ##### #&#&# ##&## #####

Alone Validator

Input

1 & #

Output

X-pattern Test

Input

8 ######## #&&&&&&# #&&&&&&# #&&&&&&# #&&&&&&# #&&&&&&# #&&&&&&# ######## &&&&&&&& &#&&&&#& &&#&&#&& &&&##&&& &&&##&&& &&#&&#&& &#&&&&#& &&&&&&&&

Output

######## ##&&&&## #&#&&#&# #&&##&&# #&&##&&# #&#&&#&# ##&&&&## ########

Randomized 13x13 Validator

Input

13 &#&#&&&&&&&## #&&&#&&&&&&&& &&&&&##&&#&&& &&&&#&&&&#&&& ##&&##&&&&#&& &&#&&#&&&&&&& &&&&#&&#&&#&& #&&&&&&&#&#&# &&&&&&&##&#&& &&&&###&&&&&# &&&&#&#&&&#&& &&#&&&&&#&&&& &&&&&&#&&&&#& #&&&&#&&&&&&& &&#&&#&#&&#&& &&&&#&&&#&#&& &#&&&##&&###& #&&&######&&& &#&#&#&&&#&&& &&&&&##&#&#&& ##&&&&&&####& ###&&&#&##&#& &&&&#&&#&&&## #&&&&#&&&#&&# &#&&&&#&&&#&& #&&&&&###&&&&

Output

##&#&#&&&&&## #&#&##&#&&#&& &&&&###&###&& &#&&###&&###& ##&&#######&& &###&#&&&#&&& &&&&#####&#&& ##&&&&&&##### ###&&&######& &&&&####&&&## #&&&###&&##&# &##&&&#&#&#&& #&&&&&###&&#&

Same tables Test

Input

3 #&# &#& #&# #&# &#& #&#

Output

#&# &#& #&#

Randomized 6x6 Validator

Input

6 &&&&&& ##&&&# #&&#&& &&#&#& #####& &#&&&& &&#&#& ##&### ##&&#& &&&##& #&###& &###&&

Output

&&#&#& ##&### ##&##& &&###& #####& &###&&

Randomized 10x10 Test

Input

10 ###&&#&### #####&&&## #&&&&&&&#& &&#&&&&&&& &&#&&&&&## &#&#####&# #&&&###### ##&#&&#&&& &##&&&&&## ###&&####& &&&&&##### &#&###&&## &####&###& &&##&&#&&& ##&##&&&&& ###&#&##&# &&#&##&#&& &#&#&&#### &##&&###&& #&&#&&#&&#

Output

###&&##### ######&&## #####&###& &&##&&#&&& #####&&&## ########&# #&#&###### ##&#&&#### &##&&##### ####&#####

Randomized 25x25 Validator

Input

25 #&&&&#&&#&&&&&&&&&&&&&#&# &&&&&&####&##&#&&##&&&##& #&&##&&&###&#&&#&#&##&#&& &#&&&&##&&#&##&&#&&#&#&&& &&&#&&&&&#&&#&#&&#&##&&&& &#&###&###&&###&##&#&&&&& #&#&#&&&&#&&&&&&&&#&&&&&& &&&&#&&&#####&&#&#&&#&&#& &&#&&#&#&&&&&&&&&&#&##&#& &#&&&##&&&&#&#&#&&&&&#&&& #&&&&#&&#&&##&#&&#&&#&### &&&#&&&##&&#&##&&&#&&&&#& #&&&#&&&&&&#&&#&&####&##& #&&&&&##&&&##&#&#&&&#&### &###&&&&&&#&&&&&##&#&&### ###&&&#&&#&&&&#&&&&&&&#&& &&#&#&######&#&#&&&&&&#&& &&#&&&#&&#&#&&##&&&&##&## &&&###&#&&&#&&&&#&#&&&&#& &&&##&&&&&&#&#&&&&&&&&&#& &#&&&&#&#&#&##&&&##&&&#&& ##&#&&&&##&#&#&&&&&&&&&&& &&&##&&&#&&&#&#&##&##&&&& #&####&&#&#&&&&&&&&&#&&#& &&&&####&&&&&#&&&&&&&&#&# &#&##&&&&#&#&&&&&#&&&&&#& &&&#&#&&##&&&&###&&&##&&# #&####&&&##&&&#&&&###&&&& &&#&#&##&&#&&###&#&&&&&## &###&&##&&&&&#&&&&&&##&&# #&&#&&#&#&&#&#&##&#&&&&&& &&#&&&&&&&&#&&#&&&&&&#&&& &&&#&&&#&#&#&&&##&&&#&#&& &#&&&&&&&#&#&##&##&&&&#&# #&##&&&#&&##&&&&&###&&&&& #&&&&&&##&&&#&&#&&&&&&&## &&&&&#&#&#&&#####&&&&&&#& #&&#&#&###&&&&#&##&&#&&#& &&#&&#&&&&&&&&&&&&#&&#&&# &#&&&#&##&#&&&##&&&&&&#&# &&&&&&&&#&&&&#&&&&&&&&### &&&&&#&&&&&&&#&&#&&#&&&&& &&##&&&&&&&#&##&&&###&#&& &##&&&#&&#&&&&&&&&&&#&#&# &&#&&&&&&#&&#&&#&&#&#&#&& &&&&&&&&#&#&&#&&#&&&&&#&& &&####&&#&&#&&#&&&&#&#&&& &#&&#&#&&&#&&#&&&#&&#&&&# &&&&&##&&#&##&#&##&&##&&& &&&&#&&&#&##&&#&&&&##&&&#

Output

##&###&&##&#&&&&&#&&&&### &&&#&#####&##&#####&##### #&####&&###&#&##&####&#&& &##&#&##&&#&######&#&#&## &###&&##&#&&###&&#&###&&# ##&#######&#########&&&&& #&#&#&&&&#&#&&#&&&#&&#&&& &&&##&&######&&###&&#&##& &##&&#&#&#&#&##&###&##### ####&###&&##&#&#&###&#&&& #&&&&#&##&&##&##&#&&#&### &&&#&#&###&######&#&&&&#& #&&###&###&#&&#&#####&##& #&#&&###&&&##&#&#&#&##### &###&#&##&#&&&####&#&&### ###&&&#&##&&&##&&&&&&&### &&#&########&#&##&&#&&#&& &&##&&#&&#&#&###&&####### &#######&#&#&&&&#&#&#&### &&###&&&&#&###&#&&#&#&##& &#&&&&#&#&#&##&&###&&&#&& ######&&##&#&##&&&&#&#&&& &#&##&#&#&#&###&##&##&&&# #&#####&#####&#&##&&##&#& &&&&#####&##&##&&&&##&#&#

Solution language

Solution

Stub generator input

Comments

10 Comments

CodinBot Unnamed CodinGamer

almost 4 years ago

Hey CodinGamer! Your contribution has unfortunately not been moderated on time and will temporarily be removed from the system... But no worries! You can republish it anytime to give it another chance! :)

Lecerf Unnamed CodinGamer

Need to be more clear in the explanation of merging: " You need to merge them to one so that all # are replaced all matching &." -> " You need to merge them to one table where all # symbol have replaced all matching & (it is a "OR" operation)." This puzzle can also be in "reverse mode".

coderinblack Unnamed CodinGamer

So far, comments have been mostly about clarity about the input so that is something I would definitely work on.

Jef808 Unnamed CodinGamer

Since it is difficult to clearly word this problem's instructions without essentially describing an algorithm for solving it (mentioning positions of '#' characters in first table that have '&' characters in the second table), this should only be considered as a "Reverse" mode problem in my opinion. It would be kind of nice!

FoxLee Unnamed CodinGamer

Needs lots of improvement in explaining the rules of "merge".

Boulet Unnamed CodinGamer

no interest and the merge process is not clear enough

Better not to make a sequence in the title (part1, part2, ...) because these quiz come out randomly with no option to let players select.

Q12 Unnamed CodinGamer

about 4 years ago

I like it but ithink you need to be little more clear int the input explanation.

ItsAFeature Unnamed CodinGamer

For the Stub generator input I would suggest this: read a:int loop a read lineTable1:word(100) read empty:word(0) loop a read lineTable2:word(100) write answer

kusrabyzarc Unnamed CodinGamer

thxvm