algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-06 02:13:15 +08:00
Code Issues Packages Projects Releases Wiki Activity

[mypy] fix type annotations for all Project Euler problems (#4747)

Browse Source 
* [mypy] fix type annotations for problem003/sol1 and problem003/sol3

* [mypy] fix type annotations for project euler problem007/sol2

* [mypy] fix type annotations for project euler problem008/sol2

* [mypy] fix type annotations for project euler problem009/sol1

* [mypy] fix type annotations for project euler problem014/sol1

* [mypy] fix type annotations for project euler problem 025/sol2

* [mypy] fix type annotations for project euler problem026/sol1.py

* [mypy] fix type annotations for project euler problem037/sol1

* [mypy] fix type annotations for project euler problem044/sol1

* [mypy] fix type annotations for project euler problem046/sol1

* [mypy] fix type annotations for project euler problem051/sol1

* [mypy] fix type annotations for project euler problem074/sol2

* [mypy] fix type annotations for project euler problem080/sol1

* [mypy] fix type annotations for project euler problem099/sol1

* [mypy] fix type annotations for project euler problem101/sol1

* [mypy] fix type annotations for project euler problem188/sol1

* [mypy] fix type annotations for project euler problem191/sol1

* [mypy] fix type annotations for project euler problem207/sol1

* [mypy] fix type annotations for project euler problem551/sol1
This commit is contained in:
Joyce
2021-10-12 00:33:44 +08:00
committed by GitHub
parent e311b02e70
commit bcfca67faa
20 changed files with 43 additions and 26 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
project_euler/problem_007/sol2.py
View File

@ -73,7 +73,7 @@ def solution(nth: int = 10001) -> int:
raise TypeError("Parameter nth must be int or castable to int.") from None
if nth <= 0:
raise ValueError("Parameter nth must be greater than or equal to one.")
primes = []
primes: list[int] = []
num = 2
while len(primes) < nth:
if isprime(num):