mirror of
https://github.com/TheAlgorithms/Python.git
synced 2025-07-06 10:31:29 +08:00
Enable ruff ARG001 rule (#11321)
* Enable ruff ARG001 rule * Fix dynamic_programming/combination_sum_iv.py * Fix machine_learning/frequent_pattern_growth.py * Fix other/davis_putnam_logemann_loveland.py * Fix other/password.py * Fix * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Fix physics/n_body_simulation.py * Fix project_euler/problem_145/sol1.py * Fix project_euler/problem_174/sol1.py * Fix scheduling/highest_response_ratio_next.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Fix * Fix * Fix scheduling/job_sequencing_with_deadline.py * Fix scheduling/job_sequencing_with_deadline.py * Fix * Fix --------- Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
This commit is contained in:
@ -26,6 +26,8 @@ def solution(t_limit: int = 1000000, n_limit: int = 10) -> int:
|
||||
Return the sum of N(n) for 1 <= n <= n_limit.
|
||||
|
||||
>>> solution(1000,5)
|
||||
222
|
||||
>>> solution(1000,10)
|
||||
249
|
||||
>>> solution(10000,10)
|
||||
2383
|
||||
@ -45,7 +47,7 @@ def solution(t_limit: int = 1000000, n_limit: int = 10) -> int:
|
||||
for hole_width in range(hole_width_lower_bound, outer_width - 1, 2):
|
||||
count[outer_width * outer_width - hole_width * hole_width] += 1
|
||||
|
||||
return sum(1 for n in count.values() if 1 <= n <= 10)
|
||||
return sum(1 for n in count.values() if 1 <= n <= n_limit)
|
||||
|
||||
|
||||
if __name__ == "__main__":
|
||||
|
Reference in New Issue
Block a user