I got a question about the problem description.

In other games, the losers hope to last the game longer for as many turns/rounds/moves as possible.

In this game, is the losers' optimal move to
(1) to minimize the difference,
(2) to maximize theirselves' scores, or
(3) to minimize the opponents' scores?

Or are the 3 goals lead to the same move?

Thanks.

Why the second difference is 1.937 and no 2.000?

u menja uzhe gorit
proboval ispravit' vse - ne pomogaet

zada4a to4no rewaetsja na pyhon?

plz daite neskolko primerov

The first student makes odd moves, second student makes even moves.

I have sent two solutions: one in Java, one in Pascal.
Java solution is more efficiently.
But Java solution got TL1, and Pascal solution got AC.
For optimization, i killed making instances of all classes in Java, but still TL1.
Can You change java time limit for this problem?

It was the same task on previos CBOSS contest. Does anybody knows how to solve it.