algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-05 01:09:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

Add flake8-builtins to pre-commit and fix errors (#7105)

Browse Source 
Ignore `A003`

Co-authored-by: Christian Clauss <cclauss@me.com>
Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: Dhruv Manilawala <dhruvmanila@gmail.com>
This commit is contained in:
Caeden
2022-10-13 15:23:59 +01:00
committed by GitHub
parent e661b98829
commit d5a9f649b8
31 changed files with 113 additions and 106 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
project_euler/problem_070/sol1.py
View File

@ -72,7 +72,7 @@ def has_same_digits(num1: int, num2: int) -> bool:
return sorted(str(num1)) == sorted(str(num2))
def solution(max: int = 10000000) -> int:
def solution(max_n: int = 10000000) -> int:
"""
Finds the value of n from 1 to max such that n/φ(n) produces a minimum.
@ -85,9 +85,9 @@ def solution(max: int = 10000000) -> int:
min_numerator = 1 # i
min_denominator = 0 # φ(i)
totients = get_totients(max + 1)
totients = get_totients(max_n + 1)
for i in range(2, max + 1):
for i in range(2, max_n + 1):
t = totients[i]
if i * min_denominator < min_numerator * t and has_same_digits(i, t):