freeCodeCamp/problem-78-coin-partitions.chinese.md at f5eeda68d1dcdee7e0039a575b3d0d669b96199c

Files

Kristofer Koishigawa b3213fc892 fix(i18n): chinese test suite (#38220 )

* fix: Chinese test suite

Add localeTiltes, descriptions, and adjust test text and testStrings to get the automated test suite working.

* fix: ran script, updated testStrings and solutions

2020-03-03 18:49:47 +05:30

978 B

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3ba1000cf542c50fecd	5	Problem 78: Coin partitions		问题78：硬币分区

Description

设p（n）表示n个硬币可以分成桩的不同方式的数量。例如，五个硬币可以用七种不同的方式分成几堆，所以p（5）= 7。

OOOOO OOOO O OOO OO OOO O O OO OO O O O O O O O O O O O O O O O O O O O O O O O O O

找到n的最小值，p（n）可以被一百万整除。

Instructions

Tests

tests:
  - text: <code>euler78()</code>应返回55374。
    testString: assert.strictEqual(euler78(), 55374);

Challenge Seed

function euler78() {
  // Good luck!
  return true;
}

euler78();

Solution

// solution required

978 B Raw Blame History Unescape Escape