TuHoangAnh's blog

By TuHoangAnh, history, 3 years ago, In English

there are n piles of coin, the i'th pile has A[i] coints. Alice and Peter want to play a game. They play alternatively, on each move, they can remove some coins from any piles.The winner is the last person to remove all coins from the last pile. in the begining, they can know who is the winner, so the loser will maximize the number of moves and the winner will try to minimize it. Printf the number of moves if both players play optimally.

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

»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by TuHoangAnh (previous revision, new revision, compare).

»
3 years ago, # |
  Vote: I like it +10 Vote: I do not like it

can you give me link of question?