freeCodeCamp/problem-322-binomial-coefficients-divisible-by-10.md at 873fce02a2d2124f3b76ce3f317fb29b34abb542

Files

Oliver Eyton-Williams dec409a4bd fix: s/localeTitle/title/g

2020-10-06 23:10:08 +05:30

881 B

Raw Blame History

id, challengeType, videoUrl, title

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>

881 B Raw Blame History Unescape Escape