TheAlgorithms/Python
1
0
Fork 0
Code Issues Pull Requests Actions 2 Packages Projects Releases Wiki Activity

Performance: 25% faster Project Euler 73 #10503 (#11553)

Browse Source 
* Seperate slow_solution and solution

* Add performance benchmark

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Fix issues

* Update sol1.py

* Update sol1.py

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: Maxim Smolskiy <mithridatus@mail.ru>
This commit is contained in:
Venkata Ramana Menda
2025-08-30 05:46:21 +05:30
committed by GitHub
parent 5c50572476
commit 488f143b8c
1 changed files with 6 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
project_euler/problem_073/sol1.py
View File

@@ -36,7 +36,12 @@ def solution(max_d: int = 12_000) -> int:
fractions_number = 0
for d in range(max_d + 1):
for n in range(d // 3 + 1, (d + 1) // 2):
n_start = d // 3 + 1
n_step = 1
if d % 2 == 0:
n_start += 1 - n_start % 2
n_step = 2
for n in range(n_start, (d + 1) // 2, n_step):
if gcd(n, d) == 1:
fractions_number += 1
return fractions_number