freeCodeCamp/problem-79-passcode-derivation.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

1.0 KiB

Raw Blame History

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3bb1000cf542c50fece	5	Problem 79: Passcode derivation		问题79：密码派生

Description

用于在线银行业务的常见安全方法是向用户询问密码中的三个随机字符。例如，如果密码是531278，他们可能会要求输入第2，第3和第5个字符;预期的回复是：317。文本文件keylog.txt包含50次成功的登录尝试。鉴于总是按顺序询问三个字符，分析该文件以确定未知长度的最短可能秘密密码。

Instructions

Tests

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

Challenge Seed

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

euler79();

Solution

// solution required

1.0 KiB Raw Blame History Unescape Escape