freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-76-counting-summations.chinese.md

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3b81000cf542c50fecb	5	Problem 76: Counting summations		问题76：计算总结

Description

可以用六种不同的方式将五个作为总和写成：4 + 1 3 + 2 3 + 1 + 1 2 + 2 + 1 2 + 1 + 1 + 1 1 + 1 + 1 + 1 + 1多少个不同一百种方式可以写成至少两个正整数的总和？

Instructions

Tests

tests:
  - text: <code>euler76()</code>应该返回190569291。
    testString: 'assert.strictEqual(euler76(), 190569291, "<code>euler76()</code> should return 190569291.");'

Challenge Seed

function euler76() {
  // Good luck!
  return true;
}

euler76();

Solution

// solution required