Reverse Engineering Problem 2
All submissions for this problem are available.
First line contains an integer T, representing the number of test cases.
For each Test Case, there are three space separated integers, X, Y and Z.
Then X lines follow, where each line contains Y space separated integers.
For each Test Case, the output contains X lines, with each line containing Y space separated integers.
T <= 20
2 <= X, Y <= 300
1 <= Z <= 109
min(X, Y) % 2 == 0
1 <= aij <= 108, where i = [1..X] & j = [1..Y]
|Tags||akshatjain2209, array, easy-medium, matrices, reng2016|
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, SCM chicken, PYP3, CLOJ, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.