// by Bell /* Coding Challenge Oma Falk (aka master mind)) Given a 4-digit secret s of numbers 1..6. Let the user input a guess g and return the evaluation: G for each digit at the right place Y for each digit that occurs in the secret but at another place R for each digit that does not occur in the secret The output should be grouped by GYR Examples s: 1235 g: 1122 o:GYRR s:1156 g: 1531 o: GYYR s:1234 g:5231 o:GGYR have fun! #include #include using namespace std; int main(int, char **) { string s = "."; cout << s * 3 << endl; cout << 3 * s << endl; } if (mynumber.length() < 4)mynumber.insert(mynumber.front() == '-' ? 1 : 0, 4 - mynumber.length(), '0'); */ #include #include #include #include #include #include // std::shuffle #include // std::array #include // std::default_random_engine #include // std::chrono::system_clock using namespace std; double rateMatch(string m,string s){ double sum=0; for (int i=0; i learn; vector scores; cout<<"Input your secret number, please"<>snumber; cout<<"Now I will guess it, I promise I wasn\'t looking..."<::size_type k = 0; k != learn.size(); k++){ rate=rateMatch(mynumber,learn[k]); pass=false; if (abs(scores[k]-rate)>0.05)break; pass=true; } la=j-1; if(pass==true)break; last=la; } } // cout<

masterMind_akaOmaFalk