freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-40-champernownes-constant.chinese.md

id	challengeType	title	videoUrl	localeTitle
5900f3941000cf542c50fea7	5	Problem 40: Champernowne"s constant		问题40：Champernowne的常数

Description

通过连接正整数创建无理小数： 0.12345678910 1 112131415161718192021 ...可以看出小数部分的^第 12位是1.如果d _n代表小数部分的^第 n位，找到值以下表达式。 d ₁ ×d ₁₀ ×d ₁₀₀ ×d ₁₀₀₀ ×d ₁₀₀₀₀ ×d ₁₀₀₀₀₀ ×d _1000000

Instructions

Tests

tests:
  - text: <code>champernownesConstant(100)</code>应该返回5。
    testString: 'assert.strictEqual(champernownesConstant(100), 5, "<code>champernownesConstant(100)</code> should return 5.");'
  - text: <code>champernownesConstant(1000)</code>应该返回15。
    testString: 'assert.strictEqual(champernownesConstant(1000), 15, "<code>champernownesConstant(1000)</code> should return 15.");'
  - text: <code>champernownesConstant(1000000)</code>应该返回210。
    testString: 'assert.strictEqual(champernownesConstant(1000000), 210, "<code>champernownesConstant(1000000)</code> should return 210.");'

Challenge Seed

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

champernownesConstant(100);

Solution

// solution required