void solve () { TMap :: iterator Iter; Map.clear (); for ( int i = 0; i < N; i ++ ) { Iter = Map.find ( Info [i] ); if ( Iter == Map.end () ) Map [Info [i]] = 0 , Iter = Map.find ( Info [i] ); Iter->second ++; } for ( int i = 0; i < N; i ++ ) for ( int j = 0; j < N; j ++ ) if ( i != j ) { Ans = Info [i] + Info [j]; if ( check ()) { printf ( "%s\n" , Ans.c_str ()); return; } } }
void clear(void) { m_RemoveList.clear(); m_Map.clear(); }