/* * Simple Spam Detector * to check how it works input some sentence that contains * substrings that satisfy given patterns. * * To see which patterns are maintained refer to * isSpam() function implementation */ #include #include // std::size_t #include // std::regex... using namespace std; bool isSpam(const string& message, string& matches); int main() { string message; string matches = ""; //Input the message getline(cin, message); cout << "Your message: " << message; cout << endl << endl; if(isSpam(message, matches)) { cout << "Matches:\n" << matches << endl; cout << "Verdict: This is spam!" << endl; } else { cout << "Verdict: This isn't spam" << endl; } return 0; } bool isSpam(const string& message, string& matches) { using regex_constants::icase; cmatch cmatches; bool hasMatches = false; //patterns to compare regex patterns[] = { regex("(you just need)? (to)? click on the link", icase), // "CredEntials...", etc regex("(your)? credentials", icase), // "...100% free ..."", etc regex("[0-9]+%{1} free", icase), // "... frEE xxX VIDeo...", etc regex("(free)? *(xxx|porn) *(video)?", icase), regex("congratulations! *", icase), // "...Join ...to US!...", "jointo uS...", etc regex("join *to", icase), // "... Profitable offER...", etc regex("(exclusive|profitable|limited){1}(commercial)? *offer", icase), regex("to *take *part *in *the *draw", icase), regex("personnel *information", icase), regex("(give|provide)? *credit *card") }; size_t pattslen = sizeof(patterns) / sizeof(patterns[0]); for(size_t i = 0; i < pattslen; i++) { // check if given message contains substring // that satisfy given pattern if(regex_search(message.c_str(), cmatches, patterns[i])) { matches += "\t" + cmatches.str() + "\n"; hasMatches = true; } } return hasMatches; }

[CONTEST] Spam Detector