freeCodeCamp/problem-77-prime-summations.chinese.md at 3ee1c39e41c1aae3b0b23b3e79fba3ec1aae1989

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

849 B

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3b91000cf542c50fecc	5	Problem 77: Prime summations		问题77：总结

Description

可以用五种不同的方式将十个作为素数之和：7 + 3 5 + 5 5 + 3 + 2 3 + 3 + 2 + 2 2 + 2 + 2 + 2 + 2第一个值是多少可以用五千多种不同的方式写成素数之和？

Instructions

Tests

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

Challenge Seed

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

euler77();

Solution

// solution required

849 B Raw Blame History Unescape Escape