2013 多校第九场 hdu 4690 EBCDIC（打表）

题目：http://acm.hdu.edu.cn/showproblem.php?pid=4690

题目大意：两个表里的坐标转换，给你一个偶数个长度的序列，两个两个表示某个字符再第一个表里的坐标，然后让你转化成第二个表里的坐标，然后输出就好了。

思路：打表。。。 = =

先是我比赛时侯的代码，先开始有的用 for 做，i 直接从 ‘0’ 循环到 ‘A’ ，但是这两个的 ASCII 不是连着的，因为这个地方，查了好久。。 

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;

#define MP make_pair

map < pair <char,char>,pair<char,char> > mm;

void init()
{
    mm[MP('0','0')] = MP('0','0');mm[MP('0','1')] = MP('0','1');mm[MP('0','2')] = MP('0','2');mm[MP('0','3')] = MP('0','3');mm[MP('3','7')] = MP('0','4');mm[MP('2','D')] = MP('0','5');mm[MP('2','E')] = MP('0','6');mm[MP('2','F')] = MP('0','7');mm[MP('1','6')] = MP('0','8');mm[MP('0','5')] = MP('0','9');mm[MP('2','5')] = MP('0','A');mm[MP('0','B')] = MP('0','B');mm[MP('0','C')] = MP('0','C');mm[MP('0','D')] = MP('0','D');mm[MP('0','E')] = MP('0','E');mm[MP('0','F')] = MP('0','F');

    for(int i = '0';i<='3';i++) {mm[MP('1',i)] = MP('1',i);} mm[MP('3','C')] = MP('1','4');mm[MP('3','D')] = MP('1','5');mm[MP('3','2')] = MP('1','6');mm[MP('2','6')] = MP('1','7');mm[MP('1','8')] = MP('1','8');mm[MP('1','9')] = MP('1','9');mm[MP('3','F')] = MP('1','A');mm[MP('2','7')] = MP('1','B');for(int i = 'C';i<='F';i++) {mm[MP('1',i)] = MP('1',i);}

    mm[MP('4','0')] = MP('2','0');mm[MP('5','A')] = MP('2','1');mm[MP('7','F')] = MP('2','2');mm[MP('7','B')] = MP('2','3');mm[MP('5','B')] = MP('2','4');mm[MP('6','C')] = MP('2','5');mm[MP('5','0')] = MP('2','6');mm[MP('7','D')] = MP('2','7');mm[MP('4','D')] = MP('2','8');mm[MP('5','D')] = MP('2','9');mm[MP('5','C')] = MP('2','A');mm[MP('4','E')] = MP('2','B');mm[MP('6','B')] = MP('2','C');mm[MP('6','0')] = MP('2','D');mm[MP('4','B')] = MP('2','E');mm[MP('6','1')] = MP('2','F');

    for(int i = '0';i<='9';i++) {mm[MP('F',i)] = MP('3',i);} mm[MP('7','A')] = MP('3','A');mm[MP('5','E')] = MP('3','B');mm[MP('4','C')] = MP('3','C');mm[MP('7','E')] = MP('3','D');mm[MP('6','E')] = MP('3','E');mm[MP('6','F')] = MP('3','F');

    mm[MP('7','C')] = MP('4','0');
    for(int i = '1',j = '1';j<='9';j++,i++)
    {
        mm[MP('C',i)] = MP('4',j);
    }
    for(int i = '1',j = 'A';j<='F';i++,j++)
    {
        mm[MP('D',i)] = MP('4',j);
    }

    for(int i = '7',j = '0';j<='2';i++,j++)
    {
        mm[MP('D',i)] = MP('5',j);
    }
    for(int i = '2',j = '3';j<='9';i++,j++)
    {
        mm[MP('E',i)] = MP('5',j);
    }
    mm[MP('E','9')] = MP('5','A');
    mm[MP('B','A')] = MP('5','B');mm[MP('E','0')] = MP('5','C');mm[MP('B','B')] = MP('5','D');mm[MP('B','0')] = MP('5','E');mm[MP('6','D')] = MP('5','F');

    mm[MP('7','9')] = MP('6','0');
    for(int i = '1',j = '1';i<='9';i++,j++)
    {
        mm[MP('8',i)] = MP('6',j);
    }
    for(int i = '1', j = 'A';j<='F';i++,j++)
    {
        mm[MP('9',i)] = MP('6',j);
    }

    for(int i = '7',j = '0';j<='2';i++,j++)
    {
        mm[MP('9',i)] = MP('7',j);
    }
    for(int i = '2',j = '3';j<='9';i++,j++)
    {
        mm[MP('A',i)] = MP('7',j);
    }
    mm[MP('A','9')] = MP('7','A');
    mm[MP('C','0')] = MP('7','B');mm[MP('4','F')] = MP('7','C');mm[MP('D','0')] = MP('7','D');mm[MP('A','1')] = MP('7','E');mm[MP('0','7')] = MP('7','F');
}

