poj 2503 map 방법

6541 단어 데이터 구조
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 Hint Huge input and output,scanf and printf are recommended. 
#include
#include
#include
#include
#include
using namespace std;
map<string,string>mp;
int main()
{
    int l,t;
    string s,s1,s2;
    getline(cin,s);
    l=s.length();
    while(l!=0)
    {
        t=s.find(' ',0);//        
        s1.assign(s,0,t);//string &assign(const string &s,int start,int n);    s  start   n          
        s2.assign(s,t+1,l-t-1);
        mp[s2]=s1;
        getline(cin,s);
        l=s.length();
    }
    while(cin>>s)
    {
        if(mp.find(s)!=mp.end())
            cout<<mp[s]<<endl;
        else
            cout<<"eh"<<endl;
    }
    return 0;
}
poj의 가장 긴 공통 서열과 가장 긴 공통 문자열
C# 9 레코드는 기본적으로 변경할 수 없습니까?

좋은 웹페이지 즐겨찾기

개발자 우수 사이트 수집

개발자가 알아야 할 필수 사이트 100선 추천 우리는 당신을 위해 100개의 자주 사용하는 개발자 학습 사이트를 정리했습니다
best100-homepage