gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity
Files
0bbbd16aa9a709a2622a8f22cc6dfb0dcb772fa5
freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-172-investigating-numbers-with-few-repeated-digits.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

835 B
Raw Blame History

id, challengeType, title, videoUrl, localeTitle
id challengeType title videoUrl localeTitle
5900f4181000cf542c50ff2b 5 Problem 172: Investigating numbers with few repeated digits 问题172：调查重复数字很少的数字

Description

有多少个18位数字n（没有前导零），n中没有数字出现超过三次？

Instructions

Tests

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

Challenge Seed

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

euler172();

Solution

// solution required