/* ********************************************* Usage Example [Code Playground]: Enter sentences to work with separated by new line, the code will continue processing while input is not empty. @Ipang © 2018 SoloLearn Community ********************************************* [ Challenge link ] https://www.sololearn.com/Discuss/1045266/?ref=app [ Description ] Challenge: Overwriting Try to do a program in any language which: 0- Be commented to explain it. 1- Get a message. 2 - Convert it vowels to numbers. a/A -> 4 e/E -> 3 i/I -> 1 o/O -> 0 u/U -> 7 3- Show original and converted message. For example: message = "This is Sololearn" converted = "Th1s 1s S0l0l34rn" */ #include #include // Main procedure int main() { // The original message std::string haystack; // Substring to find, upper & lower case // and the replacement string std::string needle[5][3] { {"A","a","4"}, {"E","e","3"}, {"I","i","1"}, {"O","o","0"}, {"U","u","7"} }; // Position of needle in haystack std::string::size_type p; // Row and col (refer to needle) unsigned int R, C; do { // Get input for haystack. // * Exit loop if input is invalid. // * Check next input if current input // is an empty line. std::getline(std::cin,haystack); if(!std::cin.good()) break; if(haystack.empty()) continue; // Initialize position, and indices // for needle array row & column p = R = C = 0; // Display original message std::cout << "Message:\n\"" << haystack << "\"\n\nConverted:\n"; while(true) { // Try to find needle in haystack p = haystack.find(needle[R][C], p); // If needle not found if(p == std::string::npos) { // Exit loop if we have got to // the last substring to find if(R == 4 && C == 1) break; // Process next row if we're // done with the second column if(C == 1) { R++; C = 0; } else // Process next column from // the same row C++; // Start over again from the // beginning of haystack p = 0; continue; } // Replace 1 character in haystack // with the 3rd string from row // at position (offset)

. haystack.replace(p, 1, needle[R][2]); // Increment start searching point p++; } // Display modified haystack std::cout << "\"" << haystack << "\"\n\n" << std::string(35, 61) << "\n\n"; } while(true); return 0; }

Challenge - Overwriting