chore(i8n,learn): processed translations
This commit is contained in:
committed by
Mrugesh Mohapatra
parent
15047f2d90
commit
e5c44a3ae5
@ -1,28 +1,30 @@
|
||||
---
|
||||
id: 5900f4701000cf542c50ff83
|
||||
title: 问题260:石头游戏
|
||||
title: 'Problem 260: Stone Game'
|
||||
challengeType: 5
|
||||
videoUrl: ''
|
||||
forumTopicId: 301909
|
||||
dashedName: problem-260-stone-game
|
||||
---
|
||||
|
||||
# --description--
|
||||
|
||||
一场比赛由三堆石头和两名球员组成。在轮到时,玩家从堆中移除一个或多个宝石。但是,如果她从多个桩中取石头,她必须从每个选定的桩中移除相同数量的石头。
|
||||
A game is played with three piles of stones and two players.
|
||||
|
||||
换句话说,玩家选择一些N> 0并从任何一个桩中移除:N个石头;或任意两桩(总共2N)中的每一块N石;或者从三个桩中的每一个(总共3N)中的N个石头。拿最后一块石头的玩家赢了比赛。
|
||||
At her turn, a player removes one or more stones from the piles. However, if she takes stones from more than one pile, she must remove the same number of stones from each of the selected piles.
|
||||
|
||||
获胜配置是第一个玩家可以强制获胜的配置。例如,(0,0,13),(0,11,11)和(5,5,5)是获胜配置,因为第一个玩家可以立即移除所有宝石。
|
||||
In other words, the player chooses some N>0 and removes: N stones from any single pile; or N stones from each of any two piles (2N total); or N stones from each of the three piles (3N total). The player taking the last stone(s) wins the game.
|
||||
|
||||
失败的配置是第二个玩家可以强制获胜的配置,无论第一个玩家做什么。例如,(0,1,2)和(1,3,3)正在失去配置:任何合法移动都会为第二个玩家留下获胜配置。
|
||||
A winning configuration is one where the first player can force a win. For example, (0,0,13), (0,11,11) and (5,5,5) are winning configurations because the first player can immediately remove all stones.
|
||||
|
||||
考虑所有丢失的配置(xi,yi,zi),其中xi≤yi≤zi≤100。我们可以验证Σ(xi + yi + zi)= 173895。
|
||||
A losing configuration is one where the second player can force a win, no matter what the first player does. For example, (0,1,2) and (1,3,3) are losing configurations: any legal move leaves a winning configuration for the second player.
|
||||
|
||||
求Σ(xi + yi + zi)其中(xi,yi,zi)在失去的配置范围内,xi≤yi≤zi≤1000。
|
||||
Consider all losing configurations (xi,yi,zi) where xi ≤ yi ≤ zi ≤ 100. We can verify that Σ(xi+yi+zi) = 173895 for these.
|
||||
|
||||
Find Σ(xi+yi+zi) where (xi,yi,zi) ranges over the losing configurations with xi ≤ yi ≤ zi ≤ 1000.
|
||||
|
||||
# --hints--
|
||||
|
||||
`euler260()`应该返回167542057。
|
||||
`euler260()` should return 167542057.
|
||||
|
||||
```js
|
||||
assert.strictEqual(euler260(), 167542057);
|
||||
|
Reference in New Issue
Block a user