TJU 3007 D Decoding(精简版）

TJU 3007  D 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: 

 

1. The text is formed with uppercase letters [A-Z] and <space>.
2. Each text character will be represented by decimal values as follows:
<space> = 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:

 

 

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.

Sample Input

4
4 4 0000110100101100
5 2 0110000010
2 6 010000001001
5 5 0100001000011010110000010

 

Sample Output1

1 ACM
2  HI
3  HI
4  HI HO

#include<stdio.h>
#include<string.h>
int dif[4][2]={0,1,1,0,0,-1,-1,0};//右，下，左，上。方向是以右下左上循环
char map[20][20],str[400],str1[400];
int main()
{
       int r,c,i,j,k,a,b,t,ca,cas,len;
       scanf("%d",&cas);
       for(ca=1;ca<=cas;ca++)
       {
              scanf("%d%d%s",&r,&c,str);
              for(j=0;str[j]!=0;j++)//将字符串转到二维数组里
                     map[j/c][j%c]=str[j];
              i=j=t=0;k=1;
           a=0;b=1;//默然方向向右
              while(1)
              {
                     str[t++]=map[i][j];
                     if(t==r*c) break;
                     map[i][j]='2';
                     if(i+a==r||i+a<0||j+b==c||j+b<0||map[i+a][j+b]=='2')//当按原来方向走不符合条件是执行下1个方向
                     {     a=dif[k%4][0];
                            b=dif[k%4][1];//方向以四为周期循环
                            k=(k+1)%4;
                     }
                     i+=a;j+=b;                    
              }
              len=0;
              for(i=0;i+4<t;i+=5)
              {
                     int sum=0;
                     for(j=i;j<i+5;j++)//将二进制转换成十进制
                            sum=sum*2+str[j]-'0';
                     if(sum==0) str1[len++]=' ';
                     else str1[len++]='A'+sum-1;
              }
              while(str1[len-1]==' ') len--;//去掉多余的空格
              str1[len]=0;
              printf("%d %s/n",ca,str1);
       }
       return 0;
}