freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-322-binomial-coeffi...

881 B
Raw Blame History

id challengeType videoUrl title
5900f4af1000cf542c50ffc1 5 问题322二项式系数可被10整除

Description

Let T(m, n) be the number of the binomial coefficients iCn that are divisible by 10 for n ≤ i < m(i, m and n are positive integers). You are given that T(109, 107-10) = 989697000.

Find T(1018, 1012-10).

Instructions

Tests

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

Challenge Seed

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

euler322();

Solution

// solution required

/section>