mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-12-18 09:10:16 +00:00
ddf83ec886
- Add default arguments to solution function - Add link to Project Euler problem 6 - Add doctest for testing `solution()` - Removed test_solutions.py as it is redundant
44 lines
1.1 KiB
Python
44 lines
1.1 KiB
Python
"""
|
||
Problem 6: https://projecteuler.net/problem=6
|
||
|
||
The sum of the squares of the first ten natural numbers is,
|
||
1^2 + 2^2 + ... + 10^2 = 385
|
||
|
||
The square of the sum of the first ten natural numbers is,
|
||
(1 + 2 + ... + 10)^2 = 552 = 3025
|
||
|
||
Hence the difference between the sum of the squares of the first ten natural
|
||
numbers and the square of the sum is 3025 − 385 = 2640.
|
||
|
||
Find the difference between the sum of the squares of the first N natural
|
||
numbers and the square of the sum.
|
||
"""
|
||
import math
|
||
|
||
|
||
def solution(n: int = 100) -> int:
|
||
"""Returns the difference between the sum of the squares of the first n
|
||
natural numbers and the square of the sum.
|
||
|
||
>>> solution(10)
|
||
2640
|
||
>>> solution(15)
|
||
13160
|
||
>>> solution(20)
|
||
41230
|
||
>>> solution(50)
|
||
1582700
|
||
>>> solution()
|
||
25164150
|
||
"""
|
||
sum_of_squares = sum([i * i for i in range(1, n + 1)])
|
||
square_of_sum = int(math.pow(sum(range(1, n + 1)), 2))
|
||
return square_of_sum - sum_of_squares
|
||
|
||
|
||
if __name__ == "__main__":
|
||
import doctest
|
||
|
||
doctest.testmod()
|
||
print(solution(int(input().strip())))
|