-
-
Notifications
You must be signed in to change notification settings - Fork 44.4k
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Add sol3 for project_euler problem_03 (#1553)
* Add sol3 for project_euler proble_03 * Update sol3.py add type hint remove unused variable * Format code with psf/black
- Loading branch information
Showing
1 changed file
with
63 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,63 @@ | ||
""" | ||
Problem: | ||
The prime factors of 13195 are 5,7,13 and 29. What is the largest prime factor | ||
of a given number N? | ||
e.g. for 10, largest prime factor = 5. For 17, largest prime factor = 17. | ||
""" | ||
|
||
|
||
def solution(n: int) -> int: | ||
"""Returns the largest prime factor of a given number n. | ||
>>> solution(13195) | ||
29 | ||
>>> solution(10) | ||
5 | ||
>>> solution(17) | ||
17 | ||
>>> solution(3.4) | ||
3 | ||
>>> solution(0) | ||
Traceback (most recent call last): | ||
... | ||
ValueError: Parameter n must be greater or equal to one. | ||
>>> solution(-17) | ||
Traceback (most recent call last): | ||
... | ||
ValueError: Parameter n must be greater or equal to one. | ||
>>> solution([]) | ||
Traceback (most recent call last): | ||
... | ||
TypeError: Parameter n must be int or passive of cast to int. | ||
>>> solution("asd") | ||
Traceback (most recent call last): | ||
... | ||
TypeError: Parameter n must be int or passive of cast to int. | ||
""" | ||
try: | ||
n = int(n) | ||
except (TypeError, ValueError): | ||
raise TypeError("Parameter n must be int or passive of cast to int.") | ||
if n <= 0: | ||
raise ValueError("Parameter n must be greater or equal to one.") | ||
i = 2 | ||
ans = 0 | ||
if n == 2: | ||
return 2 | ||
while n > 2: | ||
while n % i != 0: | ||
i += 1 | ||
ans = i | ||
while n % i == 0: | ||
n = n / i | ||
i += 1 | ||
|
||
return int(ans) | ||
|
||
|
||
if __name__ == "__main__": | ||
# print(solution(int(input().strip()))) | ||
import doctest | ||
|
||
doctest.testmod() |