mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-24 05:21:09 +00:00
Code Issues Packages Projects Releases Wiki Activity

Improve solution (#5705)

Browse Source
This commit is contained in:
Maxim Smolskiy 2021-10-31 13:37:46 +03:00 committed by GitHub
parent 965b1ff7df
commit 568425dfd1
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
project_euler/problem_072/sol1.py
View File

@ -18,7 +18,7 @@ Number of numbers between 1 and n that are coprime to n is given by the Euler's
function, phi(n). So, the answer is simply the sum of phi(n) for 2 <= n <= 1,000,000 function, phi(n). So, the answer is simply the sum of phi(n) for 2 <= n <= 1,000,000
Sum of phi(d), for all d|n = n. This result can be used to find phi(n) using a sieve. Sum of phi(d), for all d|n = n. This result can be used to find phi(n) using a sieve.
Time: 3.5 sec Time: 1 sec
""" """
@ -36,8 +36,9 @@ def solution(limit: int = 1_000_000) -> int:
phi = [i - 1 for i in range(limit + 1)] phi = [i - 1 for i in range(limit + 1)]
for i in range(2, limit + 1): for i in range(2, limit + 1):
for j in range(2 * i, limit + 1, i): if phi[i] == i - 1:
phi[j] -= phi[i] for j in range(2 * i, limit + 1, i):
phi[j] -= phi[j] // i
return sum(phi[2 : limit + 1]) return sum(phi[2 : limit + 1])