GNY07D  Decoding
Chip and Dale have devised an encryption method to hide their (written) text messages. They first agree secretly on two numbers that will be used as the number of rows (R) and columns (C) in a matrix. The sender encodes an intermediate format using the following rules:
 The text is formed with uppercase letters [AZ] and
.  Each text character will be represented by decimal values as follows:
= 0, A = 1, B = 2, C = 3, ..., Y = 25, Z = 26
The sender enters the 5 digit binary representation of the characters’ values in a spiral pattern along the matrix as shown below. The matrix is padded out with zeroes (0) to fill the matrix completely. For example, if the text to encode is: "ACM" and R=4 and C=4, the matrix would be filled in as follows:
A = 00001, C = 00011, M = 01101 (one extra 0)
The bits in the matrix are then concatenated together in row major order and sent to the receiver. The example above would be encoded as: 0000110100101100
Input
The first line of input contains a single integer N, (1 ≤ N ≤ 1000) which is the number of datasets that follow.
Each dataset consists of a single line of input containing R (1<=R<=20), a space, C (1<=C<=20), a space, and a string of binary digits that represents the contents of the matrix (R * C binary digits). The binary digits are in row major order.
Output
For each dataset, you should generate one line of output with the following values: The dataset number as a decimal integer (start counting at one), a space, and the decoded text message. You should throw away any trailing spaces and/or partial characters found while decoding.
Example
Input: 4 4 4 0000110100101100 5 2 0110000010 2 6 010000001001 5 5 0100001000011010110000010 Output: 1 ACM 2 HI 3 HI 4 HI HO
hide comments
thiefthief:
20200409 13:35:21
AC first chance


nares_agarwal:
20180225 18:11:04
For checking trailing spaces test cases are


nares_agarwal:
20180225 18:08:22
Getting WA due to not throwing away all trailing spaces and not printing dataset number.


yogesh97:
20171127 16:58:39
0 is for space


gaurav_jain21:
20161208 18:28:48
Involves ds manipulation.


hasan2013:
20160321 18:43:00
nice one !


minhthai:
20160306 09:43:35
nice! 

levim:
20160116 00:45:27
Nice problem! Enjoyed solving this 

Prasath:
20140623 12:37:52
my 50th :) 

Mahavir Chopra:
20130125 12:15:13
please provide some test cases wrking for above but giving WA

Added by:  Marco Gallotta 
Date:  20080311 
Time limit:  19.86s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  ACM Greater New York Regionals 2007 