Comments
+1

Amazing idea !
0

My god ! Amazing !! If you start producing this send me a msg I would give you all my money to buy it for sure !
0

You just have to simulate the game, Alex and Bob start playing and Carl is spectating. So if Alex wins ( if the number is 1 ) you change Bob who lost with Carl , now Alex is playing with Carl if the number is 3 means that Carl wins, so you have to change the players again....

Do this until you find some absurd ( the person who wins is the spectator ) or until the movements finish.
+5

"Generally, a lot of hard working famous people are also very humble and they will tell you they had their moments of giving up, failing and feeling bad about themselves. You only see their success but not how they got there."

You made my day happier with this! Thanks bro

0

It's easy to see, xor(X,Y) = xor(Y,X) right ? So if (X,Y) is a valid pair, (Y,X) would be as well.

As you can see the answer comes in pairs, that's why it's always even.

Don't forget that xor(X,X) = 0 and 0 is not allowed in the problem so you will never count this one.
0

If you have two people that like pizza A more than B. Suppose that the first one likes A = 15 and B = 14 and the second one likes A = 5 and B = 1.

If you have to chose one of them to feed using pizza B (because you don't have pizza A anymore), which one you would you chose? It's easy to see that the first one is better because you would lose less than if you chose the second (15-14 < 5-1).

So if you have to change someone take the one whose difference between A and B is minimum.
0

Can you please explain why the number of ways to choose 3 elements out of n is n*(n-1)*(n-2)/6 ?

+3

I am not able to understand letter E, can someone explain me more clearly please ?