gaspersic/freeCodeCamp
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

chore(i18n,learn): processed translations (#45599)

Browse Source
This commit is contained in:
camperbot
2022-04-02 14:16:30 +05:30
committed by GitHub
parent f7afac00a6
commit 40a6abe1b0
104 changed files with 4316 additions and 108 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
curriculum/challenges/japanese/10-coding-interview-prep/project-euler/problem-440-gcd-and-tiling.md
View File

@ -24,7 +24,8 @@ $1 ≤ a, b, c ≤ L$ のとき、三重和 $\sum_{a, b, c} gcd(T(c^a), T(c^b))$
例えば、次のようになります。
$$\begin{align} & S(2) = 10\\,444 \\\\ & S(3) = 1\\,292\\,115\\,238\\,446\\,807\\,016\\,106\\,539\\,989 \\\\ & S(4)\bmod 987\\,898\\,789 = 670\\,616\\,280. \end{align}$$
$$\begin{align} & S(2) = 10\\,444 \\\\
& S(3) = 1\\,292\\,115\\,238\\,446\\,807\\,016\\,106\\,539\\,989 \\\\ & S(4)\bmod 987\\,898\\,789 = 670\\,616\\,280. \end{align}$$
$S(2000)\bmod 987\\,898\\,789$ を求めなさい。