56 lines
1.2 KiB
Markdown
56 lines
1.2 KiB
Markdown
|
---
|
|||
|
id: 5900f5411000cf542c510054
|
|||
|
challengeType: 5
|
|||
|
title: 'Problem 468: Smooth divisors of binomial coefficients'
|
|||
|
videoUrl: ''
|
|||
|
localeTitle: 问题468:二项式系数的平滑除数
|
|||
|
---
|
|||
|
|
|||
|
## Description
|
|||
|
<section id="description">如果没有一个整数因子大于B,则整数称为B-smooth。 <p>设SB(n)是n的最大B-平滑除数。示例:S1(10)= 1 S4(2100)= 12 S17(2496144)= 5712 </p><p>定义F(n)=Σ1≤B≤nΣ0≤r≤nSB(C(n,r))。这里,C(n,r)表示二项式系数。示例:F(11)= 3132 F(1 111)mod 1 000 000 993 = 706036312 F(111 111)mod 1 000 000 993 = 22156169 </p><p>求F(11 111 111)mod 1 000 000 993。 </p></section>
|
|||
|
|
|||
|
## Instructions
|
|||
|
<section id="instructions">
|
|||
|
</section>
|
|||
|
|
|||
|
## Tests
|
|||
|
<section id='tests'>
|
|||
|
|
|||
|
```yml
|
|||
|
tests:
|
|||
|
- text: <code>euler468()</code>应该返回852950321。
|
|||
|
testString: 'assert.strictEqual(euler468(), 852950321, "<code>euler468()</code> should return 852950321.");'
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Challenge Seed
|
|||
|
<section id='challengeSeed'>
|
|||
|
|
|||
|
<div id='js-seed'>
|
|||
|
|
|||
|
```js
|
|||
|
function euler468() {
|
|||
|
// Good luck!
|
|||
|
return true;
|
|||
|
}
|
|||
|
|
|||
|
euler468();
|
|||
|
|
|||
|
```
|
|||
|
|
|||
|
</div>
|
|||
|
|
|||
|
|
|||
|
|
|||
|
</section>
|
|||
|
|
|||
|
## Solution
|
|||
|
<section id='solution'>
|
|||
|
|
|||
|
```js
|
|||
|
// solution required
|
|||
|
```
|
|||
|
</section>
|