/* Coding challenge given N teams. N should be even. They should play against each other in N-1 rounds. Build the pairs for each round. The algorithm is the following: Place T1 in the middle of a circle and T2... TN around it. In Round i T1 plays against Ti+1. The other pairs are built by those teams which have the same distance to Ti+1. I hope the sketch can clarify what I mean. User input is number of Teams. You can name them by T1, T2,... Result should be last step of https://code.sololearn.com/WtL49yMDB4TE/?ref=app Every language can do it https://www.sololearn.com/post/116821/?ref=app */ #include #include #include #include #include using namespace std; int main() { vector nteams{2,4,6,8,7,9}; for_each(begin(nteams), end(nteams), [](auto tsz){ if (tsz & 1) { cerr << "invalid number " << tsz << " specified for team size, must be even number\n"; } else { vector teams(tsz); cout << "Number of Teams : " << tsz << "\n"; // genrate teams iota(begin(teams), end(teams),1); for(int i{0}; i (cout,""),[](auto lhs, auto rhs) { return "(T"s + to_string(lhs) + '-' + "T"s + to_string(rhs) + ")"; }); cout << "\n\n"; } // end for } // end else });// end for_each } // end main

[Challenge] Tournament.cpp