poj 1298 The Hardest Problem Ever

题目很水，十分水，之所以要做，是想练习一下STL，好久没有用了，map不解释。

#include <cstdio>
#include <iostream>
#include <string>
#include <map>
using namespace std;
string Plain = "VWXYZABCDEFGHIJKLMNOPQRSTU";
int main()
{
    map<char,char> mp;
    for(int i=0;i<26;i++)
    {
        mp['A'+i] = Plain[i];
    }
    string end = "ENDOFINPUT";
    string s;
    string e;
    string str;
    while(1)
    {
        cin>>s;
        if(s == end)
        {
            break;
        }
        getchar();
        char c;
        while((c = cin.get()) != '\n')
            str += c;
//        getchar();

        cin>>e;

        for(int i=0;i<str.size();i++)
        {
            if('A'<=str[i] && str[i]<='Z')
                cout<<mp[str[i]];
            else
                cout<<str[i];
        }
        str.clear();
        cout<<endl;
    }
    return 0;
}