Files
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-31-coin-sums.md
Oliver Eyton-Williams dec409a4bd fix: s/localeTitle/title/g
2020-10-06 23:10:08 +05:30

68 lines
1.2 KiB
Markdown
Raw Blame History

This file contains ambiguous Unicode characters

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

---
id: 5900f38b1000cf542c50fe9e
challengeType: 5
videoUrl: ''
title: 问题31硬币总和
---
## Description
<section id="description">
在英格兰货币由英镑英镑和便士p组成并且有八种普通硬币流通
1p2p5p10p20p50p£1100p和£2200p
可以通过以下方式赚取£2
1×£1 + 1×50p + 2×20p + 1×5p + 1×2p + 3×1p
使用任意数量的硬币可以制成多少种便士?
</section>
## Instructions
<section id="instructions">
</section>
## Tests
<section id='tests'>
```yml
tests:
- text: <code>digitnPowers(50)</code>应该返回451。
testString: assert(coinSums(50) == 451);
- text: <code>digitnPowers(100)</code>应该返回4563。
testString: assert(coinSums(100) == 4563);
- text: <code>digitnPowers(150)</code>应该返回21873。
testString: assert(coinSums(150) == 21873);
- text: <code>digitnPowers(200)</code>应该返回73682。
testString: assert(coinSums(200) == 73682);
```
</section>
## Challenge Seed
<section id='challengeSeed'>
<div id='js-seed'>
```js
function coinSums(n) {
// Good luck!
return n;
}
coinSums(200);
```
</div>
</section>
## Solution
<section id='solution'>
```js
// solution required
```
/section>