43 lines
678 B
Markdown
43 lines
678 B
Markdown
---
|
||
id: 5900f4af1000cf542c50ffc1
|
||
title: 问题322：二项式系数可被10整除
|
||
challengeType: 5
|
||
videoUrl: ''
|
||
dashedName: 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。
|
||
|
||
```js
|
||
assert.strictEqual(euler322(), 999998760323314000);
|
||
```
|
||
|
||
# --seed--
|
||
|
||
## --seed-contents--
|
||
|
||
```js
|
||
function euler322() {
|
||
|
||
return true;
|
||
}
|
||
|
||
euler322();
|
||
```
|
||
|
||
# --solutions--
|
||
|
||
```js
|
||
// solution required
|
||
```
|