解題報告
題意:
略。
思路:
map應用。
#include #include #include #include #include #include #include #include using namespace std; mapMap; int main() { string str1,str2,str; int i,j; while(getline(cin,str)) { str1.clear(); str2.clear(); if(str[0]=='\0')break; for(i=0;i>str1) { if(!Map[str1].empty()) cout< Language of FatMouse Time Limit: 10 Seconds Memory Limit: 32768 KB We all know that FatMouse doesn't speak English. But now he has to be prepared since our nation will join WTO soon. Thanks to Turing we have computers to help him. Input Specification Input consists of up to 100,005 dictionary entries, followed by a blank line, followed by a message of up to 100,005 words. Each dictionary entry is a line containing an English word, followed by a space and a FatMouse word. No FatMouse word appears more than once in the dictionary. The message is a sequence of words in the language of FatMouse, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters. Output Specification Output is the message translated to English, one word per line. FatMouse 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 Output for Sample Input cat eh loops
We all know that FatMouse doesn't speak English. But now he has to be prepared since our nation will join WTO soon. Thanks to Turing we have computers to help him.
Input Specification
Input consists of up to 100,005 dictionary entries, followed by a blank line, followed by a message of up to 100,005 words. Each dictionary entry is a line containing an English word, followed by a space and a FatMouse word. No FatMouse word appears more than once in the dictionary. The message is a sequence of words in the language of FatMouse, one word on each line. Each word in the input is a sequence of at most 10 lowercase letters.
Output Specification
Output is the message translated to English, one word per line. FatMouse words not in the dictionary should be translated as "eh".
dog ogday cat atcay pig igpay froot ootfray loops oopslay atcay ittenkay oopslay
cat eh loops
Chromium中多線程及並發技術要點(C/C++)
[cpp] /* &nbs
LA 6801 Sequence(DP) 6
URAL - 1792 Hamming Code(枚舉)
在說明什麼是友元之前,我們先說明一下為什麼需要友
In-circles Again(簡單幾何) In-ci