const int MAXN = 11111111;

char str[MAXN];

int main()
{
    init();
    while(~scanf("%s",str))
    {
        int len = strlen(str);
        for(int i = 0;i<len;i += 2)
        {
            if(mm.find(MP(str[i],str[i+1]))!=mm.end())
                printf("%c%c",mm[MP(str[i],str[i+1])].first,mm[MP(str[i],str[i+1])].second);
        }

        puts("");
    }
    return 0;
}

这样打好累，一个一个找，眼睛都花了，后来一听说，别人的打表方式和我们的不一样，怪不得他说给你复制表格的地方了呢。。 

他就是用矩阵存进去，然后再暴力找。。 然后又自己打了一遍，发现这样也同样好累，要打双引号、逗号和空的地方。。= =

代码如下：

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;

typedef __int64 lld;

struct Node
{
    char s[11];
};

Node a[22][22] = {
{"NUL","SOH","STX","ETX","","HT","","DEL","","","","VT","FF","CR","SO","SI"},
{"DLE","DC1","DC2","DC3","","","BS","","CAN","EM","","","IFS","IGS","IRS","IUS","ITB"},
{"","","","","","LF","ETB","ESC","","","","","","ENQ","ACK","BEL"},
{"","","SYN","","","","","EOT","","","","","DC4","NAK","","SUB"},
{"SP","","","","","","","","","","",".","<","(","+","|"},
{"&","","","","","","","","","","!","$","*",")",";",""},
{"-","/","","","","","","","","","",",","%","_",">","?"},
{"","","","","","","","","","`",":","#","@","'","=","\""},
{"","a","b","c","d","e","f","g","h","i","","","","","",""},
{"","j","k","l","m","n","o","p","q","r","","","","","",""},
{"","~","s","t","u","v","w","x","y","z","","","","","",""},
{"^","","","","","","","","","","[","]","","","",""},
{"{","A","B","C","D","E","F","G","H","I","","","","","",""},
{"}","J","K","L","M","N","O","P","Q","R","","","","","",""},
{"\\","","S","T","U","V","W","X","Y","Z","","","","","",""},
{"0","1","2","3","4","5","6","7","8","9","","","","","",""}
};

Node b[22][22] = { {"NUL","SOH","STX","ETX","EOT","ENQ","ACK","BEL","BS","HT","LF","VT","FF","CR","SO","SI"},
{"DLE","DC1","DC2","DC3","DC4","NAK","SYN","ETB","CAN","EM","SUB","ESC","IFS","IGS","IRS","IUS","ITB"},
{"SP","!","\"","#","$","%","&","'","(",")","*","+",",","-",".","/"},
{"0","1","2","3","4","5","6","7","8","9",":",";","<","=",">","?"},
{"@","A","B","C","D","E","F","G","H","I","J","K","L","M","N","O"},
{"P","Q","R","S","T","U","V","W","X","Y","Z","[","\\","]","^","_"},
{"`","a","b","c","d","e","f","g","h","i","j","k","l","m","n","o"},
{"p","q","r","s","t","u","v","w","x","y","z","{","|","}","~","DEL"}
};

char str[11111111];

int main()
{
    while(~scanf("%s",str))
    {
        int len = strlen(str);
        for(int i = 0;i<len;i += 2)
        {
            int x,y;
            if('0'<=str[i]&&str[i]<='9')
                x = str[i] - '0';
            else x = str[i] - 'A' + 10;
            if('0'<=str[i+1]&&str[i+1]<='9')
                y = str[i+1] - '0';
            else y = str[i+1] - 'A' + 10;

            if(a[x][y].s[0]=='\0') continue;
            int ok = 0;
            for(int j = 0;j<=7&&!ok;j++)
            {
                for(int k = 0;k<=15;k++)
                    if(strcmp(a[x][y].s,b[j][k].s)==0)
                    {
                        printf("%d",j);
                        if(k<=9)
                            printf("%d",k);
                        else printf("%c",k - 10 + 'A');
                        ok = 1;
                        break;
                    }
            }
        }
        puts("");
    }
    return 0;
}