Hello World！【Hello World】

/*
Hello World!
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 454    Accepted Submission(s): 170


Problem Description
Your task is to print ... er ... "Hello World" ... in a fantastic way -- using a beautiful font.

I've sent you a nice font for you to use, but I'm too busy to tell you how. Can you help yourself?
 

Input
The first line contains a single integer T (T <= 20), the number of test cases. 
Each case begins with an integer C (1 <= C <= 80) in a single line, then each of the following C lines contains five two-digit numbers in hex (letters will be in uppercase). Don't ask me what they mean, I'm too busy...

 

Output
For each test case, print the case number in the first line, then followed by a blank line.
After that, print all T characters. Use a single blank column of spaces between two consecutive characters. Each line should have exactly 6C-1 character (again, don't ask me why).
Don't forget to print another blank line after the output of each test case.
 

Sample Input
2
11
7F 08 08 08 7F
38 54 54 54 18
00 41 7F 40 00
00 41 7F 40 00
38 44 44 44 38
00 00 00 00 00
3F 40 38 40 3F
38 44 44 44 38
7C 08 04 04 08
00 41 7F 40 00
38 44 44 48 7F
5
14 08 3E 08 14
04 02 01 02 04
40 40 40 40 40
04 02 01 02 04
14 08 3E 08 14
 

Sample Output
Case 1:

#   #        ##    ##               #   #              ##       #
#   #         #     #               #   #               #       #
#   #  ###    #     #    ###        #   #  ###  # ##    #    ## #
##### #   #   #     #   #   #       # # # #   # ##  #   #   #  ##
#   # #####   #     #   #   #       # # # #   # #       #   #   #
#   # #       #     #   #   #       # # # #   # #       #   #   #
#   #  ###   ###   ###   ###         # #   ###  #      ###   ####

Case 2:

        #           #        
  #    # #         # #    #  
# # # #   #       #   # # # #
 ###                     ### 
# # #                   # # #
  #                       #  
            #####            
 

Source
2009 Asia Regional Ningbo Online 
*/
#include<stdio.h>
int main()
{
	int n, t, i, num = 1, m[81][5], j, k, a[10];
	scanf("%d", &t);
	for(i = 0; i < 8; i++)
	a[i] = (1 << i);//行验证 
	while(t--)
	{
		scanf("%d", &n);
		for(i = 0;i < n; i++)
			scanf("%x%x%x%x%x", &m[i][0], &m[i][1], &m[i][2], &m[i][3],&m[i][4]);
			printf("Case %d:\n\n", num++);
		for(i = 0;i < 7; i++)//行 
		{
			for(j = 0; j < n; j++)//第几个字 
			{
				for(k = 0; k < 5; k++)//第几列 
				{
					if( m[j][k] & a[i])
					printf("#");
					else
					printf(" ");
				}
				if(j != n-1)
				printf(" ");
			}
			printf("\n");
		}
		printf("\n");
	}
	return 0;
}
//每5个16进制为一个字，每一个16进制为一列 







/*
#include<stdio.h>
#include<string.h>
int main()
{
	char s[8][81], c[15];
	int n, num = 1, j;
	scanf("%d", &n);
	while( n--)
	{
		int m, i;
		scanf("%d", &m);
		memset(s,' ',sizeof(s));
		getchar();
		for(i = 0; i < m; i++)
		{
			gets(c);
			int k = 5 * i;
			for(j = 0; j < 14; j += 3, k++)
			switch (c[j])
			{
				case '1':s[4][k] = '#';break;
				case '2':s[5][k] = '#';break;
				case '4':s[6][k] = '#';break;
				case '8':s[7][k] = '#';break;
				case '3':s[4][k] = '#';s[5][k] = '#';break;
				case '5':s[4][k] = '#';s[6][k] = '#';break;
				case '9':s[4][k] = '#';s[7][k] = '#';break;
				case '6':s[5][k] = '#';s[6][k] = '#';break;
				case 'A':s[5][k] = '#';s[7][k] = '#';break;
				case 'C':s[6][k] = '#';s[7][k] = '#';break;
				case '7':s[4][k] = '#';s[5][k] = '#';s[6][k] = '#';break;
				case 'B':s[4][k] = '#';s[5][k] = '#';s[7][k] = '#';break;
				case 'D':s[4][k] = '#';s[6][k] = '#';s[7][k] = '#';break;
				case 'E':s[5][k] = '#';s[6][k] = '#';s[7][k] = '#';break;
				case 'F':s[4][k] = '#';s[5][k] = '#';s[6][k] = '#';s[7][k] = '#';break;
			}
			for(j = 1, k = 5 * i; j < 14; j += 3, k++)
			switch (c[j] )
			{
				case '1':s[0][k] = '#';break;
				case '2':s[1][k] = '#';break;
				case '4':s[2][k] = '#';break;
				case '8':s[3][k] = '#';break;
				case '3':s[0][k] = '#';s[1][k] = '#';break;
				case '5':s[0][k] = '#';s[2][k] = '#';break;
				case '9':s[0][k] = '#';s[3][k] = '#';break;
				case '6':s[1][k] = '#';s[2][k] = '#';break;
				case 'A':s[1][k] = '#';s[3][k] = '#';break;
				case 'C':s[2][k] = '#';s[3][k] = '#';break;
				case '7':s[0][k] = '#';s[1][k] = '#';s[2][k] = '#';break;
				case 'B':s[0][k] = '#';s[1][k] = '#';s[3][k] = '#';break;
				case 'D':s[0][k] = '#';s[2][k] = '#';s[3][k] = '#';break;
				case 'E':s[1][k] = '#';s[2][k] = '#';s[3][k] = '#';break;
				case 'F':s[0][k] = '#';s[1][k] = '#';s[2][k] = '#';s[3][k] = '#';break;
			}
		}
		printf("Case %d:\n\n", num++);
		for(i = 0; i < 8; i++)
		{
			for(j = 0; j < m * 5; j++)
			{
				printf("%c", s[i][j]);
				if(j % 5 == 4)
				printf(" ");
			}
			printf("\n");
		}
	}
	return 0;
} 
*///所谓 的‘标准’答案.....