← Back to Users
vanion's activity in the archive.
how'd you know you are connecting directly to https://www.xhamster.com/? they can simply alter DNS to make everything go through their proxies.
Assume all prisoners know k. Agree on i so that i > k. King must call each prisoner i times.Nominate candidate p. Only p and king can flip chalice up and down, all others can only flip chalice down.When a prisoner (except p) enters the room, if he seems the chalice is up he will flip it down. Else he will say "not sure" and leave.When p enters the room and the chalice is down, he will flip it up and leave, and count to himself. When his count reaches m, he can say "Yes".Best case: The king flips down k times. m = (n * i) - k + 1Worse case: The king does not do anything. m = (n * i) + 1
Slashdot Mirror
how'd you know you are connecting directly to https://www.xhamster.com/? they can simply alter DNS to make everything go through their proxies.
Assume all prisoners know k. Agree on i so that i > k. King must call each prisoner i times.
Nominate candidate p. Only p and king can flip chalice up and down, all others can only flip chalice down.
When a prisoner (except p) enters the room, if he seems the chalice is up he will flip it down. Else he will say "not sure" and leave.
When p enters the room and the chalice is down, he will flip it up and leave, and count to himself. When his count reaches m, he can say "Yes".
Best case: The king flips down k times. m = (n * i) - k + 1
Worse case: The king does not do anything. m = (n * i) + 1