poj 2503 map辞書ツリー構築

2118 ワード

文字列--辞書ツリー STL

问题解:mapを使うのは简単です.ただ入力に問題があり、scanfでどうせ私は運転に成功しなかった.すると、1文字ずつ入力します.の

#include
#include
#include
#include
#include
using namespace std;

map qq;
map p;

char a[1001],b[1001],c[1001];

int main()
{
    while(1)
    {

        char t;
        if((t=getchar())=='
')
          break;
        else
        {
            int i=0,j=0;
            a[i++]=t;
            while(1)
            {
               t=getchar();
               if(t==' ')
                  {
                    a[i]='\0';
                    break;
                  }
                else
                   a[i++]=t;
            }
        }
        scanf("%s",b);
        getchar();
        qq[b]=a;
        p[b]=1;
    }
    while(scanf("%s",c)!=EOF)
    {
        if(p[c])
            cout<

Babelfish
Time Limit: 3000MS

Memory Limit: 65536K
Total Submissions: 32988

Accepted: 14189
Description You have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.
Input Input consists of up to 100,000 dictionary entries, followed by a blank line, followed by a message of up to 100,000 words. Each dictionary entry is a line containing an English word, followed by a space and a foreign language word. No foreign word appears more than once in the dictionary. The message is a sequence of words in the foreign language, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.
Output Output is the message translated to English, one word per line. Foreign words not in the dictionary should be translated as "eh".
Sample Input

dog ogday
cat atcay
pig igpay
froot ootfray
loops oopslay

atcay
ittenkay
oopslay

Sample Output

cat
eh
loops

JAva--単純な地主闘争を実現

【TableauServerLinux】Tableauワークブック形式のダウンロードができないときの対応