Files
freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-148-exploring-pascals-triangle.chinese.md
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

1.3 KiB
Raw Blame History

id, challengeType, title, videoUrl, localeTitle
id challengeType title videoUrl localeTitle
5900f4021000cf542c50ff14 5 Problem 148: Exploring Pascal"s triangle 问题148探索帕斯卡的三角形

Description

我们可以很容易地验证Pascal三角形的前七行中的所有条目都不能被7整除

1

1

1

1

2

1

1

3

3

1

1

4

6

4

1

1

10

10

1 1

6

15

20

15

6

1然而如果我们检查前100行我们会发现5050个条目中只有2361个不能被7整除。

找到Pascal三角形的前十亿109行中不能被7整除的条目数。

Instructions

Tests

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

Challenge Seed

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

euler148();

Solution

// solution required