//By Bell /* Challenge by Anton Böhler, the impossible bet 100 programmers are numbered 1-100. In a room there are 100 boxes containing one number each. Each programmer comes into a room one at a time and has the chance to look in 50 boxes to find his/her number. If so, great! Puts it back in the box and leaves the room through a different exit. Then, the next person tries to find his/her number. If all find their own numbers, all win. But if even one can't find his/her number, all loose. Rules. 1. You can only enter the room one at a time. 2. You can only look in half (50) of the boxes when you enter the room. 3. You can't alter anything in the room while you're in there. 4. You can agree on a strategy before you enter the room but you can't communicate afterwards. */ #include #include // std::shuffle #include // std::array #include // std::default_random_engine #include // std::chrono::system_clock using namespace std; int main() { int n=100, nch=0,j; array boxes; // obtain a time-based seed: unsigned seed = std::chrono::system_clock::now().time_since_epoch().count(); for(int i=0;i0){ nch++; cout<<"Next chain starting at: "<0){ cout<<'\n'<<"Length of the chain is: "<(n/2)){ cout<<"Programmers lost, this chain is longer than "<<(n/2)<

InpossibleBetBoehler