freeCodeCamp/curriculum/challenges/chinese/08-coding-interview-prep/project-euler/problem-73-counting-fractions-in-a-range.chinese.md

---
id: 5900f3b61000cf542c50fec8
challengeType: 5
title: 'Problem 73: Counting fractions in a range'
videoUrl: ''
localeTitle: 问题73：计算范围内的分数
---

## Description
<section id="description">考虑分数，n / d，其中n和d是正整数。如果是<d 1="" 2="" 3="" 4="" 5="" 6="" 7="" 8="" and="" hcf(n,d)="1," it="" is="" called="" a="" reduced="" proper="" fraction.="" if="" we="" list="" the="" set="" of="" fractions="" for="" d="" ≤="" in="" ascending="" order="" size,="" get:="" 8,="" 7,="" 6,="" 5,="" 4,="" 3,="" 2,="" can="" be="" seen="" that="" there="" are="" between="" 2.="" how="" many="" lie="" sorted="" 12,000?="" &#x3C;="" section=""><h2>说明</h2><section id="instructions"></section><h2>测试</h2><section id="tests"><pre> <code class="language-yml">tests: - text: &lt;code&gt;euler73()&lt;/code&gt; should return 7295372. testString: &#39;assert.strictEqual(euler73(), 7295372, &quot;&lt;code&gt;euler73()&lt;/code&gt; should return 7295372.&quot;);&#39;</code> </pre></section><h2>挑战种子</h2><section id="challengeSeed"><div id="js-seed"><pre> <code class="language-js">function euler73() { // Good luck! return true; } euler73();</code> </pre></div></section><h2>解</h2><section id="solution"><pre> <code class="language-js">// solution required</code> </pre></section></d></section>

## Instructions
<section id="instructions">
</section>

## Tests
<section id='tests'>

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

```

</section>

## Challenge Seed
<section id='challengeSeed'>

<div id='js-seed'>

```js
function euler73() {
  // Good luck!
  return true;
}

euler73();

```

</div>



</section>

## Solution
<section id='solution'>

```js
// solution required
```
</section>