* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
809 B
809 B
id, title, challengeType, videoUrl, dashedName
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
5900f4391000cf542c50ff4c | 问题205:骰子游戏 | 5 | problem-205-dice-game |
--description--
彼得有九个四面(金字塔)骰子,每个骰子都有编号为1,2,3,4的面孔。科林有六个六面(立方体)骰子,每个骰子都有编号为1,2,3,4,5,6的面孔。
彼得和科林掷骰子并比较总数:总得分最高。如果总数相等,结果是平局。
金字塔皮特击败立方科林的几率是多少?将您的答案四舍五入到0.abcdefg形式的七位小数
--hints--
euler205()
应该返回0.5731441。
assert.strictEqual(euler205(), 0.5731441);
--seed--
--seed-contents--
function euler205() {
return true;
}
euler205();
--solutions--
// solution required