mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2024-11-30 16:31:08 +00:00
Code Issues Packages Projects Releases Wiki Activity

Add type hints and default args for Project Euler problem 5 (#2982)

Browse Source 
* add type hints and default args for problem 5

* Update sol1.py

* Update sol2.py

Co-authored-by: Dhruv <dhruvmanila@gmail.com>
This commit is contained in:
Suyash Gupta 2020-10-08 08:50:11 +05:30 committed by GitHub
parent ff9be86390
commit 6a5a022082
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
project_euler/problem_05/sol1.py
View File

@ -8,7 +8,7 @@ remainder) by all of the numbers from 1 to N?
""" """
def solution(n): def solution(n: int = 20) -> int:
"""Returns the smallest positive number that is evenly divisible(divisible """Returns the smallest positive number that is evenly divisible(divisible
with no remainder) by all of the numbers from 1 to n. with no remainder) by all of the numbers from 1 to n.

6
project_euler/problem_05/sol2.py
View File

@ -9,18 +9,18 @@ remainder) by all of the numbers from 1 to N?
""" Euclidean GCD Algorithm """ """ Euclidean GCD Algorithm """
def gcd(x, y): def gcd(x: int, y: int) -> int:
return x if y == 0 else gcd(y, x % y) return x if y == 0 else gcd(y, x % y)
""" Using the property lcm*gcd of two numbers = product of them """ """ Using the property lcm*gcd of two numbers = product of them """
def lcm(x, y): def lcm(x: int, y: int) -> int:
return (x * y) // gcd(x, y) return (x * y) // gcd(x, y)
def solution(n): def solution(n: int = 20) -> int:
"""Returns the smallest positive number that is evenly divisible(divisible """Returns the smallest positive number that is evenly divisible(divisible
with no remainder) by all of the numbers from 1 to n. with no remainder) by all of the numbers from 1 to n.