Files
freeCodeCamp/curriculum/challenges/chinese/10-coding-interview-prep/project-euler/problem-447-retractions-c.md
Oliver Eyton-Williams dec409a4bd fix: s/localeTitle/title/g
2020-10-06 23:10:08 +05:30

886 B
Raw Blame History

id, challengeType, videoUrl, title
id challengeType videoUrl title
5900f52c1000cf542c51003e 5 问题447撤回C.

Description

对于每个整数n> 1函数族fnab由fnabx≡ax+ b mod n定义为abx整数和0

对于2≤n≤NFN=ΣRn。 F107≡638042271mod 1 000 000 007

求F1014mod 1 000 000 007

Instructions

Tests

tests:
  - text: <code>euler447()</code>应返回530553372。
    testString: assert.strictEqual(euler447(), 530553372);

Challenge Seed

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

euler447();

Solution

// solution required

/section>