tvargrebanniy's blog

By tvargrebanniy, history, 8 months ago, In English

https://www.eolymp.com/en/problems/4578

Help needed in this problem. Thanks in advance.

  • Vote: I like it
  • -16
  • Vote: I do not like it

»
8 months ago, # |
  Vote: I like it 0 Vote: I do not like it

is there a non-hieroglyphic version of this problem?

  • »
    »
    8 months ago, # ^ |
    Rev. 2   Vote: I like it +6 Vote: I do not like it

    It's not exactly hierogliphyc. You'd say "it's greek to me" :) the site is supposedly Ukrainian, the language seemingly Russian, hence let me translate for you:

    Here is card game for 2 players. Initially each of them gets some amount of cards, say n1 and n2. On every turn players pick one from their hand and lay them on the table. Weaker of two is discarded, while stronger is returned to the owner's hand. If cards are equal, both are discarded.

    Game goes on until one of the players loses all cards. If the opponent still has some cards, he is awarded 1 point, otherwise both are awarded 0.5.

    There are N types of cards. "Strength" relation is not necessarily transitive and is given by matrix A — e.g. Aij = 1 means card i beats card j (otherwise 0).

    The goal is to determine maximal average win for the player, supposing the opponent uses silly-random strategy.


    Well, I agree problem may be curious, however description could be a bit more clear.