Dificultad: procesamiento de cadenas
![](https://images.cnblogs.com/OutliningIndicators/ContractedBlock.gif)
#include <iostream> #include <cstring> #include <cstdio> #include <map> usando el espacio de nombres std; char ss [ 100 ], s1 [ 50 ], s2 [ 50 ]; cadena s3; mapa < cadena , cadena > mp; int main () { // freopen ("en", "r", stdin); while (gets (ss)) { if (! strlen (ss)) break ; sscanf (ss, " % s% s " , s1, s2); pf [s2] = s1; } while (cin >> s3) { if (mp.find (s3)! = mp.end ()) cout << mp [s3] << endl; else pone ( " eh " ); } devuelve 0 ; }