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

[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

4
project_euler/problem_003/sol1.py
View File

@@ -92,8 +92,8 @@ def solution(n: int = 600851475143) -> int:
return n
for i in range(3, int(math.sqrt(n)) + 1, 2):
if n % i == 0:
if isprime(n / i):
max_number = n / i
if isprime(n // i):
max_number = n // i
break
elif isprime(i):
max_number = i

2
project_euler/problem_003/sol3.py
View File

@@ -57,7 +57,7 @@ def solution(n: int = 600851475143) -> int:
i += 1
ans = i
while n % i == 0:
n = n / i
n = n // i
i += 1
return int(ans)