freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-71-ordered-fractions.chinese.md

id, challengeType, title, videoUrl, localeTitle

id	challengeType	title	videoUrl	localeTitle
5900f3b31000cf542c50fec6	5	Problem 71: Ordered fractions		问题71：有序分数

Description

考虑分数，n / d，其中n和d是正整数。如果是

说明

测试

 tests: - text: <code>euler71()</code> should return 428570. testString: 'assert.strictEqual(euler71(), 428570, "<code>euler71()</code> should return 428570.");' 

挑战种子

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

解

 // solution required 

Instructions

Tests

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

Challenge Seed

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

euler71();

Solution

// solution required