/* link to the challange is in the comment section INPUT INSTRUCTIONS :- enter the *input string* followed by the *rule* to translate the input string SAMPLE IMPUT :- abcdefgh abcd */ #include #include #include /****** function definations *******/ std::string translate(std::string&,std::string&); bool check_validity(std::string&); // checks if the rule is valid or not /****** main() function *******/ int main() { std::string st,rule,result; std::cin>>st>>rule; result = translate(st,rule); std::cout<<"original string = "< map; for (long unsigned int i = 0; i < rule.length(); i+=2) { if(rule[i+1] != '\0') map[rule[i]] = rule[i+1]; else map[rule[i]] = '0'; } for (long unsigned int i = 0; i < st.length(); ++i) { if(map.find(st[i]) == map.end()) { // key is not there in the map result.push_back(st[i]); } else if(map[st[i]] != '0') { result.push_back(map[st[i]]); } } } else // return an error messages if the rule is not correct { result = "ERROR: invalid rule"; } return result; } bool check_validity(std::string & str) { int checker = 0; // using an integer as a bitset instead of an array for (long unsigned int i = 0; i < str.length(); i+=2) { int bitAtIndex = str[i] - 'a'; if ((checker & (1 << bitAtIndex)) > 0) { return false; } checker = checker | (1 << bitAtIndex); } return true; }

Translate ( frogged challange )