algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2026-03-13 09:50:19 +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

4
project_euler/problem_065/sol1.py
View File

@@ -71,7 +71,7 @@ def sum_digits(num: int) -> int:
return digit_sum
def solution(max: int = 100) -> int:
def solution(max_n: int = 100) -> int:
"""
Returns the sum of the digits in the numerator of the max-th convergent of
the continued fraction for e.
@@ -86,7 +86,7 @@ def solution(max: int = 100) -> int:
pre_numerator = 1
cur_numerator = 2
for i in range(2, max + 1):
for i in range(2, max_n + 1):
temp = pre_numerator
e_cont = 2 * i // 3 if i % 3 == 0 else 1
pre_numerator = cur_numerator

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):