poj3749 破译密码

题目链接：http://poj.org/problem?id=3749
题意：中文题
解析：那个map存一下，直接转换就好

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstring>
#include <queue>
#include <cmath>
#include <map>
using namespace std;
const int maxn = 1e6+100;
const int inf = 0x7ffffff;
char tt[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZM";
char mm[] = "VWXYZABCDEFGHIJKLMNOPQRSTU";
map<char,char>maple;
int main(void)
{
    char a[1000];
    int len = strlen(mm);
    for(int i=0;i<len;i++)
        maple[tt[i]] = mm[i];
    while(gets(a)!=NULL)
    {
        if(!strcmp(a,"ENDOFINPUT"))
            break;
        if(!strcmp("START",a))
            continue;
        if(!strcmp("END",a))
            continue;
        int n = strlen(a);
        for(int i=0;i<n;i++)
        {
            if(maple.find(a[i])!=maple.end())
                a[i] = maple[a[i]];
        }
        printf("%s\n",a);
    }
    return 0;
}