1.1 KiB
1.1 KiB
id | challengeType | title | videoUrl | localeTitle |
---|---|---|---|---|
5900f43e1000cf542c50ff50 | 5 | Problem 210: Obtuse Angled Triangles | 问题210:钝角三角形 |
Description
什么是N(1,000,000,000)?
Instructions
Tests
tests:
- text: <code>euler210()</code>应该返回1598174770174689500。
testString: 'assert.strictEqual(euler210(), 1598174770174689500, "<code>euler210()</code> should return 1598174770174689500.");'
Challenge Seed
function euler210() {
// Good luck!
return true;
}
euler210();
Solution
// solution required