//by bell /* [Challenge] by OmaFalk Frenemies11 The team 11friends which has 11 members is completely out of order. Before they rename to nofriends they will give themselves a very last chance: A round table organized by a mediator shall do it. After the mediators postbox bursted with emails like "... but I dont want to sit next to...", he ultimately demanded from each member exactly 4(better user input) persons he eventually could imagine to sit next to. To the mediators own surprise all members followed his command. your task: assign to each member m1.. m11 a random list of iCouldSitNextTo. Now find out, if 11 chairs are enough or if further chairs are needed as seperator. */ #include #include #include #include // std::shuffle using namespace std; bool notvalid(string s,string& sol){ vectorpaths={"a"}; vectortemp; string kc=""; int k, l, icount=0; const int N=4; size_t fnd; cout<<"\nBuilding longest chains:\n"; while(icount<10){ for(auto path : paths){ kc=path[path.length()-1]; k=char(path[path.length()-1])-97; k*=N; for(int i=k;i v={"ali","bo","cleo","di","em","flo","guy","hal","ira","jo","kay"}; string num="abcdefghijk",choice,s,w; const int N=4; int j; srand(time(0)); choice=num; cout<<"The eleven frenemies will be represented by the initials in their names\n"<<"Their choices are:\n"; for(int i=0;i<11;i++){random_shuffle(choice.begin(), choice.end()); s=""; j=0; while(s.length()

frenemiesHamiltonOmaFalk