https://www.eolymp.com/en/problems/4578
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 166 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 160 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
https://www.eolymp.com/en/problems/4578
Название |
---|
is there a non-hieroglyphic version of this problem?
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
andn2
. 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 awarded0.5
.There are
N
types of cards. "Strength" relation is not necessarily transitive and is given by matrixA
— e.g.Aij = 1
means cardi
beats cardj
(otherwise0
).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.