* feat(tools): add seed/solution restore script * chore(curriculum): remove empty sections' markers * chore(curriculum): add seed + solution to Chinese * chore: remove old formatter * fix: update getChallenges parse translated challenges separately, without reference to the source * chore(curriculum): add dashedName to English * chore(curriculum): add dashedName to Chinese * refactor: remove unused challenge property 'name' * fix: relax dashedName requirement * fix: stray tag Remove stray `pre` tag from challenge file. Signed-off-by: nhcarrigan <nhcarrigan@gmail.com> Co-authored-by: nhcarrigan <nhcarrigan@gmail.com>
678 B
678 B
id, title, challengeType, videoUrl, dashedName
id | title | challengeType | videoUrl | dashedName |
---|---|---|---|---|
5900f4af1000cf542c50ffc1 | 问题322:二项式系数可被10整除 | 5 | problem-322-binomial-coefficients-divisible-by-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).
--hints--
euler322()
应该返回999998760323314000。
assert.strictEqual(euler322(), 999998760323314000);
--seed--
--seed-contents--
function euler322() {
return true;
}
euler322();
--solutions--
// solution required