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

id	challengeType	title	videoUrl	localeTitle
5900f3b41000cf542c50fec7	5	Problem 72: Counting fractions		问题72：计算分数

Description

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

说明

测试

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

挑战种子

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

解

 // solution required 

Instructions

Tests

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

Challenge Seed

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

euler72();

Solution

// solution required